Author:
Ben-Artzi Jonathan,Marletta Marco,Rösler Frank
Abstract
AbstractSchrödinger operators with periodic (possibly complex-valued) potentials and discrete periodic operators (possibly with complex-valued entries) are considered, and in both cases the computational spectral problem is investigated: namely, under what conditions can a ‘one-size-fits-all’ algorithm for computing their spectra be devised? It is shown that for periodic banded matrices this can be done, as well as for Schrödinger operators with periodic potentials that are sufficiently smooth. In both cases implementable algorithms are provided, along with examples. For certain Schrödinger operators whose potentials may diverge at a single point (but are otherwise well-behaved) it is shown that there does not exist such an algorithm, though it is shown that the computation is possible if one allows for two successive limits.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference39 articles.
1. Avila, A., Jitomirskaya, S.: The Ten Martini Problem. Ann. Math., 303–342 (2009)
2. Becker, S., Hansen, A.C.: Computing solutions of Schrödinger equations on unbounded domains-On the brink of numerical algorithms. arXiv: 2010.16347 e-prints (2020)
3. Beer, G.: Topologies on closed and closed convex sets. Mathematics and its Applications, vol. 268. Kluwer Academic Publishers Group, Dordrecht (1993)
4. Ben-Artzi, J., Colbrook, M.J., Hansen, A.C., Nevanlinna, O., Seidel, M.: Computing spectra—On the solvability complexity index hierarchy and towers of algorithms. arXiv: 1508.03280 e-prints (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. Comptes Rendus Math. 353(10), 931–936 (2015)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献