|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
M. I. Belishev, S. A. Simonov, “Triangular factorization and functional models of operators and systems”, Algebra i Analiz, 36:5 (2024), 101–127  |
|
2023 |
| 2. |
S. N. Naboko, S. Simonov, “Estimates of Green matrix entries of selfadjoint unbounded block Jacobi matrices”, Algebra i Analiz, 35:1 (2023), 243–261 ; St. Petersburg Math. J., 35:1 (2024), 185–199 |
| 3. |
M. I. Belishev, S. A. Simonov, “A functional model of a class of symmetric semi-bounded operators”, Zap. Nauchn. Sem. POMI, 521 (2023), 33–53 |
1
|
|
2021 |
| 4. |
S. N. Naboko, S. A. Simonov, “Titchmarsh–Weyl formula for the spectral density of a class of Jacobi matrices in the critical case”, Funktsional. Anal. i Prilozhen., 55:2 (2021), 21–43  ; Funct. Anal. Appl., 55:2 (2021), 94–112   |
4
|
|
2020 |
| 5. |
M. I. Belishev, S. A. Simonov, “The wave model of a metric space with measure and an application”, Mat. Sb., 211:4 (2020), 44–62  ; Sb. Math., 211:4 (2020), 521–538 |
5
|
|
2019 |
| 6. |
M. I. Belishev, S. A. Siminov, “The Wave Model of Metric Spaces”, Funktsional. Anal. i Prilozhen., 53:2 (2019), 3–10 |
4
|
| 7. |
M. I. Belishev, S. A. Simonov, “On an evolutionary dynamical system of the first order with boundary control”, Zap. Nauchn. Sem. POMI, 483 (2019), 41–54 |
2
|
|
2018 |
| 8. |
S. A. Simonov, “Wave model of the Sturm–Liouville operator on an interval”, Zap. Nauchn. Sem. POMI, 471 (2018), 225–260 ; J. Math. Sci. (N. Y.), 243:5 (2019), 783–807 |
1
|
|
2017 |
| 9. |
M. I. Belishev, S. A. Siminov, “Wave model of the Sturm–Liouville operator on the half-line”, Algebra i Analiz, 29:2 (2017), 3–33 ; St. Petersburg Math. J., 29:2 (2018), 227–248 |
13
|
|
|
|
2021 |
| 10. |
V. M. Babich, M. I. Belishev, M. N. Demchenko, G. L. Zavorokhin, V. V. Zalipaev, N. Ya. Kirpichnikova, A. P. Kiselev, D. V. Korikov, A. S. Mikhailov, S. A. Simonov, Z. A. Yanson, “Mikhail Mikhailovich Popov”, Zap. Nauchn. Sem. POMI, 506 (2021), 7–8 |
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: