On the Solvability Complexity Index, the n-pseudospectrum and approximations of spectra of operators
@article{Hansen2011OnTS, title={On the Solvability Complexity Index, the n-pseudospectrum and approximations of spectra of operators}, author={A. Hansen}, journal={Journal of the American Mathematical Society}, year={2011}, volume={24}, pages={81-124} }
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.
63 Citations
On the Solvability Complexity Index for Unbounded Selfadjoint and Schrödinger Operators
- Mathematics
- 2019
- 1
- Highly Influenced
- PDF
On The Solvability Complexity Index for Unbounded Selfadjoint Operators and Schr\"{o}dinger Operators
- Mathematics
- 2019
- PDF
On The Solvability Complexity Index for Unbounded Selfadjoint Operators and Schr\"{o}dinger Operators
- Mathematics
- 2019
- Highly Influenced
References
SHOWING 1-10 OF 70 REFERENCES
AF Embeddings and the Numerical Computation of Spectra in Irrational Rotation Algebras
- Mathematics
- 2003
- 13
- PDF
Improper filtrations for C*-algebras: spectra of unilateral tridiagonal operators
- Mathematics
- 1992
- 21
- PDF
Infinite-dimensional numerical linear algebra: theory and applications
- Mathematics
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- 2010
- 37
- PDF
Spectral properties of random non-self-adjoint matrices and operators
- Mathematics, Physics
- Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
- 2001
- 24
- PDF