Papers › Universal algorithms for computing spectra of periodic operators
Universal algorithms for computing spectra of periodic operators
Jonathan Ben-Artzi, Marco Marletta, Frank Rösler
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Schr\"odinger 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\"odinger operators with periodic potentials that are sufficiently smooth. In both cases implementable algorithms are provided, along with examples. For certain Schr\"odinger 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections