Abstract
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 thenn-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.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call