static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<C> |
SGBFactory.getImplementation() |
Determine suitable implementation of GB algorithms, no factory case.
|
static SolvableGroebnerBaseAbstract<BigInteger> |
SGBFactory.getImplementation(BigInteger fac) |
Determine suitable implementation of GB algorithms, case BigInteger.
|
static SolvableGroebnerBaseAbstract<BigInteger> |
SGBFactory.getImplementation(BigInteger fac,
PairList<BigInteger> pl) |
Determine suitable implementation of GB algorithms, case BigInteger.
|
static SolvableGroebnerBaseAbstract<BigInteger> |
SGBFactory.getImplementation(BigInteger fac,
GBFactory.Algo a) |
Determine suitable implementation of GB algorithms, case BigInteger.
|
static SolvableGroebnerBaseAbstract<BigInteger> |
SGBFactory.getImplementation(BigInteger fac,
GBFactory.Algo a,
PairList<BigInteger> pl) |
Determine suitable implementation of GB algorithms, case BigInteger.
|
static SolvableGroebnerBaseAbstract<BigRational> |
SGBFactory.getImplementation(BigRational fac) |
Determine suitable implementation of GB algorithms, case BigRational.
|
static SolvableGroebnerBaseAbstract<BigRational> |
SGBFactory.getImplementation(BigRational fac,
PairList<BigRational> pl) |
Determine suitable implementation of GB algorithms, case BigRational.
|
static SolvableGroebnerBaseAbstract<BigRational> |
SGBFactory.getImplementation(BigRational fac,
GBFactory.Algo a) |
Determine suitable implementation of GB algorithms, case BigRational.
|
static SolvableGroebnerBaseAbstract<BigRational> |
SGBFactory.getImplementation(BigRational fac,
GBFactory.Algo a,
PairList<BigRational> pl) |
Determine suitable implementation of GB algorithms, case BigRational.
|
static SolvableGroebnerBaseAbstract<ModInteger> |
SGBFactory.getImplementation(ModIntegerRing fac) |
Determine suitable implementation of GB algorithms, case ModInteger.
|
static SolvableGroebnerBaseAbstract<ModInteger> |
SGBFactory.getImplementation(ModIntegerRing fac,
PairList<ModInteger> pl) |
Determine suitable implementation of GB algorithms, case ModInteger.
|
static SolvableGroebnerBaseAbstract<ModLong> |
SGBFactory.getImplementation(ModLongRing fac) |
Determine suitable implementation of GB algorithms, case ModLong.
|
static SolvableGroebnerBaseAbstract<ModLong> |
SGBFactory.getImplementation(ModLongRing fac,
PairList<ModLong> pl) |
Determine suitable implementation of GB algorithms, case ModLong.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>> |
SGBFactory.getImplementation(GenPolynomialRing<C> fac) |
Determine suitable implementation of GB algorithms, case (recursive)
polynomial.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>> |
SGBFactory.getImplementation(GenPolynomialRing<C> fac,
PairList<GenPolynomial<C>> pl) |
Determine suitable implementation of GB algorithms, case (recursive)
polynomial.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>> |
SGBFactory.getImplementation(GenPolynomialRing<C> fac,
GBFactory.Algo a) |
Determine suitable implementation of GB algorithms, case (recursive)
polynomial.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>> |
SGBFactory.getImplementation(GenPolynomialRing<C> fac,
GBFactory.Algo a,
PairList<GenPolynomial<C>> pl) |
Determine suitable implementation of GB algorithms, case (recursive)
polynomial.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<C> |
SGBFactory.getImplementation(RingFactory<C> fac) |
Determine suitable implementation of GB algorithms, other cases.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<C> |
SGBFactory.getImplementation(RingFactory<C> fac,
PairList<C> pl) |
Determine suitable implementation of GB algorithms, other cases.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<Quotient<C>> |
SGBFactory.getImplementation(QuotientRing<C> fac) |
Determine suitable implementation of GB algorithms, case Quotient
coefficients.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<Quotient<C>> |
SGBFactory.getImplementation(QuotientRing<C> fac,
PairList<Quotient<C>> pl) |
Determine suitable implementation of GB algorithms, case Quotient
coefficients.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<Quotient<C>> |
SGBFactory.getImplementation(QuotientRing<C> fac,
GBFactory.Algo a) |
Determine suitable implementation of GB algorithms, case Quotient
coefficients.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<Quotient<C>> |
SGBFactory.getImplementation(QuotientRing<C> fac,
GBFactory.Algo a,
PairList<Quotient<C>> pl) |
Determine suitable implementation of GB algorithms, case Quotient
coefficients.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>> |
SGBFactory.getProxy(GenPolynomialRing<C> fac) |
Determine suitable parallel/concurrent implementation of GB algorithms if
possible.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<C> |
SGBFactory.getProxy(RingFactory<C> fac) |
Determine suitable parallel/concurrent implementation of GB algorithms if
possible.
|
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<C> |
SGBFactory.getProxy(RingFactory<C> fac,
PairList<C> pl) |
Determine suitable parallel/concurrent implementation of GB algorithms if
possible.
|