Fast Reduction of Generalized Companion Matrix Pairs for Barycentric Lagrange Interpolants

DOI10.1137/130904508zbMath1279.65038OpenAlexW2077034598MaRDI QIDQ2866236

Piers W. Lawrence

Publication date: 13 December 2013

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/130904508

zbMATH Keywords

complexityalgorithmnumerical exampleseigenvalue problemLagrange interpolationpolynomial rootssemiseparable matricespolynomial interpolationbarycentric formulageneralized companion matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical interpolation (65D05) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)

Related Items (5)

Backward Error of Polynomial Eigenvalue Problems Solved by Linearization of Lagrange Interpolants ⋮ A real QZ algorithm for structured companion pencils ⋮ Stability of rootfinding for barycentric Lagrange interpolants ⋮ Meshfree approach for solving multi-dimensional systems of Fredholm integral equations via barycentric Lagrange interpolation ⋮ On the stability of computing polynomial roots via confederate linearizations

Uses Software

• Chebfun

This page was built for publication: Fast Reduction of Generalized Companion Matrix Pairs for Barycentric Lagrange Interpolants