Efficient polynomial L-approximations
- 1 June 2007
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 18th IEEE Symposium on Computer Arithmetic (ARITH '07)
- p. 169-176
- https://doi.org/10.1109/arith.2007.17
Abstract
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.Keywords
This publication has 13 references indexed in Scilit:
- Computing machine-efficient polynomial approximationsACM Transactions on Mathematical Software, 2006
- New algorithms for improved transcendental functions on IA-64Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The Two Faces of Lattices in CryptologyLecture Notes in Computer Science, 2001
- The hardness of the closest vector problem with preprocessingIEEE Transactions on Information Theory, 2001
- Elementary FunctionsPublished by Springer Science and Business Media LLC ,1997
- Minkowski's Convex Body Theorem and Integer ProgrammingMathematics of Operations Research, 1987
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- An Algorithmic Theory of Numbers, Graphs and ConvexityPublished by Society for Industrial & Applied Mathematics (SIAM) ,1986
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- On the numerical determination of the best approximations in the Chebyshev senseNumerische Mathematik, 1960