The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2004 vol.53)
pp: 678-687
ABSTRACT
<p><b>Abstract</b>—A common practice for computing an elementary transcendental function in an <tt>libm</tt> implementation nowadays has two phases: reductions of input arguments to fall into a tiny interval and polynomial approximations for the function within the interval. Typically, the interval is made tiny enough so that polynomials of very high degree aren't required for accurate approximations. Often, approximating polynomials as such are taken to be the <it>best polynomials</it> or any others such as the <it>Chebyshev interpolating polynomials</it>. The best polynomial of degree <tmath>n</tmath> has the property that the biggest difference between it and the function is smallest among all possible polynomials of degrees no higher than <tmath>n</tmath>. Thus, it is natural to choose the best polynomials over others. In this paper, it is proven that the best polynomial can only be more accurate by at most <it>a fractional bit</it> than the Chebyshev interpolating polynomial of the same degree in computing elementary functions or, in other words, the Chebyshev interpolating polynomials will do just as well as the best polynomials. Similar results were obtained in 1967 by Powell who, however, did not target elementary function computations in particular and placed no assumption on the function and, remarkably, whose results imply accuracy differences of no more than 2 to 3 bits in the context of this paper.</p>
INDEX TERMS
Elementary function computation, libm, Chebyshev Interpolation, Remez, best polynomial, accuracy.
CITATION
Ren-Cang Li, "Near Optimality of Chebyshev Interpolation for Elementary Function Computations", IEEE Transactions on Computers, vol.53, no. 6, pp. 678-687, June 2004, doi:10.1109/TC.2004.15
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool