Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points

@article{Butt2012ComputingTS,
  title={Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points},
  author={Paolo Butt{\`a} and Nicola Guglielmi and Silvia Noschese},
  journal={SIAM J. Matrix Anal. Appl.},
  year={2012},
  volume={33},
  pages={1300-1319}
}
  • Paolo Buttà, Nicola Guglielmi, Silvia Noschese
  • Published 2012
  • Mathematics, Computer Science
  • SIAM J. Matrix Anal. Appl.
  • 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 [N. Guglielmi and M. Overton, 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… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Subspace Methods for Computing the Pseudospectral Abscissa and the Stability Radius
    38
    Computing unstructured and structured polynomial pseudospectrum approximations
    1
    Approximated structured pseudospectra
    2
    An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
    5
    Distance Problems for Linear Dynamical Systems
    8
    Computing the distance to uncontrollability : the SISO case
    2
    Matrix Stabilization Using Differential Equations
    11

    References

    Publications referenced by this paper.