The Java Algebra System (JAS) is an object oriented, type safe, multi-threaded approach to computer algebra. JAS provides a well designed software library using generic types for algebraic computations implemented in the Java programming language. The library can be used as any other Java software package, or it can be used interactively or interpreted through a Jython or JRuby front end. The focus at the moment is on commutative and solvable polynomials, power-series, multivariate polynomial factorization, Gröbner bases, and applications.
|Tags||Mathematics Scientific/Engineering algebra education Symbolic Computation|
|Operating Systems||Java Capable|
|Implementation||Java Jython JRuby|
JAS code analysis is available from Ohloh at http://www.ohloh.net/p/JAS-project
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.