Floating-Point $L^2$-Approximations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Floating-Point $L^2$-Approximations


Computing good polynomial approximations to usual functions is an important topic for the computer evaluation of those functions. These approximations can be good under several criteria, the most desirable being probably that the relative error is as small as possible in the $L^{\infty}$ sense, i.e. everywhere on the interval under study. In the present paper, we investigate a simpler criterion, the $L^2$ case. Though finding a best polynomial $L^2$-approximation with real coefficients is quite easy, we show that if the coefficients are restricted to be floating point numbers to some precision, the problem becomes a general instance of the CVP problem, and hence is NP-hard. We investigate the practical behaviour of exact and approximate algorithms for this problem. The conclusion is that it is possible in a short amount of time to obtain a relative or absolute best $L^2$-approximation. The main applications are for large dimension, as a preliminary step of finding $L^{\infty}$-approximations and for functions with large variations, for which relative best approximation is by far more interesting than absolute.
Fichier principal
Vignette du fichier
RR-6058.pdf (138.41 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00119254 , version 1 (08-12-2006)
inria-00119254 , version 2 (11-12-2006)



Nicolas Brisebarre, Guillaume Hanrot. Floating-Point $L^2$-Approximations. 18th IEEE Symposium in Computer Arithmetic, Jun 2007, Montpellier, France. pp.177-186, ⟨10.1109/ARITH.2007.38⟩. ⟨inria-00119254v2⟩
161 View
185 Download



Gmail Mastodon Facebook X LinkedIn More