On the simultaneous refinement of the zeros of H-palindromic polynomials

DOI10.1016/j.cam.2013.05.011zbMath1294.65052MaRDI QIDQ2253078

Simone Brugiapaglia, Luca Gemignani

Publication date: 25 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.05.011

zbMATH Keywords

generalized eigenvalue problem; Ehrlich-Aberth method; root-finding algorithm; palindromic polynomials

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

65H04: Numerical computation of roots of polynomial equations

Uses Software

• NLEVP
• quadeig

Cites Work

• Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials
• Structured polynomial eigenproblems related to time-delay systems
• Implicit QR algorithms for palindromic and even eigenvalue problems
• Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
• Theory and applications of partial functional differential equations
• Finding roots of a real polynomial simultaneously by means of Bairstow's method
• Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
• Smith forms of palindromic matrix polynomials
• An algorithm for the complete solution of quadratic eigenvalue problems
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• The Derivative of a Determinant
• A modified Newton method for polynomials
• A Generalization of the Bairstow Process