A General Condition Number for Polynomials

DOI10.1137/120864581zbMath1273.65036OpenAlexW2081410910MaRDI QIDQ2840398

Roberto Barrio, Hao Jiang, Sergio E. Serrano

Publication date: 18 July 2013

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://zaguan.unizar.es/record/71043

zbMATH Keywords

Bernstein polynomialsfloating-point arithmeticClenshaw algorithmorthogonal polynomialpolynomial basispolynomial condition numberrunning-error bound

Mathematics Subject Classification ID

Roundoff error (65G50) Computation of special functions and constants, construction of tables (65D20) Approximation by polynomials (41A10)

Related Items (4)

The three-term recursion for Chebyshev polynomials is mixed forward-backward stable ⋮ Accurate and efficient evaluation of Chebyshev tensor product surface ⋮ Accurate evaluation of polynomials in Legendre basis ⋮ \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives

Uses Software

• mctoolbox

This page was built for publication: A General Condition Number for Polynomials