Rings: efficient JVM library for polynomial rings
This release addresses performance issues of multivariate GCD routines for huge polynomials:
Other things:
rings.repl
can be now used to execute Rings scriptsThis release introduces efficient methods for dealing with polynomial ideals, including Groebner bases computation and algebraic operations with ideals. The following new features are implemented:
Ideal
class (union, intersection, quotient and other methods)DegreeVector
non abstract and introduce abstract class for monomials AMonomial
IMonomialAlgebra
interfaceRing
interfaceLinearSolver
rings.poly.univar.DiophantineEquations
)FactorDecomposition
made generic and moved to rings
packagegcd
, extendedGCD
, factor
and factorSquareFree
methods to Ring
interfacePolynomialRing
in Scala DSL to IPolynomialRing
(make it consistent with Java API)Changes:
Changes:
brew install PoslavskySV/rings/rings.repl
The first public release: