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

DOI10.1016/J.LAA.2017.05.010MaRDI QIDQ2002783zbMATH OpenOpenAlexFDO

Authors Leonardo Robol, Raf Vandebril

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

Ehrlich-Abertheigenvaluesmatrix polynomialspolynomial rootsrank structurerational functions

Mathematics Subject Classification ID

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

Recommendations

• A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
• Effective computation of rational approximants and interpolants
• A new efficient algorithm for polynomial interpolation
• On a fast convergence of the rational-trigonometric-polynomial interpolation
• Fast and stable rational interpolation in roots of unity and Chebyshev points
• scientific article; zbMATH DE number 1569195
• A new approach to fast polynomial interpolation and multipoint evaluation
• Computation of rational interpolants with prescribed poles
• Rational interpolation via orthogonal plynomials
• A Recursive Computation Scheme for Multivariate Rational Interpolants

Cites work

• A framework for structured linearizations of matrix polynomials in various bases
• A modified Newton method for polynomials
• A note on matrix inversion
• Backward error and condition of polynomial eigenvalue problems
• Barycentric Lagrange Interpolation
• Fast projection methods for minimal design problems in linear system theory
• Generalization of the Brauer theorem to matrix polynomials and matrix Laurent series
• scientific article; zbMATH DE number 3446276 (Why is no real title available?)
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Limits for the characteristic roots of a matrix
• Linearization of Lagrange and Hermite interpolating matrix polynomials
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Numerical linear algebra and applications
• Polynomial Roots from Companion Matrix Eigenvalues
• Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
• Solving secular and polynomial equations: a multiprecision algorithm
• The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
• The exponentially convergent trapezoidal rule

Cited in

(4)

• Block minimal bases \(\ell\)-ifications of matrix polynomials
• A simplified approach to Fiedler-like pencils via block minimal bases pencils
• Linearizations of rational matrices from general representations
• Effective computation of rational approximants and interpolants

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

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