An accurate algorithm for evaluating rational functions
From MaRDI portal
Recommendations
Cites work
- A floating-point technique for extending the available precision
- Accuracy and Stability of Numerical Algorithms
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Accurate evaluation of a polynomial in Chebyshev form
- Accurate evaluation of polynomials in Legendre basis
- Accurate Sum and Dot Product
- Algorithms for accurate, validated and fast polynomial evaluation
- Design, implementation and testing of extended and mixed precision BLAS
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit
Cited in
(7)- More accuracy at fixed precision.
- Accurate evaluation of polynomials in Legendre basis
- scientific article; zbMATH DE number 3963065 (Why is no real title available?)
- Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
- Badness of small denominators in rational function evaluation
- Accurate Horner methods in real and complex floating-point arithmetic
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
This page was built for publication: An accurate algorithm for evaluating rational functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2335677)