Approximated structured pseudospectra
From MaRDI portal
Abstract: Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and structured pseudospectra, based on determining the spectra of many suitably chosen rank-one or projected rank-one perturbations of the given matrix is proposed. The choice of rank-one or projected rank-one perturbations is inspired by Wilkinson's analysis of eigenvalue sensitivity. Numerical examples illustrate that the proposed approach gives much better insight into the pseudospectra and structured pseudospectra than random or structured random rank-one perturbations with lower computational burden. The latter approach is presently commonly used for the determination of structured pseudospectra.
Recommendations
- A note on structured pseudospectra.
- Structured Pseudospectra for Small Perturbations
- The regularly structured pseudospectrum
- Structured pseudospectra and structured sensitivity of eigenvalues
- scientific article; zbMATH DE number 1405268
- Structured pseudospectra for nonlinear eigenvalue problems
- The essential approximate pseudospectrum and related results
- scientific article; zbMATH DE number 1260326
- Eigenvalues, pseudospectrum and structured perturbations
- Pseudospectra localizations and their applications.
Cites work
- A note on structured pseudospectra.
- Backward Error and Condition of Structured Linear Systems
- Characterization and construction of the nearest defective matrix via coalescence of pseudospectral components
- Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
- Differential equations for real-structured defectivity measures
- Eigenvalue condition numbers: zero-structured versus traditional.
- Eigenvalue patterned condition numbers: Toeplitz and Hankel cases
- Eigenvalues and pseudo-eigenvalues of Toeplitz matrices
- Eigenvalues, pseudospectrum and structured perturbations
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Large-scale computation of pseudospectra using ARPACK and eigs
- On sensitivity of eigenvalues and eigendecompositions of matrices
- On the computation of structured singular values and pseudospectra
- Parallel computation of pseudospectra by fast descent
- Parallel computation of pseudospectra of large sparse matrices
- Structured Eigenvalue Condition Numbers
- Structured maximal perturbations for Hamiltonian eigenvalue problems
- Structured pseudospectra and the condition of a nonderogatory eigenvalue
- The weak and strong stability of algorithms in numerical linear algebra
- Tridiagonal Toeplitz matrices: properties and novel applications
Cited in
(15)- Computing unstructured and structured polynomial pseudospectrum approximations
- Algebraic approach in pseudo-spectra estimation
- Structured pseudospectra and structured sensitivity of eigenvalues
- Approximating the weighted pseudospectra of large matrices
- A note on structured pseudospectra.
- A note on structured pseudospectra of block matrices
- A reduced basis approach to large-scale pseudospectra computation.
- Structured Pseudospectra for Small Perturbations
- Structured pseudospectra in structural engineering
- scientific article; zbMATH DE number 1260326 (Why is no real title available?)
- Generalized Epsilon-Pseudospectra
- Pseudospectra of Loewner matrix pencils
- Some description of essential structured approximate and defect pseudospectrum
- The structured distance to singularity of a symmetric tridiagonal Toeplitz matrix
- On the computation of structured singular values and pseudospectra
This page was built for publication: Approximated structured pseudospectra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271020)
