Computing machine-efficient polynomial approximations

ACM Transactions on Mathematical Software

Volumn 32, Issue 2, 2006, Pages 236-256

  Brisebarre, Nicolas ^a,b   Muller, Jean Michel ^b,c   Tisserand, Arnaud ^b,c  

^a UNIVERSITÉ JEAN MONNET   (France)

^b UNIVERSITÉ DE LYON   (France)

^c UNIV LYON   (France)

Author keywords

Chebyshev polynomials; Floating point arithmetic; Linear programming; Minimax approximation; Polynomial approximation; Polytopes

Indexed keywords

CHEBYSHEV POLYNOMIALS; FLOATING-POINT ARITHMETIC; MINIMAX APPROXIMATION; POLYTOPES;

COMPUTATION THEORY; CONSTRAINT THEORY; DIGITAL ARITHMETIC; FUNCTION EVALUATION; LINEAR PROGRAMMING;

POLYNOMIAL APPROXIMATION;

EID: 33746101079     PISSN: 00983500     EISSN: 00983500     Source Type: Journal    
DOI: 10.1145/1141885.1141890     Document Type: Article

References (25)

1. ANCOURT, C. AND IRIGOIN, F. 1991. Scanning polyhedra with do loops. In Proceedings of the 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'91). ACM Press, New York, NY, 39-50.
2. BORWEIN, P. AND EHDÉLYI, T. 1995. Polynomials and Polynomials Inequalities. Graduate Texts in Mathematics, 161. Springer-Verlag, New York, NY.
3. COLLARD, J.-F., FEAUTRIER, P., AND RISSET, T. 1995. Construction of do loops from systems of affine constraints. Parall. Process. Lett. 5, 421-436.
4. CORNEA, M., HARRISON, J., AND TANG, P. T. P. 2002. Scientific Computing on Itanium-Based Systems. Intel Press.
5. FEAUTRIER, P. 1988. Parametric integer programming. RAIRO Rech. Oper. 22, 3, 243-268.
6. FEAUTRIER, P. 2003. PIP/Piplib, a parametric integer linear programming solver, http://www.prism.uvsq.fr/~cedb/bastools/piplib.html.
7. Fox, L. AND PARKER, I. B. 1972. Chebyshev Polynomials in Numerical Analysis. Oxford Mathematical Handbooks. Oxford University Press, London, UK.
8. GRANLUND, T. 2002. GMP, the GNU multiple precision arithmetic library, version 4.1.2. http://www.swox.com/gmp/.
9. HABSIEGER, L. AND SALVY, B. 1997. On integer Chebyshev polynomials. Math. Computat. 66, 218, 763-770.
10. HART, J. F., CHENEY, E. W., LAWSON, C. L., MAEHLY, H. J., MESZTENYI, C. K., RICE, J. R., THACHER, H. G., AND WITZGALL, C. 1968. Computer Approximations. John Wiley & Sons, New York, NY.
11. LE VERGE, H., VAN DONGEN, V., AND WILDE, D. K. 1994. Loop nest synthesis using the polyhedral library. Tech. Rep. INRIA Research Report RR-2288, (May) INRIA.
12. MARKSTEIN, P. 2000. IA-64 and Elementary Functions: Speed and Precision. Hewlett-Packard Professional Books. Prentice Hall.
13. MULLER, J.-M. 1997. Elementary Functions, Algorithms and Implementation. Birkhäuser, Boston, MA.
14. PINEIRO, J., BRUGUERA, J., AND MULLER, J.-M. 2001. Faithful powering computation using table look-up and a fused accumulation tree. In Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15). Burgess and Ciminiera Eds. IEEE Computer Society Press, Los Alamitos, CA, 40-58.
15. REMES, E. 1934. Sur un procédé convergent d'approximations successives pour déterminer les polynômes d'approximation. C.R. Acad. Sci. Paris 198, 2063-2065.
16. RIVLIN, T. J. 1990. Chebyshev Polynomials. From Approximation Theory to Algebra 2nd Ed. Pure and Applied Mathematics. John Wiley & Sons, New York, NY.
17. SCHRIJVER, A. 2003. Combinatorial optimization. Polyhedra and efficiency. Vol. A. Algorithms and Combinatorics, 24. Springer-Verlag, Berlin, Germany.
18. STORY, S. AND TANG, P. T. P. 1999. New algorithms for improved transcendental functions on IA-64. In Proceedings of the 14th IEEE Symposium on Computer Arithmetic. Koren and Kornerup, Eds. IEEE Computer Society Press, Los Alamitos, CA, 4-11.
19. TANG, P. T. P. 1989. Table-driven implementation of the exponential function in IEEE floating-point arithmetic. ACM Trans. Math. Soft. 15, 2 (June), 144-157.
20. TANG, P. T. P. 1990. Table-driven implementation of the logarithm function in IEEE floating-point arithmetic. ACM Trans. Math. Soft. 16, 4 (Dec.), 378-400.
21. TANG, P. T. P. 1991. Table lookup algorithms for elementary functions and their error analysis. In Proceedings of the 10th IEEE Symposium on Computer Arithmetic. P. Kornerup and D. W. Matula, Eds. IEEE Computer Society Press, Los Alamitos, CA, 232-236.
22. TANG, P. T. P. 1992. Table-driven implementation of the expm1 function in IEEE floating-point arithmetic. ACM Trans. Math. Soft. 18, 2 (June), 211-222.
23. THE POLYLIB TEAM. 2004. Polylib, a library of polyhedral functions, version 5.20.0. http://icps.u-strasbg.fr/polylib/.
24. THE SPACES PROJECT. 2004. MPFR, the multiple precision floating point reliable library, version 2.0.3. http://www.mpfr.org.
25. WEI, B., CAO, J., AND CHENG, J. 2001. High-performance architectures for elementary function generation. In Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15). Burgess and Ciminiera Eds. IEEE Computer Society Press, Los Alamitos, CA, 136-146.