Efficient polynomial $L^{\infty}$-approximations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

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

Abstract

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
linfrrhal.pdf (159.33 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)

Identifiers

  • HAL Id : inria-00119513 , version 1

Cite

Nicolas Brisebarre, Sylvain Chevillard. Efficient polynomial $L^{\infty}$-approximations. [Research Report] 2006, pp.11. ⟨inria-00119513v1⟩
1146 View
1279 Download

Share

Gmail Mastodon Facebook X LinkedIn More