Component-level parallelization of triangular decompositions

PASCO'07: Proceedings of the 2007 International Workshop on Parallel Symbolic Computation

Volumn , Issue , 2007, Pages 69-77

  Maza, Marc Moreno ^a   Xie, Yuzhen ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Component level; Parallelization; Polynomial system solving; Triangular decompositions

Indexed keywords

DYNAMIC PROGRAMMING; MULTIPROCESSING PROGRAMS; POLYNOMIALS; PROBLEM SOLVING; PROGRAM PROCESSORS;

COMPONENT LEVEL PARALLELIZATION; POLYNOMIAL SYSTEM SOLVING; TRIANGULAR DECOMPOSITIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 36849046739     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1278177.1278189     Document Type: Article

References (38)

1. I. A. Ajwa. Parallel Algorithms and Implementations for the Gröbner Bases Algorithm and the Characteristic Set Method. PhD thesis, Kent State University, Kent, Ohio, 1998.
2. aldor.org. The Aldor compiler web site. University of Western Ontario, Canada, 2002.
3. G. Attardi and C. Traverso. Strategy-accurate parallel Buchberger algorithms. Journal of Symbolic Computation, 21(4):411-425, 1996.
4. P. Aubry and M. Moreno Maza. Triangular sets for solving polynomial systems: A comparative implementation of four methods. J. Symb. Comp., 28(1-2):125-154, 1999.
5. E. Becker, T. Mora, M. G. Marinari, and C. Traverso. The shape of the shape lemma. In Proc. of the international symposium on Symbolic and algebraic computation, pages 129-133, New York, NY, USA, 1994. ACM Press.
6. R. Bradford. A parallelization of the Buchberger algorithm. In Proc. of the international symposium on Symbolic and algebraic computation, New York, NY, USA, 1990. ACM Press.
7. R. Bündgen, M. Göbel, and W. Küchlin. A fine-grained parallel completion procedure. In ISSAC '94: Proceedings of the international symposium on Symbolic and algebraic computation, pages 269-277, New York, NY, USA, 1994. ACM Press.
8. S. Chakrabarti and K. Yelick. Distributed data structures and algorithms for Gröbner basis computation. LISP AND SYMBOLIC COMPUTATION: An International Journal, 7:147-172, 1994.
9. C. Chen, F. Lemaire, M. Moreno Maza, W. Pan, and Y. Xie. Efficient computations of irredundant triangular decompositions with the regularchains library. In Proc. of CASA 2007, 2006.
10. J. Coffmann and P. J. Denning. Operating Systems Theory. Prentice Hall, 1973.
11. X. Dahan, M. Moreno Maza, É. Schost, W. Wu, and Y. Xie. Lifting techniques for triangular decompositions. In ISSAC'05, pages 108-115. ACM Press, 2005.
12. X. Dahan, M. Moreno Maza, É. Schost, and Y. Xie. On the complexity of the D5 principle. In Proc. of Transgressive Computing 2006, Granada, Spain, 2006.
13. J.-C Faugère. Parallelization of Gröbner bases. In Proc. PASCO'94. World Scientific Publishing Company, 1994.
14. P. Gianni, B. Trager, and G. Zacharias. Gröbner Bases and Primary Decomposition Of Polynomial Ideals. J. Symb. Comp., 6:149-167, 1988.
15. J. Grabmeier, E. Kaltofen, and V. Weispfenning, editors. Computer Algebra Handbook. Springer, 2003.
16. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(3):416-429, March 1969.
17. The Computational Mathematics Group. The basicmath library. NAG Ltd, Oxford, UK, 1998. http://www.nag.co.uk/projects/FRJSCO.html.
18. H. Hong and H. W. Loidl. Parallel computation of modular multivariate polynomial resultants on a shared memory machine. In B. Buchberger and J. Volkert, editors, Proc. of CONPAR 94-VAPP VI, Springer LNCS 854., pages 325-336. Springer Verlag, September 1994.
19. R. D. Jenks and R. S. Sutor. AXIOM, The Scientific Computation System. Springer-Verlag, 1992. AXIOM is a trade mark of NAG Ltd, Oxford UK.
20. M. Kalkbrener. A generalized euclidean algorithm for Computing triangular representations of algebraic varieties. J. Symb. Comp., 15:143-167, 1993.
21. D. Lazard. A new method for solving algebraic systems of positive dimension. Discr. App. Math, 33:147-160, 1991.
22. G. Lecerf. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. Complexity, 19(4):564-596, 2003.
23. F. Lemaire, M. Moreno Maza, and Y. Xie. The Regular Chains library. In Maple 10, Maplesoft, Canada, 2005. Refereed software.
24. F. Lemaire, M. Moreno Maza, and Y. Xie. Making a sophisticated symbolic solver available to different communities of users. In Proc. of Asian Technology Conference in Mathematics '06, 2006.
25. A. Leykin. On parallel computation of Gröbner bases. In ICPP Workshops, pages 160-164, 2004.
26. X. Li and M. Moreno Maza. Multithreaded parallel implementation of arithmetic operations modulo a triangular set. In Proc. PASCO'07, ACM Press, 2007.
27. Maplesoft. Maple 10. http://www.maplesoft.com/, 2005.
28. M. Moreno Maza, B. Stephenson, S. M. Watt, and Y. Xie. Multiprocessed parallelism support in aldor on snips and multicores. Submitted to PASCO 2007, 2007.
29. M. Moreno Maza. On triangular decompositions of algebraic varieties. Technical Report TR 4/99, NAG Ltd, Oxford, UK, 1999. Presented at the MEGA-2000 Conference, Bath, England. http://www.csd.uwo.ca/~moreno.
30. M. Moreno Maza and R. Rioboo. Polynomial gcd computations over towers of algebraic extensions. In Proc. AAECC-11, pages 365-382. Springer, 1995.
31. M. O. Rayes, P. S. Wang, and K. Weber. Parallelization of the sparse modular gcd algorithm for multivariate polynomials on shared memory multiprocessors. In Proc. of the international symposium on Symbolic and algebraic computation, pages 66-73, New York, NY, USA, 1994. ACM Press.
32. T. Shimoyama and K. Yokoyama. Localization and primary decomposition of polynomial ideals. J. Symb. Comput., 22(3):247-277, 1996.
33. A.J. Sommese, J. Verscheide, and C.W. Wampler. Numerical decomposition of the solution sets of polynomial systems into irreducible components. SIAM J. Numer. Anal., 38(6):2022-2046, 2001.
34. D. M. Wang. Elimination Methods. Springer, Wien, New York, 2000.
35. V. Weispfenning. Canonical comprehensive grobner bases. In ISSAC 2002, pages 270-276. ACM Press, 2002.
36. W. T. Wu. A zero structure theorem for polynomial equations solving. MM Research Preprints, 1:2-12, 1987.
37. Y.W. Wu, W.D. Liao, D.D. Lin, and P.S. Wang. Local and remote user interface for ELIMINO through OMEI. Technical report, Kent State University, Kent, Ohio, 2003. http://icm.mcs.kent.edu/reports/.
38. Y.W. Wu, G.W. Yang, H. Yang, W.M. Zheng, and D.D. Lin. A distributed computing model for wu's method. Journal of Software (in Chinese), 16(3), 2005.