Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
type: Item
instance of: scholarly article
title: Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
zbMATH Open document ID: 1416.65096
author: Leonardo Robol
author: Raf Vandebril
published in: Linear Algebra and its Applications
publication date: 2019-07-12T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 15A18
Mathematics Subject Classification ID: 65H05
zbMATH DE Number: 7080272
zbMATH Keywords: matrix polynomials
zbMATH Keywords: rational functions
zbMATH Keywords: Ehrlich-Aberth
zbMATH Keywords: rank structure
zbMATH Keywords: eigenvalues
zbMATH Keywords: polynomial roots
MaRDI profile type: Publication
full work available at URL: j.laa.2017.05.010
OpenAlex ID: W2612376861
cites work: Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
cites work: Barycentric Lagrange Interpolation
cites work: The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
cites work: Generalization of the Brauer Theorem to Matrix Polynomials and Matrix Laurent Series
cites work: Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
cites work: Solving secular and polynomial equations: a multiprecision algorithm
cites work: Limits for the characteristic roots of a matrix
cites work: Q3653570
cites work: Polynomial Roots from Companion Matrix Eigenvalues
cites work: A modified Newton method for polynomials
cites work: Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
cites work: A note on matrix inversion
cites work: Q4772051
cites work: Fast projection methods for minimal design problems in linear system theory
cites work: A Framework for Structured Linearizations of Matrix Polynomials in Various Bases
cites work: Backward error and condition of polynomial eigenvalue problems
cites work: The Exponentially Convergent Trapezoidal Rule
cites work: Linearization of Lagrange and Hermite interpolating matrix polynomials
DOI: 10.1016/J.LAA.2017.05.010
Recommended article: A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
Recommended article: Effective computation of rational approximants and interpolants
Recommended article: A new efficient algorithm for polynomial interpolation
Recommended article: On a fast convergence of the rational-trigonometric-polynomial interpolation
Recommended article: Fast and stable rational interpolation in roots of unity and Chebyshev points
Recommended article: Q4762726
Recommended article: A new approach to fast polynomial interpolation and multipoint evaluation
Recommended article: Computation of rational interpolants with prescribed poles
Recommended article: Rational interpolation via orthogonal plynomials
Recommended article: A Recursive Computation Scheme for Multivariate Rational Interpolants
description: scientific article; zbMATH DE number 7080272