On the inverse problem of the two-velocity tree-like graph
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908382733008896 |
|---|---|
| author | Avdonin, S. A. Rivero, A. Choque Leugering, G. Mikhaylov, V. S. |
| author_facet | Avdonin, S. A. Rivero, A. Choque Leugering, G. Mikhaylov, V. S. |
| contents | In this article the authors continue the discussion in \cite{ALM}
about inverse problems for second order elliptic and hyperbolic equations
on metric trees from boundary measurements. In the present paper we prove
the identifiability of varying densities of a planar tree-like network of
strings along with the complete information on the graph, i.e. the lengths
of the edges, the edge degrees and the angles between neighbouring edges.
The results are achieved using the Titchmarch-Weyl function for the spectral
problem and the Steklov-Poincar{é} operator for the dynamic wave equation
on the tree. The general result is obtained by a peeling argument which reduces
the inverse problem layer-by-layer from the leaves to the clamped
root of the tree. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_22138 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the inverse problem of the two-velocity tree-like graph Avdonin, S. A. Rivero, A. Choque Leugering, G. Mikhaylov, V. S. Analysis of PDEs Spectral Theory In this article the authors continue the discussion in \cite{ALM} about inverse problems for second order elliptic and hyperbolic equations on metric trees from boundary measurements. In the present paper we prove the identifiability of varying densities of a planar tree-like network of strings along with the complete information on the graph, i.e. the lengths of the edges, the edge degrees and the angles between neighbouring edges. The results are achieved using the Titchmarch-Weyl function for the spectral problem and the Steklov-Poincar{é} operator for the dynamic wave equation on the tree. The general result is obtained by a peeling argument which reduces the inverse problem layer-by-layer from the leaves to the clamped root of the tree. |
| title | On the inverse problem of the two-velocity tree-like graph |
| topic | Analysis of PDEs Spectral Theory |
| url | https://arxiv.org/abs/2505.22138 |