Package edu.jas.fd
Factorization domain package for solvable polynomial rings.
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.
Heinz Kredel
Last modified: Fri May 13 19:57:34 CEST 2016
$Id$
-
ClassDescriptionSolvable polynomials factorization domain utilities, for example recursive pseudo remainder.GreatestCommonDivisor<C extends GcdRingElem<C>>(Non-unique) factorization domain greatest common divisor algorithm interface.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.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.QuotSolvablePolynomialRing<C extends GcdRingElem<C>>QuotSolvablePolynomialRing generic recursive solvable polynomial factory implementing RingFactory and extending GenSolvablePolynomialRing factory.Solvable greatest common divisor algorithms factory.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.