On the virtues of generic programming for symbolic computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4488 LNCS, Issue PART 2, 2007, Pages 251-258

  Li, Xin ^a   Maza, Marc Moreno ^a   Schost, Éric ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Efficient implementation; Fast arithmetic; Generic programming; High performance; Polynomials

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION;

EFFICIENT IMPLEMENTATION; FAST ARITHMETIC; GENERIC PROGRAMMING; POLYNOMIAL ARITHMETIC;

CODES (SYMBOLS);

EID: 38049146542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72586-2_35     Document Type: Conference Paper

References (15)

1. W. Bosma, J. J. Cannon, and G. Matthews. Programming with algebraic structures: design of the Magma language. In ISSAC'94, pages 52-57. ACM Press, 1994.
2. The Computational Algebra Group in the School of Mathematics and Statistics at the University of Sydney. The MAGMA Computational Algebra System for Algebra, Number Theory and Geometry, http://magma.maths.usyd.edu. au/magma/.
3. L. Ducos. Optimizations of the subresultant algorithm. J. of Pure Appl. Alg., 145:149-163, 2000.
4. T. Färnqvist. Number theory meets cache locality: efficient implementation of a small prime FFT for the GNU Multiple Precision arithmetic library. Master's thesis, Stockholms Universitet, 2005.
5. A. Filatei, X. Li, M. Moreno Maza, and É. Schost. Implementation techniques for fast polynomial arithmetic in a high-level programming environment. In ISSAC'06, pages 93-100. ACM Press, 2006.
6. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.
7. G. Hanrot, M. Quercia, and P. Zimmermann. The middle product algorithm, I. Appl. Algebra Engrg. Comm. Comput., 14(6):415-438, 2004.
8. J. van der Hoeven. The truncated Fourier transform and applications. In ISSAC'04, pages 290-296. ACM Press, 2004.
9. http://www.shoup.net/ntl. The Number Theory Library. V. Shoup, 1996-2006.
10. R. D. Jenks and R. S. Sutor. AXIOM, The Scientific Computation System. Springer-Verlag, 1992.
11. X. Li. Efficient management of symbolic computations with polynomials, 2005. University of Western Ontario.
12. X. Li and M. Moreno Maza. Efficient implementation of polynomial arithmetic in a multiple-level programming environment. In A. Iglesias and N. Takayama, editors, ICMS 2006, pages 12-23. Springer, 2006.
13. P. L. Montgomery. Modular multiplication without trial division. Math. of Comp., 44(170):519-521, 1985.
14. V. Shoup. A new polynomial factorization algorithm and its implementation. J. Symb. Comp., 20(4):363-397, 1995.
15. S. M. Watt, P. A. Broadbery, S. S. Dooley, P. Iglio, S. C. Morrison, J. M. Steinbach, and R. S. Sutor. A first report on the A# compiler. In ISSAC'94, pages 25-31. ACM Press, 1994.