Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
From MaRDI portal
Abstract: The computation of the structured pseudospectral abscissa and radius (with respect to the Frobenius norm) of a Toeplitz matrix is discussed and two algorithms based on a low rank property to construct extremal perturbations are presented. The algorithms are inspired by those considered in [SIAM J. Matrix Anal. Appl., 32 (2011), pp. 1166-1192] for the unstructured case, but their extension to structured pseudospectra and analysis presents several difficulties. Natural generalizations of the algorithms, allowing to draw significant sections of the structured pseudospectra in proximity of extremal points are also discussed. Since no algorithms are available in the literature to draw such structured pseudospectra, the approach we present seems promising to extend existing software tools (Eigtool, Seigtool) to structured pseudospectra representation for Toeplitz matrices. We discuss local convergence properties of the algorithms and show some applications to a few illustrative examples.
Recommendations
- A fast algorithm for computing the pseudospectra of Toeplitz matrices
- Properties and computations of matrix pseudospectra
- A note on properties and computations of matrix pseudospectra
- Computing extremal points of symplectic pseudospectra and solving symplectic matrix nearness problems
- On the computation of structured singular values and pseudospectra
- Computing eigenvalues and singular values of Toeplitz matrices
- Low-rank dynamics for computing extremal points of real pseudospectra
- Spectra and pseudospectra of block Toeplitz matrices
- scientific article; zbMATH DE number 3934303
- On the Pseudospectra of Matrix Polynomials
Cited in
(10)- Computing unstructured and structured polynomial pseudospectrum approximations
- A gradient system approach for Hankel structured low-rank approximation
- Structured maximal perturbations for Hamiltonian eigenvalue problems
- Matrix Stabilization Using Differential Equations
- Differential equations for real-structured defectivity measures
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- Approximated structured pseudospectra
- A novel iterative method to approximate structured singular values
- 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: Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4918167)