Efficient polynomial L-approximations

We address the problem of computing a 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.

• Type: Conference
• Year: 2007
• Where: ARITH
• Authors: Nicolas Brisebarre, Sylvain Chevillard
• Keywords: Applied Computing, ARITH 2007, Floating-point-coefficient Polynomial Approximation, Lattice Basis Reduction, Supremum Norm