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

DOI10.1007/BF01934399zbMATH Open0477.65007MaRDI QIDQ1161027FDOQ1161027

Authors: Heinz-Joachim Rack, Manfred Reimer 

Publication date: 1982

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

error analysisnumerical stabilityLebesgue constanterror normevaluation of polynomials22, 101-107 (1982)Lagrange interpolation form

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• A kernel-independent treecode based on barycentric Lagrange interpolation
• A new efficient algorithm for polynomial interpolation
• Parameter choice strategies for error expressions and the numerical stability of Tikhonov-regularized approximation formulae
• A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters

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

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