Release Notes: The code was downgraded for the Java 5 language and run-time system for use with systems relying on older Java versions, for example MathPiper and GeoGebra. The edu.jas.kern.TimeStatus class was added to provide user feedback for long running tasks via the checkTime() method. Some missing extGB() methods were implemented. GBFactory was added for the selection of appropriate Gröbner base implementations. The isFinite() method was added for all ElemFactorys and usage in SquarefreeFactory. Some missing parts were added for the factorization in polynomial rings of characteristic p > 0 and ideal decomposition.
Release Notes: A new factory for Gröbner base algorithm implementations is in the class GBFactory. The new GBProxy is, like GCDProxy, able to run a sequential and a parallel Gröbner base computation concurrently. Primitive element computation is implemented via normalPositionFor() in the methods primitiveElement() together with several conversion methods convertToPrimitiveElem(). There is a new index of all algorithms from the book Gröbner bases by Becker and Weispfenning to equivalent JAS implementations.
Release Notes: Implementation of arbitrary dimensional ideal radical-, irreducible-, prime-, and primary-decomposition in class Ideal with methods radicalDecomposition(), decomposition(), primeDecomposition(), and primaryDecomposition(). Computation of extension and contraction ideals. Unit tests for the decomposition methods. A fix for a bug in multivariate polynomial factorization in Kronecker's method. A fix for a bug in squarefree decomposition in inseparable cases. A NO_THREADS flag has been added to edu.jas.kern.ComputerThreads to avoid (some) thread creation for usage in Google app engine.
Release Notes: Implementation of zero dimensional ideal radical-, prime-, primary-, and root-decomposition in the class Ideal with methods zeroDimRadicalDecomposition(), zeroDimDecomposition(), zeroDimPrimeDecomposition(), zeroDimPrimaryDecomposition(), and zeroDimRootDecomposition(). Exact 0-dim ideal real root computation and approximation in methods PolyUtilApp.realAlgebraicRoots() and decimalApproximation(). Small enhancements to Javadoc comments.
Release Notes: Some more documentation for the package edu.jas.ufd. The factory classes of the package have been simplified and improved. Refactoring of parallel Gröbner bases computations for solvable polynomial rings. Improved logging for distributed Gröbner bases and distributed middle-ware.
Release Notes: Construction of minimal univariate polynomials in zero dimensional ideals. Supersets of complex and real roots of zero dimensional ideals. More unit tests for real and complex roots of univariate polynomials and zero dimensional ideal roots. Minor enhancements and fixes.
Release Notes: This release adds decimal approximations for real and complex roots based on Newton-Raphson iterations restricted to isolating intervals or rectangles, small enhancements for partial Gröbner bases, and some Mersenne primes in PrimeList.
Release Notes: Gröbner bases for sub-sets of variables in class GroebnerBasePartial were implemented. Small enhancements were made to the polynomial recursive coefficient parser and a matrix parser. Book-keeping of all used polynomial variable names is done. New and improved unit tests were added.
Release Notes: Factorization for polynomials with Complex coefficients via algebraic coefficients in Q(i). New classes ModLong and ModLongRing for faster modular arithmetic. New interfaces Modular and ModularRingFactory implemented also by ModInteger to make both interchangable. Improved factorization and several refactorings. Factorization mod p = 2 is now implemented.
Release Notes: New classes were added for complex root isolation: ComplexRoots, ComplexRootsAbstract, and ComplexRootsSturm. The implementation provides an exact infallible method which follows the numerical method of Wilf. It uses Sturm sequences following the Routh-Hurwitz Method to count the number of complex roots within a rectangle in the complex plane.