Development of TRIP: Fast sparse multivariate polynomial multiplication using burst tries

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

Volumn 3992 LNCS - II, Issue , 2006, Pages 446-453

  Gastineau, Mickaël ^a   Laskar, Jacques ^a  

^a Institut de Mecanique Celeste et de Calcul des ephemerides   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BUFFER STORAGE; DATA STORAGE EQUIPMENT; VECTORS;

COMPUTER ALGEBRA; FLAT VECTOR REPRESENTATION; POLYNOMIAL MULTIPLICATION; SPARSE MULTIVARIATE;

POLYNOMIALS;

EID: 33746586109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758525_60     Document Type: Conference Paper

References (17)

1. Gastineau, M., Laskar, J.: TRIP 0.98. Manuel de référence TRIP, IMCCE, Paris Observatory (2005) http://www.imcce.fr/Equipes/ASD/trip/trip. html.
2. Laskar, J.: Accurate methods in general planetary theory. Astronomy Astrophysics 144 (1985) 133-146
3. San-Juan, F., Abad, A.: Algebraic and symbolic manipulation of poisson series. Journal of Symbolic Computation 32 (2001) 565-572
4. Ivanova, T.: A New Echeloned Poisson Series Processor (EPSP). Celestial Mechanics and Dynamical Astronomy 80 (2001) 167-176
5. Henrard, J.: A Survey of Poisson Series Processors. Celestial Mechanics and Dynamical Astronomy 45 (1988) 245-253
6. Hida, Y.: Data structures and cache behavior of sparse polynomial multiplication (2002) Class project CS282.
7. Heinz, S., Zobel, J., Williams, H.E.: Burst tries: a fast, efficient data structure for string keys. ACM Trans. Inf. Syst. 20 (2002) 192-223
8. Laskar, J.: Manipulation des séries. In: Modern Methods in Celestial Mechanics, Comptes Rendus de la l3ieme Ecole Printemps d'Astrophysique de Goutelas (France), 24-29 Avril, 1989, Gif-sur-Yvette, Editions Frontieres (1990) 63-88
9. Deprit, T., Deprit, E.: Processing Poisson series in parallel. Journal of Symbolic Computation 10 (1990) 179-201
10. Zorn, B.G.: The measured cost of conservative garbage collection. Software - Practice and Experience 23 (1993) 733-756
11. Hertz, M., Berger, E.D.: Quantifying the performance of garbage collection vs. explicit memory management. In: OOPSLA '05: Proceedings of the 20th annual ACM SIGPLAN conference on Object oriented programming systems languages and applications, New York, NY, USA, ACM Press (2005) 313-326
12. Lea, D.: A memory allocator (1998) http://g.oswego.edu/dl/html/malloc. html.
13. Berger, E.D., Zorn, B.C., McKinley, K.S.: Reconsidering custom memory allocation. SIGPLAN Not. 37 (2002) 1-12
14. Fateman, R.: Comparing the speed of programs for sparse polynomial multiplication. SIGSAM Bull. 37 (2003) 4-15
15. The PARI Group Bordeaux: PARI/GP, version 2.1.5. (2004) available from http://pari.math.u-bordeaux.fr/.
16. Greuel, G.M., Pfister, G., Schönemann, H.: SINGULAR 3.0. A Computer Algebra System for Polynomial Computations, Centre for Computer Algebra, University of Kaiserslautern (2005) http://www.singular.uni-kl.de.
17. Granlund, T.; GNU multiple precision arithmetic library 4.1.4 (2004) http://swox.com/gmp/.