On why using \(\mathbb{DL}(P)\) for the symmetric polynomial eigenvalue problem might need to be reconsidered
From MaRDI portal
Publication:2107277
DOI10.1007/s10092-022-00483-4OpenAlexW4308977435MaRDI QIDQ2107277
Publication date: 1 December 2022
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-022-00483-4
eigenvalueeigenvectorbackward errorssymmetric polynomialpolynomial eigenvalue problemHermitian matrix polynomial
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Spectral equivalence of matrix polynomials and the index sum theorem
- Structured eigenvalue condition numbers and linearizations for matrix polynomials
- Trimmed linearizations for structured matrix polynomials
- Implicit QR algorithms for palindromic and even eigenvalue problems
- A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
- Polynomial eigenvalue problems with Hamiltonian structure
- Bounds for eigenvalues of matrix polynomials
- Backward error and condition of polynomial eigenvalue problems
- Structure preserving deflation of infinite eigenvalues in structured pencils
- The infinite Lanczos method for symmetric nonlinear eigenvalue problems
- The Quadratic Eigenvalue Problem
- A Backward Stable Algorithm for Quadratic Eigenvalue Problems
- Solving Rational Eigenvalue Problems via Linearization
- Backward Error of Polynomial Eigenproblems Solved by Linearization
- On the solution of generalized non-linear complex-symmetric eigenvalue problems
- On the Estimation of the Distance to Uncontrollability for Higher Order Systems
- Explicit block-structures for block-symmetric Fiedler-like pencils
- A new family of companion forms of polynomial matrices
- An Efficient Algorithm for Computing the ${\cal H}_{\infty}$ Norm
- The Conditioning of Linearizations of Matrix Polynomials
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Symmetric Linearizations for Matrix Polynomials
