The numerical stability of evaluation schemes for polynomials based on the Lagrange interpolation form

DOI10.1007/BF01934399zbMath0477.65007MaRDI QIDQ1161027

Manfred Reimer, Heinz-Joachim Rack

Publication date: 1982

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

error analysisnumerical stabilityLebesgue constantevaluation of polynomialserror norm22, 101-107 (1982)Lagrange interpolation form

Mathematics Subject Classification ID

Numerical interpolation (65D05) Interpolation in approximation theory (41A05)

Related Items (max. 100)

A new efficient algorithm for polynomial interpolation ⋮ Parameter choice strategies for error expressions and the numerical stability of Tikhonov-regularized approximation formulae ⋮ A Kernel-Independent Treecode Based on Barycentric Lagrange Interpolation ⋮ A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters

Cites Work

• Auswertungsverfahren für Polynome in mehreren Variablen
• Auswertungsalgorithmen fast-optimaler numerischer Stabilität für Polynome
• Lagrangian Interpolation at the Chebyshev Points xn,     cos (  /n),   = 0(1)n; some Unnoted Advantages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The numerical stability of evaluation schemes for polynomials based on the Lagrange interpolation form