C - coefficient typepublic class SolvableGroebnerBasePseudoRecSeq<C extends GcdRingElem<C>> extends SolvableGroebnerBaseAbstract<GenPolynomial<C>>
GBAlgorithmBuilder,
GBFactory,
Serialized Form| Modifier and Type | Field and Description |
|---|---|
protected GenPolynomialRing<C> |
cofac
Coefficient ring factory.
|
protected GreatestCommonDivisorAbstract<C> |
engine
Greatest common divisor engine for coefficient content and primitive
parts.
|
protected SolvablePseudoReduction<GenPolynomial<C>> |
sred
Pseudo reduction engine.
|
protected SolvablePseudoReduction<C> |
sredRec
Pseudo reduction engine.
|
blas, cbb, red, strategy| Constructor and Description |
|---|
SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf)
Constructor.
|
SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf,
PairList<GenPolynomial<C>> pl)
Constructor.
|
SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf,
SolvablePseudoReduction<C> red)
Constructor.
|
SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf,
SolvablePseudoReduction<C> red,
PairList<GenPolynomial<C>> pl)
Constructor.
|
| Modifier and Type | Method and Description |
|---|---|
SolvableExtendedGB<GenPolynomial<C>> |
extLeftGB(int modv,
java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)
Solvable Extended Groebner base using critical pair class.
|
boolean |
isLeftGBidem(int modv,
java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)
Left Groebner base idempotence test.
|
boolean |
isLeftGBsimple(int modv,
java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)
Left Groebner base test.
|
boolean |
isTwosidedGB(int modv,
java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Fp)
Twosided Groebner base test.
|
java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> |
leftGB(int modv,
java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)
Left Groebner base using pairlist class.
|
java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> |
leftMinimalGB(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Gp)
Minimal ordered Solvable Groebner basis.
|
java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> |
twosidedGB(int modv,
java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Fp)
Twosided Solvable Groebner base using pairlist class.
|
cancel, commonZeroTest, constructUnivariate, constructUnivariate, extLeftGB, isLeftGB, isLeftGB, isLeftGB, isLeftGB, isLeftGB, isLeftReductionMatrix, isLeftReductionMatrix, isRightGB, isRightGB, isRightGB, isRightGBidem, isRightGBidem, isTwosidedGB, isTwosidedGB, isTwosidedGBidem, isTwosidedGBidem, leftGB, leftGB, normalizeZerosOnes, rightGB, rightGB, rightGB, rightMinimalGB, terminate, twosidedGB, twosidedGB, univariateDegreesprotected final GreatestCommonDivisorAbstract<C extends GcdRingElem<C>> engine
protected final SolvablePseudoReduction<C extends GcdRingElem<C>> sredRec
protected final SolvablePseudoReduction<GenPolynomial<C extends GcdRingElem<C>>> sred
protected final GenPolynomialRing<C extends GcdRingElem<C>> cofac
public SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf)
rf - coefficient ring factory.public SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)
rf - coefficient ring factory.pl - pair selection strategypublic SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, SolvablePseudoReduction<C> red)
rf - coefficient ring factory.red - pseudo reduction engine. Note: red must be an instance
of PseudoReductionSeq.public SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, SolvablePseudoReduction<C> red, PairList<GenPolynomial<C>> pl)
rf - coefficient ring factory.red - pseudo reduction engine. Note: red must be an instance
of PseudoReductionSeq.pl - pair selection strategypublic java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> leftGB(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)
modv - module variable number.F - polynomial list.public java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> leftMinimalGB(java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Gp)
leftMinimalGB in interface SolvableGroebnerBase<GenPolynomial<C extends GcdRingElem<C>>>leftMinimalGB in class SolvableGroebnerBaseAbstract<GenPolynomial<C extends GcdRingElem<C>>>Gp - a Solvable Groebner base.public java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> twosidedGB(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Fp)
modv - number of module variables.Fp - solvable polynomial list.public boolean isLeftGBsimple(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)
isLeftGBsimple in class SolvableGroebnerBaseAbstract<GenPolynomial<C extends GcdRingElem<C>>>modv - number of module variables.F - solvable polynomial list.public boolean isLeftGBidem(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)
isLeftGBidem in class SolvableGroebnerBaseAbstract<GenPolynomial<C extends GcdRingElem<C>>>modv - module variable number.F - solvable polynomial list.public boolean isTwosidedGB(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> Fp)
isTwosidedGB in interface SolvableGroebnerBase<GenPolynomial<C extends GcdRingElem<C>>>isTwosidedGB in class SolvableGroebnerBaseAbstract<GenPolynomial<C extends GcdRingElem<C>>>modv - number of module variables.Fp - solvable polynomial list.public SolvableExtendedGB<GenPolynomial<C>> extLeftGB(int modv, java.util.List<GenSolvablePolynomial<GenPolynomial<C>>> F)
extLeftGB in interface SolvableGroebnerBase<GenPolynomial<C extends GcdRingElem<C>>>extLeftGB in class SolvableGroebnerBaseAbstract<GenPolynomial<C extends GcdRingElem<C>>>modv - module variable number.F - solvable polynomial list.