Algorithms for accurate, validated and fast polynomial evaluation
From MaRDI portal
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
Cites work
- A floating-point technique for extending the available precision
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate Sum and Dot Product
- Design, implementation and testing of extended and mixed precision BLAS
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- More accuracy at fixed precision.
- Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit
Cited in
(27)- Highly resilient correctors for polynomials
- Precise evaluation of a polynomial at a point given in staggered correction format
- Accurate quotient-difference algorithm: error analysis, improvements and applications
- Evaluation schemes in the ring of quaternionic polynomials
- Accurate evaluation of the k-th derivative of a polynomial and its application
- Compensated de Casteljau algorithm in \(K\) times the working precision
- 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
- Accurate evaluation of polynomials in Legendre basis
- 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
- Algorithm 954: An accurate and efficient cubic and quartic equation solver for physical applications
- scientific article; zbMATH DE number 5124811 (Why is no real title available?)
- scientific article; zbMATH DE number 4080740 (Why is no real title available?)
- Reducing rounding errors and achieving Brouwer's law with Taylor series method
- A unified approach to evaluation algorithms for multivariate polynomials
- High-precision computation: mathematical physics and dynamics
- Accurate evaluation of a polynomial in Chebyshev form
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
- Accurate Horner methods in real and complex floating-point arithmetic
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
- Quotient-difference algorithm and code for cubic polynomials with computational implementation
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
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)
