On why using DL(P) for the symmetric polynomial eigenvalue problem might need to be reconsidered

DOI10.1007/S10092-022-00483-4MaRDI QIDQ2107277zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

backward errorseigenvalueeigenvectorHermitian matrix polynomialpolynomial eigenvalue problemsymmetric polynomial

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)

Recommendations

• A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
• Symmetric Linearizations for Matrix Polynomials
• Backward Error of Polynomial Eigenproblems Solved by Linearization
• Palindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
• On backward errors of structured polynomial eigenproblems solved by structure preserving linearizations

Cites work

• A backward stable algorithm for quadratic eigenvalue problems
• A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
• A new family of companion forms of polynomial matrices
• An Efficient Algorithm for Computing the ${\cal H}_{\infty}$ Norm
• Backward error and condition of polynomial eigenvalue problems
• Backward Error of Polynomial Eigenproblems Solved by Linearization
• Bounds for eigenvalues of matrix polynomials
• Explicit block-structures for block-symmetric Fiedler-like pencils
• scientific article; zbMATH DE number 3756646 (Why is no real title available?)
• scientific article; zbMATH DE number 3236302 (Why is no real title available?)
• Implicit QR algorithms for palindromic and even eigenvalue problems
• On the Estimation of the Distance to Uncontrollability for Higher Order Systems
• On the solution of generalized nonlinear complex-symmetric eigenvalue problems
• Polynomial eigenvalue problems with Hamiltonian structure
• Solving rational eigenvalue problems via linearization
• Spectral equivalence of matrix polynomials and the index sum theorem
• Structure preserving deflation of infinite eigenvalues in structured pencils
• Structured eigenvalue condition numbers and linearizations for matrix polynomials
• Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
• Symmetric Linearizations for Matrix Polynomials
• The Conditioning of Linearizations of Matrix Polynomials
• The infinite Lanczos method for symmetric nonlinear eigenvalue problems
• The quadratic eigenvalue problem
• Trimmed linearizations for structured matrix polynomials

Cited in

(2)

• A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
• The \(\mathbb{DL}(P)\) vector space of pencils for singular matrix polynomials

This page was built for publication: On why using \(\mathbb{DL}(P)\) for the symmetric polynomial eigenvalue problem might need to be reconsidered

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