English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we consider the inverse dynamic problem for a one-dimensionalDirac system on finite metric tree graphs. Our main goal is to recover thetopology (connectivity) of a tree, lengths of edges, and a matrix potentialfunction on each edge. We use the dynamic response operator as our inverse dataand apply a Leaf peeling algorithm. In addition, we present a new dynamicalgorithm to solve the forward problem for the 1-D Dirac system on generalfinite metric tree graphs.

Inverse Dynamic Problem for a 1-D Dirac System on Finite Metric Tree Graphs and a Leaf Peeling Algorithm