Release Notes: This release brings the solvable polynomial common divisor package edu.jas.fd in a partially usable condition. The definition of greatest common divisor has changed and left and right gcds are now distinguished. Various improvements were made and bugs were fixed. The GB class constructors with PairList parameters have been completed. There is a new parallel recursive polynomial Gröbner base computation. More cases are handled in the GBAlgorithmBuilder and GBFactory. The jython scripting GB now have selectable sig-based GB algorithms. Unit tests for the new algorithms are added.
Release Notes: This release contains small improvements in solvable polynomial common divisor computation. Now, more cases are working, and there is a new method for right pseudo division. There are some performance improvements in class PrimeList. The MPJ Express compatibility and test cases have been restored, and will be kept.
Release Notes: This release adds a new package edu.jas.fd for solvable polynomial common divisor computation. It will contain algorithms for (non-unique) factorization domains. There are methods for polynomial pseudo remainder computation over Ore domains in class FDUtil. More methods for common divisors are included, but not yet finished. The MPJ and MPI implementations have been further converged and cleaned. Javadocs for the JLinAlg adapter classes are published.
Release Notes: This release adds new solvable local residue ring SolvableLocalResidue as solvable quotient field modulo an ideal. Additionally there are new generic solvable polynomials: QLRSolvablePolynomial with abstracted generic coefficients from solvable quotient, local or local-residue rings. The abstracting interfaces QuotPair and QuotPairFactory are implemented in the corresponding classes. Scripting examples for the new classes are adjusted and extended. Differences were removed and different versions of Run*GB stand alone Gröbner base programs were cleaned up.
Release Notes: The Android version of JAS, based on Ruboto (JRuby for Android), is now available with signed code and can be directly installed. This release contains new algorithms for least common multiples and a trial greatest common divisor in solvable polynomial rings. Additionally, the Apel-Lassner canonical simplifier for solvable quotients is available. Some refactoring was required to break package dependency cycles. More Findbugs issues have been solved. Java 5 compatibility has been dropped.
Release Notes: This release contains new distributed Gröbner base algorithms based on the Java bindings of OpenMPI similarly to the MPJ version. Since both MPI and MPJ are not thread-safe, a work-around was developed to split the transport layer to allow selection of TCP/IP sockets or MPI/MPJ channels for transport. The socket-based distributed hash table now implements the clear() method, which solves non-specific errors in iterated distributed Gröbner base computations. The solvable multiplications have been simplified. Fixes and improvements have been made for Jython and JRuby scripts.
Release Notes: This release adds new algorithms for solvable polynomial rings over solvable local rings in classes LocalSolvablePolynomialRing and LocalSolvablePolynomial and new scripting examples for such solvable polynomial rings. The handling of non-commutative relations of solvable polynomials has been refactored to implement and use an interface RelationGenerator. Some more Findbugs and Eclipse issues and several problems with jruby of Android have been fixed and improved.
Release Notes: This release adds new algorithms for solvable polynomial rings over solvable residue rings in classes ResidueSolvablePolynomialRing and ResidueSolvablePolynomial, new methods to compute annihilators with respect to ideals and solvable ideals, new scripting examples for solvable polynomials with solvable residue coefficients, and a fix for associativity of solvable multiplication by considering all cases.
Release Notes: This release brings new algorithms for recursive solvable polynomial rings and new solvable polynomial rings with solvable quotient coefficients. This rings feature non-commutative multiplication of variables with coefficients. There are new scripting examples for recursive solvable polynomial rings and solvable polynomials with solvable quotient coefficients.
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.