An improved grid method for the computation of the pseudospectra of matrix polynomials

DOI10.1016/j.mcm.2008.05.047zbMath1165.65334OpenAlexW2072607139MaRDI QIDQ2389872

S. Fatouros, Panayiotis J. Psarrakos

Publication date: 20 July 2009

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2008.05.047

zbMATH Keywords

eigenvalueperturbationmatrix polynomial\(\epsilon \)-pseudospectrum

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Uses Software

• COBRA
• Eigtool
• Pseudospectra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of pseudospectra via spectral projectors
• Geometrical properties of numerical range of matrix polynomials
• Computing spectral value sets using the subharmonicity of the norm of rational matrices
• Elliptic and hyperbolic quadratic eigenvalue problems and associated distance problems.
• Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
• A curve tracing algorithm for computing the pseudospectrum
• A distance bound for pseudospectra of matrix polynomials
• Structured Pseudospectra for Polynomial Eigenvalue Problems, with Applications
• The Quadratic Eigenvalue Problem
• Generalizing Eigenvalue Theorems to Pseudospectra Theorems
• Pseudospectra of Linear Operators
• On the Pseudospectra of Matrix Polynomials
• On pseudospectra of matrix polynomials and their boundaries
• Parallel computation of pseudospectra by fast descent
• Cobra: Parallel path following for computing the matrix pseudospectrum

This page was built for publication: An improved grid method for the computation of the pseudospectra of matrix polynomials