|
Zapiski Nauchnykh Seminarov POMI, 2015, Volume 438, Pages 7–21
(Mi znsl6180)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
On inverse dynamical and spectral problems for the wave and Schrödinger equations on finite trees. The leaf peeling method
S. A. Avdonina, V. S. Mikhaylovbc, K. B. Nurtazinad a Department of Mathematics and Statistics, University of Alaska Fairbanks, Fairbanks, AK 99775-6660, USA
b St. Petersburg Department of the Steklov Mathematical Institute, Fontanka 27, St. Petersburg 191023, Russia
c St. Petersburg State University, Faculty of Physics, University Embankment 7-9, St. Petersburg 199034, Russia
d L. N. Gumilyov Eurasian National University, 2 Satpayev Str., Astana, 010008, Kazakhstan
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 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’.
Key words and phrases:
inverse problem, leaf peeling method, ODE on graphs.
Received: 15.06.2015
Citation:
S. A. Avdonin, V. S. Mikhaylov, K. B. Nurtazina, “On inverse dynamical and spectral problems for the wave and Schrödinger equations on finite trees. The leaf peeling method”, Mathematical problems in the theory of wave propagation. Part 45, Zap. Nauchn. Sem. POMI, 438, POMI, St. Petersburg, 2015, 7–21; J. Math. Sci. (N. Y.), 224:1 (2017), 1–10
Linking options:
https://www.mathnet.ru/eng/znsl6180 https://www.mathnet.ru/eng/znsl/v438/p7
|
Statistics & downloads: |
Abstract page: | 244 | Full-text PDF : | 64 | References: | 46 |
|