Abstract
AbstractWe address the computational spectral theory of Jacobi operators that are compact perturbations of the free Jacobi operator via the asymptotic properties of a connection coefficient matrix. In particular, for Jacobi operators that are finite-rank perturbations we show that the computation of the spectrum can be reduced to a polynomial root finding problem, from a polynomial that is derived explicitly from the entries of a connection coefficient matrix. A formula for the spectral measure of the operator is also derived explicitly from these entries. The analysis is extended to trace-class perturbations. We address issues of computability in the framework of the Solvability Complexity Index, proving that the spectrum of compact perturbations of the free Jacobi operator is computable in finite time with guaranteed error control in the Hausdorff metric on sets.
Funder
London Mathematical Society
Engineering and Physical Sciences Research Council
Fonds Wetenschappelijk Onderzoek
Publisher
Springer Science and Business Media LLC
Subject
Mathematical Physics,Statistical and Nonlinear Physics
Reference55 articles.
1. Akhiezer, N.I., Kemmer, N.: The Classical Moment Problem: and Some Related Questions in Analysis, vol. 5. Oliver & Boyd Edinb, London (1965)
2. Atkinson, K., Han, W.: Theoretical Numerical Analysis, vol. 39. Springer, Berlin (2005)
3. Aurentz, J.L., Mach, T., Vandebril, R., Watkins, D.S.: Fast and backward stable computation of roots of polynomials. SIAM J. Matrix Anal. A. 36(3), 942–973 (2015)
4. Ben-Artzi, J., Colbrook, M.J., Hansen, A.C., Nevanlinna, O., Seidel, M.: Computing spectra – on the solvability complexity index and towers of algorithms, arXiv preprint arXiv:1508.03280 (2015)
5. Ben-Artzi, J., Hansen, A.C., Nevanlinna, O., Seidel, M.: New barriers in complexity theory: on the solvability complexity index and the towers of algorithms. C. R. Acad. Sci. Paris, Ser. I 353(10), 931–936 (2015)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献