On the Solvability Complexity Index, the n-pseudospectrum and approximations of spectra of operators

By Anders Christian Hansen. 2011

122 citations recorded by the source corpus.

We show that it is possible to compute spectra and pseudospectra of linear operators on separable Hilbert spaces given their matrix elements. The core in the theory is pseudospectral analysis and in particular the n-pseudospectrum and the residual pseudospectrum. We also introduce a new classification tool for spectral problems, namely, the Solvability Complexity Index. This index is an indicator of the "difficultness" of different computational spectral problems.

Subfields: Atomic and Molecular Physics, and Optics, Computational Theory and Mathematics, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/e50d9b16ac9b58acac5b98f37d30d769c63a062d