Computing machine-efficient polynomial approximations

DOI10.1145/1141885.1141890zbMATH Open1365.65031OpenAlexW2017736478WikidataQ113310686 ScholiaQ113310686MaRDI QIDQ3549157FDOQ3549157

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 (2)

• 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

Uses Software

• gmp
• MPFR
• PolyLib
• PipLib

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)