×

A class of inverse problems for a quadratic pencil of Sturm-Liouville operators. (English. Russian original) Zbl 0971.34011

Differ. Equ. 36, No. 3, 471-473 (2000); translation from Differ. Uravn. 36, No. 3, 418-420 (2000).
The authors deal with the boundary value problem \(L\): \[ y''+[\lambda^2-2\lambda p(x)-q(x)]y=0, \quad 0<x<\pi, \]
\[ by(0)+y'(0)+\omega y(\pi)=0,\quad -\overline\omega y(0)+ay(\pi)+y'(\pi)=0, \] with \(p(x)\in W_2^1[0,\pi], q(x)\in L_2[0,\pi]\), \(a\) and \(b\) are real, and \(\omega\) is a complex number. Properties of the spectrum are studied, and the inverse problem of recovering \(p(x)\), \(q(x)\) and the coefficients of the boundary conditions from the given spectral data is investigated. For this inverse problem a uniqueness theorem is formulated and conditions for the solvability of the inverse problem are obtained.

MSC:

34B24 Sturm-Liouville theory
34L05 General spectral theory of ordinary differential operators
34A55 Inverse problems involving ordinary differential equations
47E05 General theory of ordinary differential operators
Full Text: DOI

References:

[1] Guseinov, I. M.; Nabiev, I. M., Mat. Sb., 186, 5, 35-48 (1995) · Zbl 0837.34020
[2] Gasymov, M. G., Uspekhi Mat. Nauk, 37, 4, 99-99 (1982)
[3] Gasymov, M. G.; Guseinov, G. Sh., Dokl. Akad. Nauk AzSSR, 37, 2, 19-23 (1981) · Zbl 0479.34009
[4] Guseinov, G. Sh., Dokl. Akad. Nauk SSSR, 285, 6, 1292-1296 (1985)
[5] Marchenko, V.A.,Operatory Shturma-Liuvillya i ikh prilozheniya (Sturm-Liouville Operators and Their Applications), Kiev, 1977. · Zbl 0399.34022
[6] Gasymov, M. G.; Guseinov, I. M.; Nabiev, I. M., Sib. Mat. Zh., 31, 6, 46-54 (1990) · Zbl 0728.34012
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.