A curve tracing algorithm for computing the pseudospectrum
From MaRDI portal
Publication:1923868
DOI10.1007/BF01731926zbMath0861.65034MaRDI QIDQ1923868
Publication date: 24 April 1997
Published in: BIT (Search for Journal in Brave)
performancenumerical examplespseudospectracurve tracing algorithmprediction-correction continuation method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Related Items (8)
An improved grid method for the computation of the pseudospectra of matrix polynomials ⋮ Pseudospectra for matrix pencils and stability of equilibria ⋮ Computing the field of values and pseudospectra using the Lanczos method with continuation ⋮ Computing spectral value sets using the subharmonicity of the norm of rational matrices ⋮ Structured pseudospectra and structured sensitivity of eigenvalues ⋮ A note on computation of pseudospectra ⋮ Pseudospectra and delay differential equations ⋮ Computation of pseudospectra via spectral projectors
Uses Software
Cites Work
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- Hydrodynamic Stability Without Eigenvalues
- How Fast are Nonsymmetric Matrix Iterations?
- Computation of Pseudospectra by Continuation
- Calculation of Pseudospectra by the Arnoldi Iteration
- Pseudospectra of the Orr–Sommerfeld Operator
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A curve tracing algorithm for computing the pseudospectrum