Uses of Class
edu.jas.ufd.GreatestCommonDivisorAbstract
-
Packages that use GreatestCommonDivisorAbstract Package Description edu.jas.gbufd Groebner bases using unique factorization package.edu.jas.integrate Elementary Integration package.edu.jas.ufd Unique factorization domain package. -
-
Uses of GreatestCommonDivisorAbstract in edu.jas.gbufd
Fields in edu.jas.gbufd declared as GreatestCommonDivisorAbstract Modifier and Type Field Description protected GreatestCommonDivisorAbstract<C>
GroebnerBasePseudoParallel. engine
Greatest common divisor engine for coefficient content and primitive parts.protected GreatestCommonDivisorAbstract<C>
GroebnerBasePseudoRecParallel. engine
Greatest common divisor engine for coefficient content and primitive parts.protected GreatestCommonDivisorAbstract<C>
GroebnerBasePseudoRecSeq. engine
Greatest common divisor engine for coefficient content and primitive parts.protected GreatestCommonDivisorAbstract<C>
GroebnerBasePseudoSeq. engine
Greatest common divisor engine for coefficient content and primitive parts.protected GreatestCommonDivisorAbstract<C>
MultiplicativeSetCoPrime. engine
Gcd computation engine.private GreatestCommonDivisorAbstract<C>
PseudoMiReducer. engine
private GreatestCommonDivisorAbstract<C>
PseudoMiReducerRec. engine
private GreatestCommonDivisorAbstract<C>
PseudoReducer. engine
private GreatestCommonDivisorAbstract<C>
PseudoReducerRec. engine
protected GreatestCommonDivisorAbstract<C>
RGroebnerBasePseudoSeq. engine
Greatest common divisor engine for coefficient content and primitive parts.protected GreatestCommonDivisorAbstract<C>
SolvableGroebnerBasePseudoRecSeq. engine
Greatest common divisor engine for coefficient content and primitive parts.protected GreatestCommonDivisorAbstract<C>
SolvableGroebnerBasePseudoSeq. engine
Greatest common divisor engine for coefficient content and primitive parts.protected GreatestCommonDivisorAbstract<C>
WordGroebnerBasePseudoRecSeq. engine
Greatest common divisor engine for coefficient content and primitive parts.Constructors in edu.jas.gbufd with parameters of type GreatestCommonDivisorAbstract Constructor Description MultiplicativeSetCoPrime(GenPolynomialRing<C> ring, java.util.List<GenPolynomial<C>> ms, GreatestCommonDivisorAbstract<C> eng)
MultiplicativeSet constructor.PseudoMiReducer(java.util.List<GenPolynomial<C>> G, GenPolynomial<C> p, GreatestCommonDivisorAbstract<C> engine)
PseudoMiReducerRec(java.util.List<GenPolynomial<GenPolynomial<C>>> G, GenPolynomial<GenPolynomial<C>> p, GreatestCommonDivisorAbstract<C> engine)
PseudoReducer(Terminator fin, java.util.List<GenPolynomial<C>> G, PairList<C> L, GreatestCommonDivisorAbstract<C> engine)
PseudoReducerRec(Terminator fin, java.util.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 GreatestCommonDivisorAbstract Modifier and Type Field Description GreatestCommonDivisorAbstract<C>
ElementaryIntegration. ufd
Engine for greatest common divisors. -
Uses of GreatestCommonDivisorAbstract in edu.jas.ufd
Subclasses of GreatestCommonDivisorAbstract in edu.jas.ufd Modifier and Type Class Description class
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 GreatestCommonDivisorAbstract Modifier and Type Field Description GreatestCommonDivisorAbstract<C>
GCDProxy. e1
GCD and resultant engines.GreatestCommonDivisorAbstract<C>
GCDProxy. e2
protected GreatestCommonDivisorAbstract<C>
FactorAbstract. engine
Gcd engine for base coefficients.protected GreatestCommonDivisorAbstract<C>
SquarefreeAbstract. engine
GCD engine for respective base coefficients.GreatestCommonDivisorAbstract<BigInteger>
GreatestCommonDivisorHensel. iufd
Fall back gcd algorithm.protected GreatestCommonDivisorAbstract<BigInteger>
GreatestCommonDivisorModular. iufd
protected GreatestCommonDivisorAbstract<MOD>
FactorInteger. mengine
Gcd engine for modular base coefficients.protected GreatestCommonDivisorAbstract<MOD>
GreatestCommonDivisorModEval. mufd
Modular gcd algorithm to use.protected GreatestCommonDivisorAbstract<MOD>
GreatestCommonDivisorModular. mufd
private GreatestCommonDivisorAbstract<BigInteger>
GreatestCommonDivisorHensel. ufd
Methods in edu.jas.ufd that return GreatestCommonDivisorAbstract Modifier and Type Method Description static GreatestCommonDivisorAbstract<BigInteger>
GCDFactory. getImplementation(BigInteger fac)
Determine suitable implementation of gcd algorithms, case BigInteger.static GreatestCommonDivisorAbstract<BigRational>
GCDFactory. getImplementation(BigRational fac)
Determine suitable implementation of gcd algorithms, case BigRational.static GreatestCommonDivisorAbstract<ModInteger>
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.static GreatestCommonDivisorAbstract<BigInteger>
GCDFactory. getProxy(BigInteger fac)
Determine suitable procy for gcd algorithms, case BigInteger.static GreatestCommonDivisorAbstract<BigRational>
GCDFactory. getProxy(BigRational fac)
Determine suitable proxy for gcd algorithms, case BigRational.static GreatestCommonDivisorAbstract<ModInteger>
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 GreatestCommonDivisorAbstract Constructor Description GCDProxy(GreatestCommonDivisorAbstract<C> e1, GreatestCommonDivisorAbstract<C> e2)
Proxy constructor.SquarefreeAbstract(GreatestCommonDivisorAbstract<C> engine)
Constructor.
-