On the inverse problem of the two-velocity tree-like graph

In this article the authors continue the discussion in 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...

Full description

Saved in:
Bibliographic Details
Published in:Zeitschrift für angewandte Mathematik und Mechanik Vol. 95; no. 12; pp. 1490 - 1500
Main Authors: Avdonin, Sergei, Rivero Abdon, Choque, Leugering, Günter, Mikhaylov, Victor
Format: Journal Article
Language:English
Published: Weinheim Blackwell Publishing Ltd 01-12-2015
Wiley Subscription Services, Inc
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article the authors continue the discussion in 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. The authors 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.
Bibliography:istex:E386497A2AF01A217617ED89C250B387D3D25F0C
ark:/67375/WNG-QN98M45S-P
ArticleID:ZAMM201400126
leugering@math.fau.de
vsmikhaylov@pdmi.ras.ru
abdon@ifm.umich.mx
ISSN:0044-2267
1521-4001
DOI:10.1002/zamm.201400126