Uses of Class
edu.jas.ufd.GreatestCommonDivisorAbstract
Packages that use GreatestCommonDivisorAbstract
Package
Description
Groebner bases using unique factorization package.
Elementary Integration package.
Unique factorization domain package.
-
Uses of GreatestCommonDivisorAbstract in edu.jas.gbufd
Fields in edu.jas.gbufd declared as GreatestCommonDivisorAbstractModifier and TypeFieldDescriptionprotected final GreatestCommonDivisorAbstract
<C> GroebnerBasePseudoParallel.engine
Greatest common divisor engine for coefficient content and primitive parts.protected final GreatestCommonDivisorAbstract
<C> GroebnerBasePseudoRecParallel.engine
Greatest common divisor engine for coefficient content and primitive parts.protected final GreatestCommonDivisorAbstract
<C> GroebnerBasePseudoRecSeq.engine
Greatest common divisor engine for coefficient content and primitive parts.protected final GreatestCommonDivisorAbstract
<C> GroebnerBasePseudoSeq.engine
Greatest common divisor engine for coefficient content and primitive parts.protected final GreatestCommonDivisorAbstract
<C> MultiplicativeSetCoPrime.engine
Gcd computation engine.private final GreatestCommonDivisorAbstract
<C> PseudoMiReducer.engine
private final GreatestCommonDivisorAbstract
<C> PseudoMiReducerRec.engine
private final GreatestCommonDivisorAbstract
<C> PseudoReducer.engine
private final GreatestCommonDivisorAbstract
<C> PseudoReducerRec.engine
protected final GreatestCommonDivisorAbstract
<C> RGroebnerBasePseudoSeq.engine
Greatest common divisor engine for coefficient content and primitive parts.protected final GreatestCommonDivisorAbstract
<C> SolvableGroebnerBasePseudoRecSeq.engine
Greatest common divisor engine for coefficient content and primitive parts.protected final GreatestCommonDivisorAbstract
<C> SolvableGroebnerBasePseudoSeq.engine
Greatest common divisor engine for coefficient content and primitive parts.protected final GreatestCommonDivisorAbstract
<C> WordGroebnerBasePseudoRecSeq.engine
Greatest common divisor engine for coefficient content and primitive parts.Constructors in edu.jas.gbufd with parameters of type GreatestCommonDivisorAbstractModifierConstructorDescriptionprotected
MultiplicativeSetCoPrime
(GenPolynomialRing<C> ring, List<GenPolynomial<C>> ms, GreatestCommonDivisorAbstract<C> eng) MultiplicativeSet constructor.(package private)
PseudoMiReducer
(List<GenPolynomial<C>> G, GenPolynomial<C> p, GreatestCommonDivisorAbstract<C> engine) (package private)
PseudoMiReducerRec
(List<GenPolynomial<GenPolynomial<C>>> G, GenPolynomial<GenPolynomial<C>> p, GreatestCommonDivisorAbstract<C> engine) (package private)
PseudoReducer
(Terminator fin, List<GenPolynomial<C>> G, PairList<C> L, GreatestCommonDivisorAbstract<C> engine) (package private)
PseudoReducerRec
(Terminator fin, List<GenPolynomial<GenPolynomial<C>>> G, PairList<GenPolynomial<C>> L, GreatestCommonDivisorAbstract<C> engine) -
Uses of GreatestCommonDivisorAbstract in edu.jas.integrate
Fields in edu.jas.integrate declared as GreatestCommonDivisorAbstractModifier and TypeFieldDescriptionfinal GreatestCommonDivisorAbstract
<C> ElementaryIntegration.ufd
Engine for greatest common divisors. -
Uses of GreatestCommonDivisorAbstract in edu.jas.ufd
Subclasses of GreatestCommonDivisorAbstract in edu.jas.ufdModifier and TypeClassDescriptionclass
GCDProxy<C extends GcdRingElem<C>>
Greatest common divisor parallel proxy.class
GreatestCommonDivisorFake<C extends GcdRingElem<C>>
Greatest common divisor algorithms with gcd always 1.class
GreatestCommonDivisorHensel<MOD extends GcdRingElem<MOD> & Modular>
Greatest common divisor algorithms with subresultant polynomial remainder sequence and univariate Hensel lifting.class
GreatestCommonDivisorModEval<MOD extends GcdRingElem<MOD> & Modular>
Greatest common divisor algorithms with modular evaluation algorithm for recursion.class
GreatestCommonDivisorModular<MOD extends GcdRingElem<MOD> & Modular>
Greatest common divisor algorithms with modular computation and Chinese remainder algorithm.class
GreatestCommonDivisorPrimitive<C extends GcdRingElem<C>>
Greatest common divisor algorithms with primitive polynomial remainder sequence.class
GreatestCommonDivisorSimple<C extends GcdRingElem<C>>
Greatest common divisor algorithms with monic polynomial remainder sequence.class
GreatestCommonDivisorSubres<C extends GcdRingElem<C>>
Greatest common divisor algorithms with subresultant polynomial remainder sequence.Fields in edu.jas.ufd declared as GreatestCommonDivisorAbstractModifier and TypeFieldDescriptionfinal GreatestCommonDivisorAbstract
<C> GCDProxy.e1
GCD and resultant engines.final GreatestCommonDivisorAbstract
<C> GCDProxy.e2
protected final GreatestCommonDivisorAbstract
<C> FactorAbstract.engine
Gcd engine for base coefficients.protected final GreatestCommonDivisorAbstract
<C> SquarefreeAbstract.engine
GCD engine for respective base coefficients.GreatestCommonDivisorHensel.iufd
Fall back gcd algorithm.protected final GreatestCommonDivisorAbstract
<BigInteger> GreatestCommonDivisorModular.iufd
protected final GreatestCommonDivisorAbstract
<MOD> FactorInteger.mengine
Gcd engine for modular base coefficients.protected final GreatestCommonDivisorAbstract
<MOD> GreatestCommonDivisorModEval.mufd
Modular gcd algorithm to use.protected final GreatestCommonDivisorAbstract
<MOD> GreatestCommonDivisorModular.mufd
private final GreatestCommonDivisorAbstract
<BigInteger> GreatestCommonDivisorHensel.ufd
Methods in edu.jas.ufd that return GreatestCommonDivisorAbstractModifier and TypeMethodDescriptionGCDFactory.getImplementation
(BigInteger fac) Determine suitable implementation of gcd algorithms, case BigInteger.GCDFactory.getImplementation
(BigRational fac) Determine suitable implementation of gcd algorithms, case BigRational.GCDFactory.getImplementation
(ModIntegerRing fac) Determine suitable implementation of gcd algorithms, case ModInteger.static GreatestCommonDivisorAbstract
<ModInt> GCDFactory.getImplementation
(ModIntRing fac) Determine suitable implementation of gcd algorithms, case ModInt.static GreatestCommonDivisorAbstract
<ModLong> GCDFactory.getImplementation
(ModLongRing fac) Determine suitable implementation of gcd algorithms, case ModLong.static <C extends GcdRingElem<C>>
GreatestCommonDivisorAbstract<C> GCDFactory.getImplementation
(RingFactory<C> fac) Determine suitable implementation of gcd algorithms, other cases.GCDFactory.getProxy
(BigInteger fac) Determine suitable procy for gcd algorithms, case BigInteger.GCDFactory.getProxy
(BigRational fac) Determine suitable proxy for gcd algorithms, case BigRational.GCDFactory.getProxy
(ModIntegerRing fac) Determine suitable proxy for gcd algorithms, case ModInteger.static GreatestCommonDivisorAbstract
<ModInt> GCDFactory.getProxy
(ModIntRing fac) Determine suitable proxy for gcd algorithms, case ModInt.static GreatestCommonDivisorAbstract
<ModLong> GCDFactory.getProxy
(ModLongRing fac) Determine suitable proxy for gcd algorithms, case ModLong.static <C extends GcdRingElem<C>>
GreatestCommonDivisorAbstract<C> GCDFactory.getProxy
(RingFactory<C> fac) Determine suitable proxy for gcd algorithms, other cases.Constructors in edu.jas.ufd with parameters of type GreatestCommonDivisorAbstractModifierConstructorDescriptionProxy constructor.Constructor.