Generic and Parallel Groebner Bases in JAS
We present generic, type safe Groebner bases software. The implemented algorithms distinguish Groebner base computation in polynomials rings over fields, rings with pseudo division, parameter rings, regular rings, Euclidean rings, non-commutative fields in commuting, solvable and free-non-commuting main variables. The interface, class organization is described in the object-oriented programming environment of the Java Algebra System (JAS). Different critical pair selection strategies and reduction algorithms can be provided by dependency injection. Different implementations can be selected for the mentioned coefficient rings through factory classes and methods. Groebner bases algorithms can be composed according to application needs and/or hardware availability. For example, versions for shared memory sequential or parallel computation, term order optimization or fraction free coefficient ring computation can be composed. For distributed memory compute clusters there are OpenMPI and MPJ implementations of Buchberger’s algorithm with optimized distributed storage of reduction polynomials.
Keywordsgeneric multivariate polynomials generic Groebner bases algorithm composition parallel computation
Unable to display preview. Download preview PDF.
- 2.Buchberger, B.: Gröbner bases: An algorithmic method in polynomial ideal theory. In: Bose, N. (ed.) Recent Trends in Multidimensional Systems Theory, Reidel, pp. 184–232 (1985)Google Scholar
- 7.Kredel, H.: Distributed Gröbner bases computation with MPJ. In: IEEE AINA Workshops, Barcelona, Spain, pp. 1429–1435 (2013)Google Scholar
- 8.Kredel, H.: The Java algebra system (JAS). Technical report (2000), http://krum.rz.uni-mannheim.de/jas/
- 9.Taboada, G.L., Ramos, S., Expósito, R.R., Touriño, J., Doallo, R.: FastMPJ a high performance Java message passing library. Technical report (2011), http://fastmpj.com/