Computing machine-efficient polynomial approximations - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Mathematical Software Year : 2006

Computing machine-efficient polynomial approximations

(1, 2) , (3) , (4)
1
2
3
4

Abstract

Polynomial approximations are almost always used when implementing functions on a computing system. In most cases, the polynomial that best approximates (for a given distance and in a given interval) a function has coefficients that are not exactly representable with a finite number of bits. And yet, the polynomial approximations that are actually implemented do have coefficients that are represented with a finite - and sometimes small - number of bits: this is due to the finiteness of the floating-point representations (for software implementations), and to the need to have small, hence fast and/or inexpensive, multipliers (for hardware implementations). We then have to consider polynomial approximations for which the degree-$i$ coefficient has at most $m_i$ fractional bits: in other words, it is a rational number with denominator $2^{m_i}$. We provide a general and efficient method for finding the best polynomial approximation under this constraint. Moreover, our method also applies if some other constraints (such as requiring some coefficients to be equal to some predefined constants, or minimizing relative error instead of absolute error) are required.
Fichier principal
Vignette du fichier
finalversion.pdf (300.85 Ko) Télécharger le fichier
Loading...

Dates and versions

ensl-00086826 , version 1 (20-07-2006)

Identifiers

Cite

Jean-Michel Muller, Nicolas Brisebarre, Arnaud Tisserand. Computing machine-efficient polynomial approximations. ACM Transactions on Mathematical Software, 2006, 32 (2), pp.236-256. ⟨10.1145/1141885.1141890⟩. ⟨ensl-00086826⟩
366 View
1487 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More