Interface | Description |
---|---|
GreatestCommonDivisor<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor algorithm
interface.
|
Class | Description |
---|---|
FDUtil |
Factorization domain utilities, for example recursive pseudo remainder.
|
FDUtilTest |
FDUtil tests with JUnit.
|
GCDPrimitiveTest |
GCD Primitive PRS algorithm tests with JUnit.
|
GCDSimpleTest |
GCD Simple PRS algorithm tests with JUnit.
|
GreatestCommonDivisorAbstract<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms.
|
GreatestCommonDivisorPrimitive<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms
with primitive polynomial remainder sequence.
|
GreatestCommonDivisorSimple<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms
with monic polynomial remainder sequence.
|
This package contains classes for solvable polynomials rings as
(non-unique) factorization domains. Methods provided with interface
GreatestCommonDivisor
are e.g. greatest common divisors
gcd()
, primitive part primitivePart()
or
coPrime()
.
The implementation is new research.
Last modified: Thu Dec 26 18:18:12 CET 2013
$Id: package.html 4705 2013-12-26 17:18:43Z kredel $