Pseudospectra of linear matrix pencils by block diagonalization
From MaRDI portal
Publication:1382774
DOI10.1007/BF02684362zbMath0892.65026MaRDI QIDQ1382774
Publication date: 15 July 1998
Published in: Computing (Search for Journal in Brave)
Related Items
Pseudospectra of Matrix Pencils for Transient Analysis of Differential-Algebraic Equations ⋮ Pseudospectra, critical points and multiple eigenvalues of matrix polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing stable eigendecompositions of matrices
- Computing stable eigendecompositions of matrix pencils
- Spectral portrait for non-Hermitian large sparse matrices
- Pseudospectra for matrix pencils and stability of equilibria
- Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- An Algorithm for Computing Reducing Subspaces by Block Diagonalization
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- Structured Backward Error and Condition of Generalized Eigenvalue Problems
- Computation of Pseudospectra by Continuation
- LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
- Pseudospectra of Linear Operators
- The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
- An Algorithm for Generalized Matrix Eigenvalue Problems