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.
Origin : Files produced by the author(s)
Loading...