Efficient polynomial $L^{\infty}$-approximations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Efficient polynomial $L^{\infty}$-approximations


We address the problem of computing good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most processes of evaluation of a function. We present a fast and efficient method, based on lattice basis reduction, that often gives the best polynomial possible and most of the time returns a very good approximation.
Fichier principal
Vignette du fichier
RR-6060.pdf (159.31 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00119513 , version 1 (11-12-2006)
inria-00119513 , version 2 (11-12-2006)



Nicolas Brisebarre, Sylvain Chevillard. Efficient polynomial $L^{\infty}$-approximations. 18th IEEE Symposium on Computer Arithmetic, Jun 2007, Montpellier, France. pp.169-176, ⟨10.1109/ARITH.2007.17⟩. ⟨inria-00119513v2⟩
1111 View
1257 Download



Gmail Mastodon Facebook X LinkedIn More