| Interface | Description |
|---|---|
| GreatestCommonDivisor<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor algorithm
interface.
|
| Class | Description |
|---|---|
| FDUtil |
Solvable polynomials factorization domain utilities, for example recursive
pseudo remainder.
|
| FDUtilTest |
FDUtil tests with JUnit.
|
| GCDcoFactors<C extends GcdRingElem<C>> |
Container for the co-factors of left-right GCD computation.
|
| GCDFakeTest |
GCD Fake PRS algorithm tests with JUnit.
|
| GCDLeftRightTest |
GCD LeftRight PRS algorithm 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.
|
| GreatestCommonDivisorFake<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms
with monic polynomial remainder sequence.
|
| GreatestCommonDivisorLR<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms
with monic polynomial remainder sequence.
|
| 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.
|
| GreatestCommonDivisorSyzygy<C extends GcdRingElem<C>> |
(Non-unique) factorization domain greatest common divisor common algorithms
with syzygy computation.
|
| QuotSolvablePolynomial<C extends GcdRingElem<C>> |
QuotSolvablePolynomial generic recursive solvable polynomials implementing
RingElem. n-variate ordered solvable polynomials over solvable polynomial
coefficients.
|
| QuotSolvablePolynomialRing<C extends GcdRingElem<C>> |
QuotSolvablePolynomialRing generic recursive solvable polynomial factory
implementing RingFactory and extending GenSolvablePolynomialRing factory.
|
| QuotSolvablePolynomialTest |
BigRational coefficients QuotSolvablePolynomial tests with JUnit.
|
| SGCDFactory |
Solvable greatest common divisor algorithms factory.
|
| SGCDFactoryTest |
Solvable GreatestCommonDivisor factory tests with JUnit.
|
| SGCDParallelProxy<C extends GcdRingElem<C>> |
Solvable greatest common divisor parallel proxy.
|
| SolvableQuotient<C extends GcdRingElem<C>> |
SolvableQuotient, that is a (left) rational function, based on
GenSolvablePolynomial with RingElem interface.
|
| SolvableQuotientRing<C extends GcdRingElem<C>> |
SolvableQuotient ring factory based on GenPolynomial with RingElem interface.
|
| SolvableQuotientTest |
SolvableQuotient over BigRational GenSolvablePolynomial tests with JUnit.
|
This package contains classes for solvable polynomials rings as
(non-unique) factorization domains. Methods provided with interface
GreatestCommonDivisor are e.g. left / right greatest
common divisors leftGcd(), rightGcd(),
left / right primitive part leftPrimitivePart() or
leftCoPrime().
To choose the correct implementation it is best use the factory classes
SGCDFactory with methods
getImplementation() or getProxy(). These
methods will take care of all possible (implemented) coefficient
rings properties. The polynomial coefficients must implement the
GcdRingElem interface and so must allow greatest common
divisor computations. Greatest common divisor computation is
completely generic and works for any implemented integral domain.
If special, optimized implementations exist they will be used.
Last modified: Fri May 13 19:57:34 CEST 2016
$Id: package.html 5508 2016-05-13 19:25:22Z kredel $