Functional programming concepts and straight-line programs in computer algebra

Mathematics and Computers in Simulation

Volumn 60, Issue 6, 2002, Pages 423-473

  Bruno, N ^a   Heintz, J ^b,c   Matera, G ^d   Wachenchauzer, R ^e  

^a UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

^b Facultad de Ciencias Naturales e Instituto M Lillo   (Argentina)

^c UNIVERSITY OF CANTABRIA   (Spain)

^d INSTITUTO DE CIENCIAS   (Argentina)

^e UNIVERSIDAD DE BUENOS AIRES   (Argentina)

Author keywords

Abstract machine; Polynomial equation solver; Symbolic computation

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; POLYNOMIALS; SEMANTICS;

FUNCTIONAL PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 0037107909     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-4754(02)00035-6     Document Type: Article

References (48)

1. Abdeljaoued J., The Berkowitz algorithm, Maple and computing the characteristic polynomial in an arbitrary commutative ring Comput. Alg.: Maple Tech. Newslett. 4 3 1997 21-32.
2. A. Aho, R. Sethi, J. Ullman, Compilers - Principles, Techniques and Tools, Addison-Wesley, Reading, MA, 1986.
3. M. Berz, C. Bischof, G. Corliss, A. Griewank (Eds.), Computational Differentiation: Techniques, Applications, and Tools, SIAM Proceedings Series List, SIAM, Philadelphia, 1996.
4. R. Bird, Introduction to Functional Programming Using Haskell, 2nd Edition, Prentice-Hall, Englewood Cliffs, NJ, 1998.
5. N. Bruno, Esquemas de compilación de circuitos aritméticos uniformes representados por medio de funciones generatrices, Master's Thesis, FaMAF, Universidad de Córdoba, Argentina, 1998.
6. J. Canny, A toolkit for nonlinear algebra, in: K. Goldberg (Ed.), Proceedings of the Workshop on the Algorithmic Foundations of Robotics (WAFR'94), San Francisco, CA, 17-19 February 1994, ACM SIGSAM, SAME, A.K. Peters, Wellesley, MA, 1995.
7. Castaño B., Heintz J., Llovet J., Martínez R., On the data structure straight-line program and its implementation in symbolic computation Math. Comput. Simulat. 51 2000 497-528.
8. H. Cohen, A course in computational algebraic number theory, in: Graduate Texts in Mathematics, Vol. 138, Springer, Berlin, 1993.
9. J. Davenport, Y. Siret, E. Tournier, Computer Algebra: Systems and Algorithms for Algebraic Computation, Academic Press, San Diego, 1993.
10. A. Diaz, Foxbox: a system for manipulating symbolic objects in black box representation, Ph.D. Thesis, Rensselaer Polytechnic Institute, New York, 1997.
11. D. Faddeev, V. Faddeeva, Computational methods of linear algebra, Freeman, San Francisco, 1963.
12. Freeman T.S., Imirzian G.M., Kaltofen E., Yagati L., DAGWOOD - A system for manipulating polynomials given by straight-line programs ACM Trans. Math. Software 14 3 1988 218-240.
13. Giusti M., Hägele K., Heintz J., Morais J.E., Montaña J.L., Pardo L.M., Lower bounds for diophantine approximation J. Pure Appl. Alg. 117/118 1997 277-317.
14. Giusti M., Hägele K., Lecerf G., Marchand J., Salvy B., The projective Noether Maple package: computing the dimension of a projective variety J. Symb. Comput. 30 3 2000 291-307.
15. M. Giusti, J. Heintz, La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial, in: D. Eisenbud, L. Robbiano (Eds.), Proceedings of the Symposia Matematica on Computational Algebraic Geometry and Commutative Algebra, Vol. XXXIV, Cambridge University Press, Cambridge, 1993, pp. 216-256.
16. Giusti M., Heintz J., Morais J.E., Morgenstern J., Pardo L.M., Straight-line programs in geometric elimination theory J. Pure Appl. Alg. 124 1998 101-146.
17. M. Giusti, J. Heintz, J.E. Morais, L.M. Pardo, When polynomial equation systems can be solved fast?, in: G. Cohen, H. Giusti, T. Mora (Eds.), Proceedings of the AAECC-11 on Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Lecture Notes in Computer Science, Vol. 948, Springer, Berlin, 1995, pp. 205-231.
18. Giusti M., Lecerf G., Salvy B., A Gröbner free alternative for polynomial system solving J. Complex. 17 1 2001 154-211.
19. Gonzalez-Vega L., The needs of industry for polynomial system solving: a report from the Frisco project SAC Newslett. 3 1998 21-46.
20. A. Griewank, G. Corliss (Eds.), Automatic Differentiation of Algorithms: Theory, Implementation, and Application, SIAM Proceedings Series List, SIAM, Philadelphia, 1991.
21. Heintz J., Definability and fast quantifier elimination in algebraically closed fields Theor. Comput. Sci. 24 3 1983 239-277.
22. Heintz J., Krick T., Puddu S., Sabia J., Waissbein A., Deformation techniques for efficient polynomial equation solving J. Complex. 16 1 2000 70-109.
23. Heintz J., Matera G., Waissbein A., On the time-space complexity of geometric elimination procedures Appl. Alg. Eng. Commun. Comput. 11 4 2001 239-296.
24. J. Heintz, M. Sieveking, Absolute primality of polynomials is decidable in random polynomial-time in the number of variables, in: S. Even, O. Kariv (Eds.), Proceedings of the Eighth International Colloquium on Automata, Languages and Programming (ICALP'81), Acre (Akko), Israel, 13-17 July 1981, Lecture Notes in Computer Science, Vol. 115, 1981, pp. 16-28.
25. J. Heintz, C.P. Schnorr, Testing polynomials which are easy to compute, in: Logic and Algorithmic, Monographie de l'Enseignement Mathématique, Vol. 30, Université de Genève, Imprimerie Kundig, Genève, 1982, pp. 237-254.
26. Hutton G., Meijer E., Functional pearls. Monadic parsing in Haskell J. Func. Program. 8 4 1998 437-444.
27. T. Johnsson, Compiling lazy functional languages, Ph.D. Thesis, Department of Computing Science, Chalmers University of Technology, 1987.
28. R. Jones, R. Lins, Garbage collection, in: Algorithms for Automatic Dynamic Memory Management, Wiley, Chichester, 1996.
29. T. Krick, L.M. Pardo, A computational method for diophantine approximation, in: L. González-Vega, T. Recio (Eds.), Proceedings of MEGA'94 on Algorithms in Algebraic Geometry and Applications, Progress in Mathematics, Vol. 143, Birkhäuser, Basel, 1996, pp. 193-254.
30. Kronecker L., Grundzüge einer arithmetischen Theorie de algebraischen Grössen J. Reine Angew. Math. 92 1882 1-122.
31. LiDIA, A library for computational number theory, TU Darmstodt, http://www.informatik.tu-darmstadt.de/Tl/LiDIA, 2002.
32. Mahajan M., Vinay V., Determinant: old algorithms, new insight SIAM J. Discrete Math. 12 4 1999 474-490.
33. G. Matera, Integration of multivariate rational functions given by straight-line programs, in: G. Cohen, H. Giusti, T. Mora (Eds.), Proceedings of the AAECC-11 on Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Lecture Notes in Computer Science, Vol. 948, Springer, Berlin, 1995.
34. G. Matera, Sobre la complejidad en espacio y tiempo de la eliminación geométrica, Ph.D. Thesis, Universidad de Buenos Aires, Argentina, 1997.
35. Matera G., Probabilistic algorithms for geometric elimination Appl. Alg. Eng. Commun. Comput. 9 6 1999 463-520.
36. Moses J., Algebraic simplification: a guide for the perplexed Commun. ACM 14 1971 548-560.
37. L.M. Pardo, How lower and upper complexity bounds meet in elimination theory, in: G. Cohen, H. Giusti, T. Mora (Eds.), Proceedings of the AAECC-11 on Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Lecture Notes in Computer Science, Vol. 948, Springer, Berlin, 1995.
38. J. Peterson, K. Hammond (Eds.), Report on the programming language Haskell: a non-strict purely functional language, Version 1.4, Department of Computer Science, Yale University, 1997.
39. L. Rall, G. Corliss, An introduction to automatic differentiation, in: M. Berz, C. Bischof, G. Corliss, A. Griewank (Eds.), Computational Differentiation: Technique, Applications, and Tools, SIAM Proceedings Series List, SIAM, Philadelphia, 1996, pp. 1-18.
40. Schwartz J.T., Fast probabilistic algorithms for verification of polynomial identities J. Assoc. Comput. Mach. 27 4 1980 701-717.
41. Schönhage A., Strassen V., Schnelle Multiplikation großer Zahlen Computing 7 1971 281-292.
42. Strassen V., Vermeidung von Divisionen J. Reine Angew. Math 264 1973 182-202.
43. S. Thompson, Haskell: The Craft of Functional Programming, 2nd Edition, Addison-Wesley, Reading, MA, 1999.
44. Wadler P., Deforestation: transforming programs to eliminate trees Theor. Comput. Sci. 73 1990 231-248.
45. P. Wadler, The essence of functional programming, in: Proceedings of the 19th Symposium on Principles of Programming Languages, ACM Press, Albuquerque, 1992.
46. P. Wadler, Monads for functional programming, in: J. Jeuring, E. Meijer (Eds.), Advanced Functional Programming, Lecture Notes in Computer Science, Vol. 925, Springer, Berlin, 1995.
47. F. Winkler, Polynomial algorithms in computer algebra, in: Texts and Monographs in Symbolic Computation, Springer, Wien, 1996.
48. R. Zippel, Probabilistic algorithms for sparse polynomials, in: Proceedings of the EUROSAM'79, Lecture Notes in Computer Science, Vol. 72, 1979, pp. 216-226.