Computing machine-efficient polynomial approximations
From MaRDI portal
Publication:3549157
DOI10.1145/1141885.1141890zbMath1365.65031OpenAlexW2017736478WikidataQ113310686 ScholiaQ113310686MaRDI QIDQ3549157
Nicolas Brisebarre, Arnaud Tisserand, Jean-Michel Muller
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
Related Items (2)
One method for proving inequalities by computer ⋮ The faster methods for computing Bessel functions of the first kind of an integer order with application to graphic processors
Uses Software
This page was built for publication: Computing machine-efficient polynomial approximations
