edu.jas.ufd
Class GreatestCommonDivisorModEval<MOD extends GcdRingElem<MOD> & Modular>

java.lang.Object
  edu.jas.ufd.GreatestCommonDivisorAbstract<MOD>
      edu.jas.ufd.GreatestCommonDivisorModEval<MOD>

All Implemented Interfaces:

GreatestCommonDivisor<MOD>, java.io.Serializable

public class GreatestCommonDivisorModEval<MOD extends GcdRingElem<MOD> & Modular>
extends GreatestCommonDivisorAbstract<MOD>

Greatest common divisor algorithms with modular evaluation algorithm for recursion.

Author:

Heinz Kredel

See Also:

Serialized Form

Field Summary

protected GreatestCommonDivisorAbstract<MOD>

mufd Modular gcd algorithm to use.

Constructor Summary

GreatestCommonDivisorModEval()

Method Summary

GenPolynomial<MOD>	baseGcd(GenPolynomial<MOD> P, GenPolynomial<MOD> S) Univariate GenPolynomial greatest comon divisor.
GenPolynomial<MOD>	gcd(GenPolynomial<MOD> P, GenPolynomial<MOD> S) GenPolynomial greatest comon divisor, modular evaluation algorithm.
GenPolynomial<GenPolynomial<MOD>>	recursiveUnivariateGcd(GenPolynomial<GenPolynomial<MOD>> P, GenPolynomial<GenPolynomial<MOD>> S) Univariate GenPolynomial recursive greatest comon divisor.

Methods inherited from class edu.jas.ufd.GreatestCommonDivisorAbstract

baseContent, baseExtendedGcd, baseGcdDiophant, baseHalfExtendedGcd, basePartialFraction, basePartialFraction, basePartialFraction, basePartialFractionValue, basePrimitivePart, baseRecursiveContent, baseRecursivePrimitivePart, content, coPrime, coPrime, coPrimeRec, divide, gcd, isBasePartialFraction, isBasePartialFraction, isCoPrime, isCoPrime, lcm, primitivePart, recursiveContent, recursiveGcd, recursivePrimitivePart, resultant, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

mufd

protected final GreatestCommonDivisorAbstract<MOD extends GcdRingElem<MOD> & Modular> mufd

Modular gcd algorithm to use.

Constructor Detail

GreatestCommonDivisorModEval

public GreatestCommonDivisorModEval()

Method Detail

baseGcd

public GenPolynomial<MOD> baseGcd(GenPolynomial<MOD> P,
                                  GenPolynomial<MOD> S)

Univariate GenPolynomial greatest comon divisor. Delegate to subresultant baseGcd, should not be needed.

Specified by:

baseGcd in class GreatestCommonDivisorAbstract<MOD extends GcdRingElem<MOD> & Modular>

Parameters:

P - univariate GenPolynomial.

S - univariate GenPolynomial.

Returns:

gcd(P,S).

recursiveUnivariateGcd

public GenPolynomial<GenPolynomial<MOD>> recursiveUnivariateGcd(GenPolynomial<GenPolynomial<MOD>> P,
                                                                GenPolynomial<GenPolynomial<MOD>> S)

Univariate GenPolynomial recursive greatest comon divisor. Delegate to subresultant recursiveGcd, should not be needed.

Specified by:

recursiveUnivariateGcd in class GreatestCommonDivisorAbstract<MOD extends GcdRingElem<MOD> & Modular>

Parameters:

P - univariate recursive GenPolynomial.

S - univariate recursive GenPolynomial.

Returns:

gcd(P,S).

gcd

public GenPolynomial<MOD> gcd(GenPolynomial<MOD> P,
                              GenPolynomial<MOD> S)

GenPolynomial greatest comon divisor, modular evaluation algorithm. Method name must be different because of parameter type erasure.

Specified by:

gcd in interface GreatestCommonDivisor<MOD extends GcdRingElem<MOD> & Modular>

Overrides:

gcd in class GreatestCommonDivisorAbstract<MOD extends GcdRingElem<MOD> & Modular>

Parameters:

P - GenPolynomial.

S - GenPolynomial.

Returns:

gcd(P,S).