Complexity Issues in Computing Spectra, Pseudospectra and Resolvents

2016/10/22 by Anders C. Hansen, Hansen, Anders C., Olavi Nevanlinna +1
Physics and Astronomy · Mathematics · #Quantum Mechanics and Non-Hermitian Physics #Algebraic and Geometric Analysis #Mathematical Analysis and Transform Methods

paper · pdf · doi:10.48550/arxiv.1610.07072

Abstract

We display methods that allow for computations of spectra, pseudospectra and resolvents of linear operators on Hilbert spaces and also elements in unital Banach algebras. The paper considers two different approaches, namely, pseudospectral techniques and polynomial numerical hull theory. The former is used for Hilbert space operators whereas the latter can handle the general case of elements in a Banach algebra. This approach leads to multicentric holomorphic calculus. We also discuss some new types of pseudospectra and the recently defined Solvability Complexity Index

Related

• Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms
• On the computation of geometric features of spectra of linear operators on Hilbert spaces
• A continuous approach to computing the pseudospectra of linear operators
• The foundations of spectral computations via the Solvability Complexity Index hierarchy
• On spectral inclusion sets and computing the spectra and pseudospectra of bounded linear operators