Algorithms for accurate, validated and fast polynomial evaluation

DOI10.1007/BF03186531zbMATH Open1184.65029MaRDI QIDQ849175FDOQ849175

Authors: Stef Graillat, Philippe Langlois, Nicolas Louvet

Publication date: 25 February 2010

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jjiam/1265033778

Recommendations

scientific article; zbMATH DE number 850292
Efficient evaluation of large polynomials
Efficient evaluation of multivariate polynomials
A unified approach to evaluation algorithms for multivariate polynomials
Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
Verified computation of fast decreasing polynomials
Fast evaluation of polynomials by rational preparation
Very Fast Parallel Polynomial Arithmetic

zbMATH Keywords

numerical experiments floating-point arithmetic compensated algorithm error-free transformation polynomial evaluation Horner algorithm IEEE-754

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Elementary functions (26A09) Real polynomials: analytic properties, etc. (26C05)

Cites Work

Title not available (Why is that?)
Accuracy and Stability of Numerical Algorithms
Title not available (Why is that?)
Accurate Floating-Point Summation Part I: Faithful Rounding
More accuracy at fixed precision.
Accurate Sum and Dot Product
A floating-point technique for extending the available precision
Design, implementation and testing of extended and mixed precision BLAS
Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit

Cited In (25)

Title not available (Why is that?)
Title not available (Why is that?)
PACF: a precision-adjustable computational framework for solving singular values
Matrix representations for multi-degree B-splines
Numerical validation of compensated algorithms with stochastic arithmetic
An accurate algorithm for evaluating rational functions
Highly resilient correctors for polynomials
Accurate evaluation of a polynomial and its derivative in Bernstein form
Evaluation schemes in the ring of quaternionic polynomials
Compensated de Casteljau algorithm in \(K\) times the working precision
Accurate evaluation of the \(k\)-th derivative of a polynomial and its application
Reducing rounding errors and achieving Brouwer's law with Taylor series method
Accurate evaluation of polynomials in Legendre basis
Fast evaluation and root finding for polynomials with floating-point coefficients
Accurate evaluation of a polynomial in Chebyshev form
A unified approach to evaluation algorithms for multivariate polynomials
A simple test qualifying the accuracy of Horner's rule for polynomials
On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
Accurate Horner methods in real and complex floating-point arithmetic
High-precision computation: mathematical physics and dynamics
Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
Algorithm 954: An accurate and efficient cubic and quartic equation solver for physical applications
Accurate quotient-difference algorithm: error analysis, improvements and applications
Accurate, validated and fast evaluation of elementary symmetric functions and its application
Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic

Uses Software

mctoolbox
LBNL
XBLAS

This page was built for publication: Algorithms for accurate, validated and fast polynomial evaluation

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