Computing machine-efficient polynomial approximations

DOI10.1145/1141885.1141890MaRDI QIDQ3549157zbMATH OpenOpenAlexWikidataFDO

Authors Nicolas Brisebarre, Jean-Michel Muller, Arnaud Tisserand

Publication date 21 December 2008

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1141885.1141890

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Cited in

(4)

• The faster methods for computing Bessel functions of the first kind of an integer order with application to graphic processors
• One method for proving inequalities by computer
• An exchange algorithm for optimizing both approximation and finite-precision evaluation errors in polynomial approximations
• Optimal approximation of the 1/x function using Chebyshev polynomials and magic constants

Describes a project that uses

Uses Software

• MPFR
• PipLib
• PolyLib
• gmp

This page was built for publication: Computing machine-efficient polynomial approximations

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