On inverse dynamical and spectral problems for the wave and Schrödinger equations on finite trees. The leaf peeling method

Abstract

Interest in inverse dynamical, spectral and scattering problems for differential equations on graphs is motivated by possible applications to nano-electronics and quantum waveguides and by a variety of other classical and quantum applications. Recently a new effective leaf peeling method has been proposed by S. Avdonin and P. Kurasov \cite{AK} for solving inverse problems on trees (graphs without cycles). It allows recalculating efficiently the inverse data from the original tree to the smaller trees, `removing' leaves step by step up to the rooted edge. In this paper we describe the main step of the spectral and dynamical versions of the peeling algorithm -- recalculating the inverse data for the `peeled tree'.

References in corpus (3)

• On an inverse problem for tree-like networks of elastic strings
• The boundary control approach to the Titchmarsh-Weyl $m-$function
• On the inverse problem of the two-velocity tree-like graph

Cited by in corpus (1)

• Discrete dynamical systems: inverse problems and related topics