A unified rounding error bound for polynomial evaluation
From MaRDI portal
Publication:1397303
DOI10.1023/A:1024203520270zbMath1036.65025MaRDI QIDQ1397303
Publication date: 27 July 2003
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
condition numberSzegő polynomialsorthogonal basepolynomial evaluationorthogonal polynomialHorner's algorithmfirst-order linear matrix recurrence relationReinsch algorithmrounding error bound
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Accurate evaluation of a polynomial and its derivative in Bernstein form ⋮ The three-term recursion for Chebyshev polynomials is mixed forward-backward stable ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ Three term recurrence for the evaluation of multivariate orthogonal polynomials ⋮ Accelerations of Zhao's methods for the numerical inversion of Laplace transform ⋮ Evaluation of the derivative of a polynomial in Bernstein form ⋮ Accurate evaluation of polynomials in Legendre basis
This page was built for publication: A unified rounding error bound for polynomial evaluation
