Towards the effective parallel computation of matrix pseudospectra
ICS '01 Proceedings of the 15th international conference on Supercomputing
A graphical tool for driving the parallel computation of pseudosprectra
ICS '01 Proceedings of the 15th international conference on Supercomputing
Parallel computation of pseudospectra of large sparse matrices
Parallel Computing - Parallel matrix algorithms and applications
Technical Communique: Upper bounds for the solution of the discrete algebraic Lyapunov equation
Automatica (Journal of IFAC)
Original article: A note on computation of pseudospectra
Mathematics and Computers in Simulation
| Hi-index | 0.01 |
The concept of pseudospectrum was introduced by Trefethen to explain the behavior of nonnormal operators. Many phenomena (for example, hydrodynamic instability and convergence of iterative methods for linear systems) cannot be accounted for by eigenvalue analysis but are more understandable by examining the pseudospectra. The straightforward way to compute pseudospectra involves many applications of the singular value decomposition (SVD). This paper presents several fast continuation methods to calculate pseudospectra of different types of matrices.