Abstract
The standard methods for computing pseudospectra of matrices are based on the computation of the smallest singular value on each point of the domain of interest, which must be discretized beforehand. A different approach consists of determining the different regions that constitute the pseudospectrum and computing the spectral projector associated with each region. The determination of these regions and the computation of the corresponding projectors use the spectral dichotomy methods. We briefly recall these methods and propose a parallel version with performance results obtained on CRAY T3E parallel machine.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S.K. Godunov, Problem of the dichotomy of the spectrum of a matrix, Siberian Math. J. 27 (1986) 649–660.
S.K. Godunov and M. Sadkane, Elliptic dichotomy of a matrix spectrum, Linear Algebra Appl. 248 (1996) 205–232.
S.K. Godunov and M. Sadkane, Computation of pseudospectra via spectral projectors, Linear Algebra Appl. 279 (1998) 163–175.
G.H. Golub and C. Van Loan, Matrix Computations, 2nd ed. (Johns Hopkins Univ. Press, Baltimore, MD, 1989).
N.J. Higham, The test matrix toolbox for Matlab (version 3.0), Technical Report, Manchester Centre for Computational Mathematics (1995).
R.A. Horn and C.R. Johnson, Topics in Matrix Analysis (Cambridge Univ. Press, Cambridge, 1991).
T. Kato, Perturbation Theory for Linear Operators (Springer, New York, 1976).
P.-F. Lavallée, Nouvelles approches de calcul du ε-spectre de matrices et faisceau de matrices, Thèse de l'Univeristé de Rennes I (1997).
P.-F. Lavallée, A. Malyshev and M. Sadkane, Spectral portrait of matrices by block diagonalization, in: First Internat. Workshop on Numerical Analysis and Applications, 1996, eds. L. Vulkov et al., Lecture Notes in Computer Science (Springer, New York, 1997) pp. 266–273.
P.-F. Lavallée and M. Sadkane, Pseudospectra of linear matrix pencils by block diagonalization, Computing 60 (1998) 133–156.
S.H. Lui, Computation of pseudospectra by continuation, SIAM J. Sci. Comput. 18 (1997) 565–573.
A.N. Malyshev, Parallel algorithm for solving some spectral problems of linear algebra, Linear Algebra Appl. 188/189 (1993) 489–520.
A.N. Malyshev and M. Sadkane, On parabolic and elliptic spectral dichotomy, SIAM J. Matrix Anal. Appl. 18 (1997) 265–278.
S. Otto, J. Dongarra, S. Hess-Lederman, M. Snir and D. Walker, Message Passing Interface: The Complete Reference (MIT Press, Cambridge, MA, 1995).
L.N. Trefethen, Pseudospectra of linear operators, SIAM Rev. 39 (1997) 383–406.
L.N. Trefethen, Computation of pseudospectra, ed. A. Iserles, Acta Numerica 8 (1999) 247–295.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lavallée, PF., Sadkane, M. Computation of Pseudospectra by Spectral Dichotomy Methods in a Parallel Environment. Numerical Algorithms 33, 343–355 (2003). https://doi.org/10.1023/A:1025540827695
Issue Date:
DOI: https://doi.org/10.1023/A:1025540827695