Skip to main content
Log in

A case study of Grid Computing and computer algebra: parallel Gröbner Bases and Characteristic Sets

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

This paper describes a parallel implementation of the Gröbner Bases algorithm and the Characteristic Sets method using a grid environment. The two algorithms, their parallelization, and grid-enabled implementations are presented. The performance of the implementations has been evaluated and the experiments have demonstrated considerable speedups.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ajwa I (1998) Parallel algorithms and implementations for the Gröbner Bases algorithm and the characteristic sets method, Ph.D. Dissertation, Kent State University, Kent, Ohio, December 1998

  2. Ajwa I, Wang P, Lin D (2000) Another attempt for parallel computation of characteristic sets. In: Proceedings of the fourth asian symposium on computer mathematics (ASCM’2000), Lecture Notes Series on Computing, vol 8, pp 63–66

  3. Buchberger B (1965) An algorithm for finding a basis for the residue class ring of a zero-dimensional polynomial ideal (in German), Doctoral Dissertation, Math Inst University of Innsbruck, Austria

  4. Buchberger B (1985) Gröbner Bases: an algorithmic method in polynomial ideal theory. In: Bose NK, Reidel D (eds) Recent trends in multidimensional systems theory, pp 184–232

  5. Buchberger B (1985) The parallel L-machine for symbolic computation. In: Caviness BF (ed) EUROCAL ’85, European conference on computer algebra, Springer, LNCS, vol 204, pp 541–542

  6. Buchberger B et al (1993) SACLIB 1.1 User’s Guide, RISC-Report No. 93-19, Linz, Austria

  7. Fensch J, Ajwa I (2006) A Grid Computing Environment at Ashland University, Technical Report, The Grid Project

  8. Foster I, Kesselman C, Tuecke S (2001) The anatomy of the grid: Enabling scalable virtual organizations. Int J High Perform Comput Appl 15(3):220–222

    Google Scholar 

  9. Grabmeier J, Kaltofen E, Weispfenning V (2003) Computer algebra handbook: foundations, applications, systems. Springer

  10. Lin D, Liu Z (1999) Mathematical research software: ELIMINO. In: Proceedings of the third asian symposium on computer mathematics (ASCM’1998). Lanzhou University Press, pp 107–114

  11. Petcu D, Dubu D, Paprzycki M Maple link to grid, Western University of Timisoara, Romania

  12. Wang D (1991) On the parallelization of the characteristic-set-based algorithms. In: Proceedings of the 1st international conference ACPC

  13. Wolfram Research, gridMathematica, http://www.wolfram.com

  14. Wu W-T (1984) On the decision problem and the mechanization of theorem-proving in elementary geometry, automated theorem proving: after 25 years. Contemp Math 29:213–234

    Google Scholar 

  15. Wu W-T (1986) Basic principles of mechanical theorem proving in elementary geometries. J Autom Reason 2:221–252

    Article  MATH  Google Scholar 

  16. Wu Y, Liao W, Wang P, Lin D, Yang G (2003) An internet accessible grid computing system: Grid-ELIMINO. In: Internet accessible mathematical computation, a workshop of ISSAC

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Iyad A. Ajwa.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ajwa, I.A. A case study of Grid Computing and computer algebra: parallel Gröbner Bases and Characteristic Sets. J Supercomput 41, 53–62 (2007). https://doi.org/10.1007/s11227-007-0103-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-007-0103-y

Keywords

Navigation