Perturbation, extraction and refinement of invariant pairs for matrix polynomials
From MaRDI portal
Publication:541918
DOI10.1016/j.laa.2010.06.029zbMath1228.15008MaRDI QIDQ541918
Publication date: 8 June 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.06.029
algorithm; perturbation theory; linearization; numerical experiments; refinement; matrix polynomial; polynomial eigenvalue problem; extraction; invariant pairs
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
15A18: Eigenvalues, singular values, and eigenvectors
15A54: Matrices over function rings in one or more variables
Related Items
Matrix Polynomials with Completely Prescribed Eigenstructure, Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis, Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues, Matrix polynomials with specified eigenvalues, Efficient and reliable hp-FEM estimates for quadratic eigenvalue problems and photonic crystal applications, Continuation of eigenvalues and invariant pairs for parameterized nonlinear eigenvalue problems, Chebyshev interpolation for nonlinear eigenvalue problems, A block Newton method for nonlinear eigenvalue problems, Möbius transformations of matrix polynomials, A contour integral approach to the computation of invariant pairs, Parallel Krylov Solvers for the Polynomial Eigenvalue Problem in SLEPc, Parallel iterative refinement in polynomial eigenvalue problems, Preconditioned Eigensolvers for Large-Scale Nonlinear Hermitian Eigenproblems with Variational Characterizations. II. Interior Eigenvalues
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A framework for analyzing nonlinear eigenproblems and parametrized linear systems
- Structured eigenvalue condition numbers and linearizations for matrix polynomials
- Perturbation expansions for invariant subspaces
- A block Newton method for nonlinear eigenvalue problems
- Perturbation theory for homogeneous polynomial eigenvalue problems
- Krylov type subspace methods for matrix polynomials
- Numerical methods for general and structured eigenvalue problems.
- Kronecker bases for linear matrix equations, with application to two-parameter eigenvalue problems
- Newton's Method in Floating Point Arithmetic and Iterative Refinement of Generalized Eigenvalue Problems
- Locking and Restarting Quadratic Eigenvalue Solvers
- The Quadratic Eigenvalue Problem
- On the Numerical Solution of $(\lambda^2 A + \lambda B + C), x = b$ and Application to Structural Dynamics
- Derivatives of Eigenvalues and Eigenvectors of Matrix Functions
- NLEVP
- Numerical solution of saddle point problems
- Backward Error of Polynomial Eigenproblems Solved by Linearization
- Continuation of Invariant Subspaces for Parameterized Quadratic Eigenvalue Problems
- Scaling, sensitivity and stability in the numerical solution of quadratic eigenvalue problems
- Optimal Scaling of Generalized and Polynomial Eigenvalue Problems
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- The Algebraic Theory of Matrix Polynomials
- Numerical analysis of a quadratic matrix equation
- Normwise Scaling of Second Order Polynomial Matrices
- Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
- Accuracy and Stability of Numerical Algorithms
- SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- Vector Spaces of Linearizations for Matrix Polynomials
- The Conditioning of Linearizations of Matrix Polynomials
- Multishift Variants of the QZ Algorithm with Aggressive Early Deflation
- Error Bounds for Approximate Invariant Subspaces of Closed Linear Operators
- An Algorithm for Generalized Matrix Eigenvalue Problems
