Inverse Dynamic Problem for the Dirac System on Finite Metric Tree Graphs and the Leaf Peeling Method
Abstract
In this paper, we consider the inverse dynamic problem for the Dirac system on finite metric tree graphs. Our main goal is to recover the topology (connectivity) of a tree, lengths of edges, and a matrix potential function on each edge. We use the dynamic response operator as our inverse data and apply the Leaf peeling method. In addition, we present a new dynamic algorithm to solve the forward problem for the Dirac system on general finite metric graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.