arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.03670math-phmath.APmath.COmath.MP
收藏

A Calderón type inverse problem for tree graphs

Hannes Gernandt, Jonathan Rohleder

英文摘要:

We study the inverse problem of recovering a tree graph together with the weights on its edges (equivalently a metric tree) from the knowledge of the Dirichlet-to-Neumann matrix associated with the Laplacian. We prove an explicit formula which relates this matrix to the pairwise weighted distances of the leaves of the tree and, thus, allows to recover the weighted tree. This result can be viewed as a counterpart of the Calderón problem in the analysis of PDEs. In contrast to earlier results on inverse problems for metric graphs, we only assume knowledge of the Dirichlet-to-Neumann matrix for a fixed energy, not of a whole matrix-valued function.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑