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 for solving inverse problems on trees (graphs without cycles). It allows recalculating efficiently the inverse data from the original tree to smaller trees, “removing” leaves step by step up to the rooted edge. In this paper, the main step of the spectral and dynamical versions of the peeling algorithm, i.e., recalculating the inverse data for a “peeled tree” is described. Bibliography: 12 titles.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
