This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Near Optimality of Chebyshev Interpolation for Elementary Function Computations
June 2004 (vol. 53 no. 6)
pp. 678-687

Abstract—A common practice for computing an elementary transcendental function in an libm 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 best polynomials or any others such as the Chebyshev interpolating polynomials. The best polynomial of degree n has the property that the biggest difference between it and the function is smallest among all possible polynomials of degrees no higher than n. 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 a fractional bit 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.

[1] J. Harrison, T. Kubaska, S. Story, and P.T.P. Tang, The Computation of Transcendental Functions on the IA-64 Architecture Intel Technology J., no. Q4, pp. 1-7, Nov. 1999.
[2] R.-C. Li, S. Boldo, and M. Daumas, Theorems on Efficient Argument Reductions Proc. 16th IEEE Symp. Computer Arithmetic, June 2003.
[3] P. Markstein, IA-64 and Elementary Functions: Speed and Precision, 2000.
[4] J.-M. Muller, Elementary Functions: Algorithms and Implementation. Boston, Basel, Berlin: Birkhåuser, 1997.
[5] K.C. Ng, Argument Reduction for Huge Arguments: Good to the Last Bit SunPro, technical report, 1992, http:/www.validlab. com/.
[6] M.J.D. Powell, On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria The Computer J., vol. 9, no. 4, pp. 404-407, Feb. 1967.
[7] P.T.P. Tang, Table-Driven Implementation of the Exponential Function in IEEE Floating-Point Arithmetic ACM Trans. Math. Software, vol. 15, no. 2, pp. 144-157, June 1989.
[8] P.T.P. Tang, Table-Driven Implementation of the Logarithm Function in IEEE Floating-Point Arithmetic ACM Trans. Math. Software, vol. 16, no. 4, pp. 378-400, Dec. 1990.
[9] P.T.P. Tang, “Table-Lookup Algorithms for Elementary Functions and Their Error Analysis,” Proc. 10th Symp. Computer Arithmetic, pp. 232-236, 1991.
[10] P.T.P. Tang, Table-Driven Implementation of theexpm1Function in IEEE Floating-Point Arithmetic ACM Trans. Math. Software, vol. 18, no. 2, pp. 211-222, June 1992.
[11] E. Remez, Sur un ProcédéConvergent d'Approximations Successives pour Déterminer les Polynômes d'Approximation C.R. Académie des Sciences, Paris, vol. 198, 1934.
[12] R.-C. Li, P. Markstein, J. Okada, and J. Thomas, The libm Library and Floating-Point Arithmetic in HP-UX for Itanium II June 2000, http://h21007.www2.hp.com/dspp/files/unprotected/ ItaniumFP_White_Paper_v2.pdf.
[13] E.W. Cheney, Approximation Theory, second ed. Providence, R.I.: AMS, 1981.
[14] R.A. DeVore and G.G. Lorentz, Constructive Approximation. Berlin, Heidelberg, New York: Springer-Verlag, 1993.
[15] G.G. Lorentz, Approximation of Functions, second ed. New York: Chelsea Publishing, 1986.
[16] INTEL, Intel IA-64 Architecture Software Developer's Manual. Intel Corp., 2002, vol. 3: Instruction Set Reference, document No. 245319-002,http://developer.intel.com/design/itanium/ manualsindex.htm.
[17] Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, M. Abramowitz and I.A Stegun, eds., ninth ed. New York: Dover Publications, 1970.

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
Usage of this product signifies your acceptance of the Terms of Use.