On the Pseudospectra of Matrix Polynomials

DOI10.1137/S0895479804441420MaRDI QIDQ5317655zbMATH OpenOpenAlexFDO

Authors P. Lancaster, Panayiotis J. Psarrakos

Publication date 19 September 2005

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479804441420

zbMATH Keywords

\(\varepsilon\)-pseudospectrumboundarycurve-tracing algorithmeigenvaluegyroscopic systemmatrix polynomialnumerical experimentsperturbationprediction-correction continuationsingular valuestabilityvibrating systemwing problem

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Matrices over function rings in one or more variables (15A54) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Review text

This paper demonstrates the development of a curve-tracing algorithm for graphing pseudospectra applied on the classical eigenvalue problem to matrix polynomials with nonsingular coefficients. This method is based on a prediction-correction continuation methodology for the computation of the boundary of the \(\varepsilon\)-pseudospetrum. The basic continuation method consists of an initial step to find the starting point on the curve followed by a sequence of predictor steps tangential to the boundary and corrector steps to go back to the boundary. It does not require an a priori knowledge of the size or shape of the pseudospectrum, since it determines the connected components of the pseudospectrum one after the other by using starting points close to eigenvalues. The paper also shows that new curve-tracing procedure competes well with the classical grid method and is computationally less demanding when seeking a small number of boundary curves. However, the curve-tracing method needs the repeated for each component. Numerical experiments show its effectiveness and robustness through various test problems such as a wing problem, a vibrating system, and a gyroscopic system.

Recommendations

• On pseudospectra of matrix polynomials and their boundaries
• Structured pseudospectra for polynomial eigenvalue problems, with applications
• An improved grid method for the computation of the pseudospectra of matrix polynomials
• scientific article; zbMATH DE number 2068271
• Computation of pseudospectra via spectral projectors

Cited in

(42)

• Pseudozeros of polynomials and pseudospectra of companion matrices
• Pseudospectra for matrix pencils and stability of equilibria
• Computing unstructured and structured polynomial pseudospectrum approximations
• On restarting the tensor infinite Arnoldi method
• Properties and computations of matrix pseudospectra
• Decoupling of second-order linear systems by isospectral transformation
• On Householder sets for matrix polynomials
• An improved grid method for the computation of the pseudospectra of matrix polynomials
• Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems
• A distance bound for pseudospectra of matrix polynomials
• Pseudospectra of matrix polynomials that are expressed in alternative bases
• A note on properties and computations of matrix pseudospectra
• A note on structured pseudospectra.
• Pseudospectra and delay differential equations
• Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems
• Structured pseudospectra for polynomial eigenvalue problems, with applications
• Roots of bivariate polynomial systems via determinantal representations
• Pseudospectra of isospectrally reduced matrices.
• Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking
• Pseudospectra of companion matrix
• scientific article; zbMATH DE number 6342040 (Why is no real title available?)
• Backward error of polynomial eigenvalue problems solved by linearization of Lagrange interpolants
• Localization of the pseudospectra of matrices through the numerical range
• scientific article; zbMATH DE number 3941710 (Why is no real title available?)
• Pseudospectra of exponential matrix polynomials
• On linearizations of the quadratic two-parameter eigenvalue problem
• scientific article; zbMATH DE number 556491 (Why is no real title available?)
• scientific article; zbMATH DE number 1936773 (Why is no real title available?)
• scientific article; zbMATH DE number 2068271 (Why is no real title available?)
• Matrix polynomials with specified eigenvalues
• Pseudospectra of rectangular matrices
• Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
• Parameterized structure-preserving transformations of matrix polynomials
• On pseudospectra of matrix polynomials and their boundaries
• -numerical range of operator polynomial
• The fine pseudo-spectra of 2 2 diagonal block operator matrices
• Jordan structures of alternating matrix polynomials
• The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue
• On the quadratic two-parameter eigenvalue problem and its linearization
• On condition numbers of polynomial eigenvalue problems
• A note on the distance bound for pseudospectra of matrix polynomials
• Pseudospectra, critical points and multiple eigenvalues of matrix polynomials

This page was built for publication: On the Pseudospectra of Matrix Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317655)