Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions

DOI10.1016/j.laa.2017.05.010zbMath1416.65096OpenAlexW2612376861MaRDI QIDQ2002783

Raf Vandebril, Leonardo Robol

Publication date: 12 July 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2017.05.010

zbMATH Keywords

eigenvaluesrational functionsmatrix polynomialspolynomial rootsrank structureEhrlich-Aberth

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of solutions to single equations (65H05)

Related Items (3)

Block minimal bases \(\ell\)-ifications of matrix polynomials ⋮ Linearizations of rational matrices from general representations ⋮ A simplified approach to Fiedler-like pencils via block minimal bases pencils

Cites Work

• Unnamed Item
• Unnamed Item
• Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
• A note on matrix inversion
• Fast projection methods for minimal design problems in linear system theory
• Backward error and condition of polynomial eigenvalue problems
• Solving secular and polynomial equations: a multiprecision algorithm
• Limits for the characteristic roots of a matrix
• The Exponentially Convergent Trapezoidal Rule
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Barycentric Lagrange Interpolation
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Polynomial Roots from Companion Matrix Eigenvalues
• Linearization of Lagrange and Hermite interpolating matrix polynomials
• Generalization of the Brauer Theorem to Matrix Polynomials and Matrix Laurent Series
• The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
• A Framework for Structured Linearizations of Matrix Polynomials in Various Bases
• A modified Newton method for polynomials

This page was built for publication: Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions