Computing unstructured and structured polynomial pseudospectrum approximations
From MaRDI portal
Abstract: In many applications it is important to understand the sensitivity of eigenvalues of a matrix polynomial to perturbations of the polynomial. The sensitivity commonly is described by condition numbers or pseudospectra. However, the computation of pseudospectra of matrix polynomials is very demanding computationally. This paper describes a new approach to computing approximations of pseudospectra of matrix polynomials by using rank-one or projected rank-one perturbations. These perturbations are inspired by Wilkinson's analysis of eigenvalue sensitivity. This approach allows the approximation of both structured and unstructured pseudospectra. Computed examples show the method to perform much better than a method based on random rank-one perturbations both for the approximation of structured and unstructured (i.e., standard) polynomial pseudospectra.
Recommendations
- Approximated structured pseudospectra
- Structured pseudospectra for polynomial eigenvalue problems, with applications
- Structured pseudospectra and structured sensitivity of eigenvalues
- On the Pseudospectra of Matrix Polynomials
- An improved grid method for the computation of the pseudospectra of matrix polynomials
Cites work
- A note on structured pseudospectra.
- A rational Arnoldi process with applications.
- Approximated structured pseudospectra
- Backward error and condition of polynomial eigenvalue problems
- Backward Error and Condition of Structured Linear Systems
- Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
- Derivatives of Eigenvalues and Eigenvectors of Matrix Functions
- Differential equations for real-structured defectivity measures
- Eigenvalue condition numbers: zero-structured versus traditional.
- Eigenvalue patterned condition numbers: Toeplitz and Hankel cases
- Eigenvalues, pseudospectrum and structured perturbations
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- Large-scale computation of pseudospectra using ARPACK and eigs
- Matrix Polynomials
- More on pseudospectra for polynomial eigenvalue problems and applications in control theory
- On pseudospectra of matrix polynomials and their boundaries
- On pseudospectra, critical points, and multiple eigenvalues of matrix pencils
- Parallel computation of pseudospectra by fast descent
- Parallel computation of pseudospectra of large sparse matrices
- Solving a structured quadratic eigenvalue problem by a structure-preserving doubling algorithm
- Structured maximal perturbations for Hamiltonian eigenvalue problems
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Structured pseudospectra and the condition of a nonderogatory eigenvalue
- Structured pseudospectra for polynomial eigenvalue problems, with applications
Cited in
(3)
This page was built for publication: Computing unstructured and structured polynomial pseudospectrum approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713147)
