The study of spectral properties of linear operators on an infinite-dimensional Hilbert space is of great interest. This task is especially difficult when the operator is non-selfadjoint or even non-normal. Standard approaches like spectral approximation by finite sections generally fail in that case.
In this talk we present an algorithm which rigorously computes upper and lower bounds for the spectrum and pseudospectrum of such operators using finite-dimensional approximations. One of our main fields of research is an efficient implementation of this algorithm. To this end we will demonstrate and evaluate methods for the computation of the pseudospectrum of finite-dimensional operators based on continuation techniques.
REFERENCES
1.
E. L.
Allgower
, K.
Georg
, Introduction to Numerical Continuation Methods
, Colorado State University
(1990
).2.
M.
Bruehl
, ”A Curve Tracing Algorithm for Computing the Pseudospectrum”, Numerical Mathematics
36
, BIT
, 441
–454
(1996
).3.
Z.
Bai
, J.
Demmel
et al., Templates for the Solution of Algebraic Eigenvalue Problems - A Practical Guide
1
, SIAM
(2000
).4.
D.
Mezher
, B.
Philippe
,“PAT - a Reliable Path Following Algorithm
”, Numerical Algorithms
29
131
–152
(2002
).5.
T.G.
Wright
, L. N.
Trefethen
, Pseudospectra of rectangular matrices
, IMA Journal of Numerical Analysis
22
501
–519
(2002
).6.
L. N.
Trefethen
, M.
Embree
, Spectra and Pseudospectra, The Behavior of Nonnormal Matrices and Operators
, Princeton University Press
(2005
).7.
S.
Chandler-Wilde
, R.
Chonchaiya
, M.
Lindner
, “On Spectral Inclusion Sets and Computing the Spectra and Pseudospectra of Bounded Linear Operators
”, in preparation
(2015
).
This content is only available via PDF.
© 2016 Author(s).
2016
Author(s)
You do not currently have access to this content.
