Java Algebra System

Release Notes: This release provides new algorithms for ideals in solvable polynomial rings in class SolvableIdeal, and new structures for solvable polynomial rings in classes SolvableQuotient, SolvableResidue, and the corresponding factories SolvableQuotientRing and SolvableResidueRing. There is a new theme for Ruby rdoc documentation, and the scripts have been adapted to a newer version of jruby (1.7.3). Some small fixes and improvements are included.

Release Notes: This is a major release with version number 2.5. The Java API will be more stable from now on. It fixes a race condition in distributed (hybrid) Gröbner base implementations and improves the MPJ version of GB computations. The GBFactory has changed, and a new option to select Gebauer & Möller critical pair handling in GBAlgorithmBuilder was added. The default precision of BigDecimal was changed to DECIMAL128. The GreatestCommonDivisorHensel implementation is improved by using integer evaluation points and further optimizations.

Release Notes: This release provides mostly performance optimizations, small improvements, and fixes. The optimizations include combined methods for polynomials like scaleSubtractMultiple(b, g, a, e, S) to compute the expression "b x^g this - a x^e S" in one rush. There is now a first version of a JAS Android App. The app uses its JRuby scripting interface and runs within the Ruby IRB Android app Ruboto.

Release Notes: This release contains new distributed Gröbner base algorithms based on MPI as communication middle-ware. The implementation uses the MPJ (MPI Java) API and can be run with either MPJ Express or FastMPJ. The implementing classes are GroebnerBaseDistributedMPJ for the pure distributed version, and GroebnerBaseDistributedHybridMPJ for the distributed and multi-threaded version.

Release Notes: This release contains new parts for free non-commutative Gröbner base computation and polynomial reduction. It consists of a new interface WordGroebnerBase and new classes WordGroebnerBaseAbstract and WordGroebnerBaseSeq. The jython and jruby access to non-commutative polynomials is provided with the classes WordPolyRing and WordIdeal. Additionally, there is an improved way to select (commutative) Gröbner base algorithm implementations with the class GBAlgorithmBuilder; for example, a fraction free algorithm with optimization of the variable order.