Efficient polynomial L-approximations
Nicolas Brisebarre, Sylvain Chevillard · Proceedings/Proceedings - Symposium on Computer Arithmetic · 2007
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.