Abstract
Flat vector representation of sparse multivariate polynomials is introduced in the computer algebra system TRIP with specific care to the cache memory. Burst tries are considered as an intermediate storage during the sparse multivariate polynomial multiplication by paying attention to the memory allocations. Timing and memory consumption are examined and compared with other recursive representations and other computer algebra systems.
Keywords
- Computer Algebra System
- Memory Consumption
- Polynomial Multiplication
- Binary Search Tree
- Recursive Representation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
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
Laskar, J.: Accurate methods in general planetary theory. Astronomy Astrophysics 144, 133–146 (1985)
San-Juan, F., Abad, A.: Algebraic and symbolic manipulation of poisson series. Journal of Symbolic Computation 32, 565–572 (2001)
Ivanova, T.: A New Echeloned Poisson Series Processor (EPSP). Celestial Mechanics and Dynamical Astronomy 80, 167–176 (2001)
Henrard, J.: A Survey of Poisson Series Processors. Celestial Mechanics and Dynamical Astronomy 45, 245–253 (1988)
Hida, Y.: Data structures and cache behavior of sparse polynomial multiplication. Class project CS282 (2002)
Heinz, S., Zobel, J., Williams, H.E.: Burst tries: a fast, efficient data structure for string keys. ACM Trans. Inf. Syst. 20, 192–223 (2002)
Laskar, J.: Manipulation des séries. In: Modern Methods in Celestial Mechanics, Comptes Rendus de la 13ieme Ecole Printemps d’Astrophysique de Goutelas (France), Gif-sur-Yvette, Avril 24-29, 1989, pp. 63–88. Editions Frontieres (1990)
Deprit, T., Deprit, E.: Processing Poisson series in parallel. Journal of Symbolic Computation 10, 179–201 (1990)
Zorn, B.G.: The measured cost of conservative garbage collection. Software - Practice and Experience 23, 733–756 (1993)
Hertz, M., Berger, E.D.: Quantifying the performance of garbage collection vs. explicit memory management. In: OOPSLA 2005: Proceedings of the 20th annual ACM SIGPLAN conference on Object oriented programming systems languages and applications, pp. 313–326. ACM Press, New York (2005)
Lea, D.: A memory allocator (1998), http://g.oswego.edu/dl/html/malloc.html
Berger, E.D., Zorn, B.G., McKinley, K.S.: Reconsidering custom memory allocation. SIGPLAN Not. 37, 1–12 (2002)
Fateman, R.: Comparing the speed of programs for sparse polynomial multiplication. SIGSAM Bull 37, 4–15 (2003)
The PARI Group Bordeaux: PARI/GP, version 2.1.5 (2004) available from, http://pari.math.u-bordeaux.fr/
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
Granlund, T.: GNU multiple precision arithmetic library 4.1.4 (2004), http://swox.com/gmp/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gastineau, M., Laskar, J. (2006). Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758525_60
Download citation
DOI: https://doi.org/10.1007/11758525_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34381-3
Online ISBN: 978-3-540-34382-0
eBook Packages: Computer ScienceComputer Science (R0)