C
- coefficient typepublic abstract class SolvableGroebnerBaseAbstract<C extends RingElem<C>> extends java.lang.Object implements SolvableGroebnerBase<C>
Modifier and Type | Field and Description |
---|---|
protected BasicLinAlg<GenPolynomial<C>> |
blas
Linear algebra engine.
|
GroebnerBaseAbstract<C> |
cbb
Commutative Groebner bases engine.
|
Reduction<C> |
red
Reduction engine.
|
SolvableReduction<C> |
sred
Solvable reduction engine.
|
PairList<C> |
strategy
Strategy for pair selection.
|
Constructor and Description |
---|
SolvableGroebnerBaseAbstract()
Constructor.
|
SolvableGroebnerBaseAbstract(PairList<C> pl)
Constructor.
|
SolvableGroebnerBaseAbstract(SolvableReduction<C> sred)
Constructor.
|
SolvableGroebnerBaseAbstract(SolvableReduction<C> sred,
PairList<C> pl)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
int |
cancel()
Cancel ThreadPool.
|
int |
commonZeroTest(java.util.List<GenSolvablePolynomial<C>> A)
Ideal common zero test.
|
GenSolvablePolynomial<C> |
constructUnivariate(int i,
java.util.List<GenSolvablePolynomial<C>> G)
Construct univariate solvable polynomial of minimal degree in variable i
of a zero dimensional ideal(G).
|
java.util.List<GenSolvablePolynomial<C>> |
constructUnivariate(java.util.List<GenSolvablePolynomial<C>> G)
Construct univariate solvable polynomials of minimal degree in all
variables in zero dimensional left ideal(G).
|
SolvableExtendedGB<C> |
extLeftGB(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Solvable Extended Groebner base using critical pair class.
|
SolvableExtendedGB<C> |
extLeftGB(java.util.List<GenSolvablePolynomial<C>> F)
Solvable Extended Groebner base using critical pair class.
|
boolean |
isLeftGB(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Left Groebner base test.
|
boolean |
isLeftGB(int modv,
java.util.List<GenSolvablePolynomial<C>> F,
boolean b)
Left Groebner base test.
|
boolean |
isLeftGB(java.util.List<GenSolvablePolynomial<C>> F)
Left Groebner base test.
|
boolean |
isLeftGB(java.util.List<GenSolvablePolynomial<C>> F,
boolean b)
Left Groebner base test.
|
boolean |
isLeftGB(ModuleList<C> M)
Module left Groebner base test.
|
boolean |
isLeftGB(ModuleList<C> M,
boolean top)
Module left Groebner base test.
|
boolean |
isLeftGBidem(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Left Groebner base idempotence test.
|
boolean |
isLeftGBsimple(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Left Groebner base test.
|
boolean |
isLeftReductionMatrix(java.util.List<GenSolvablePolynomial<C>> F,
java.util.List<GenSolvablePolynomial<C>> G,
java.util.List<java.util.List<GenSolvablePolynomial<C>>> Mf,
java.util.List<java.util.List<GenSolvablePolynomial<C>>> Mg)
Test if left reduction matrix.
|
boolean |
isLeftReductionMatrix(SolvableExtendedGB<C> exgb)
Test if left reduction matrix.
|
boolean |
isRightGB(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Right Groebner base test.
|
boolean |
isRightGB(java.util.List<GenSolvablePolynomial<C>> F)
Right Groebner base test.
|
boolean |
isRightGB(ModuleList<C> M)
Module right Groebner base test.
|
boolean |
isRightGB(ModuleList<C> M,
boolean top)
Module right Groebner base test.
|
boolean |
isRightGBidem(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Right Groebner base idempotence test.
|
boolean |
isRightGBidem(java.util.List<GenSolvablePolynomial<C>> F)
Right Groebner base idempotence test.
|
boolean |
isTwosidedGB(int modv,
java.util.List<GenSolvablePolynomial<C>> Fp)
Twosided Groebner base test.
|
boolean |
isTwosidedGB(java.util.List<GenSolvablePolynomial<C>> Fp)
Twosided Groebner base test.
|
boolean |
isTwosidedGB(ModuleList<C> M)
Module twosided Groebner base test.
|
boolean |
isTwosidedGB(ModuleList<C> M,
boolean top)
Module twosided Groebner base test.
|
boolean |
isTwosidedGBidem(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Twosided Groebner base idempotence test.
|
boolean |
isTwosidedGBidem(java.util.List<GenSolvablePolynomial<C>> F)
Twosided Groebner base idempotence test.
|
java.util.List<GenSolvablePolynomial<C>> |
leftGB(java.util.List<GenSolvablePolynomial<C>> F)
Left Groebner base using pairlist class.
|
ModuleList<C> |
leftGB(ModuleList<C> M)
Left Groebner base using pairlist class.
|
ModuleList<C> |
leftGB(ModuleList<C> M,
boolean top)
Left Groebner base using pairlist class.
|
java.util.List<GenSolvablePolynomial<C>> |
leftMinimalGB(java.util.List<GenSolvablePolynomial<C>> Gp)
Left minimal ordered groebner basis.
|
java.util.List<GenSolvablePolynomial<C>> |
normalizeZerosOnes(java.util.List<GenSolvablePolynomial<C>> A)
Normalize polynomial list.
|
java.util.List<GenSolvablePolynomial<C>> |
rightGB(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Right Groebner base using opposite ring left GB.
|
java.util.List<GenSolvablePolynomial<C>> |
rightGB(java.util.List<GenSolvablePolynomial<C>> F)
Right Groebner base using opposite ring left GB.
|
ModuleList<C> |
rightGB(ModuleList<C> M)
Right Groebner base using pairlist class.
|
java.util.List<GenSolvablePolynomial<C>> |
rightMinimalGB(java.util.List<GenSolvablePolynomial<C>> Gp)
Right minimal ordered groebner basis.
|
void |
terminate()
Cleanup and terminate ThreadPool.
|
java.util.List<GenSolvablePolynomial<C>> |
twosidedGB(java.util.List<GenSolvablePolynomial<C>> Fp)
Twosided Groebner base using pairlist class.
|
ModuleList<C> |
twosidedGB(ModuleList<C> M)
Twosided Groebner base using pairlist class.
|
ModuleList<C> |
twosidedGB(ModuleList<C> M,
boolean top)
Twosided Groebner base using pairlist class.
|
java.util.List<java.lang.Long> |
univariateDegrees(java.util.List<GenSolvablePolynomial<C>> A)
Univariate head term degrees.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
leftGB, twosidedGB
public SolvableReduction<C extends RingElem<C>> sred
protected final BasicLinAlg<GenPolynomial<C extends RingElem<C>>> blas
public final GroebnerBaseAbstract<C extends RingElem<C>> cbb
public SolvableGroebnerBaseAbstract()
public SolvableGroebnerBaseAbstract(SolvableReduction<C> sred)
sred
- Solvable reduction enginepublic SolvableGroebnerBaseAbstract(PairList<C> pl)
pl
- pair selection strategypublic SolvableGroebnerBaseAbstract(SolvableReduction<C> sred, PairList<C> pl)
sred
- Solvable reduction enginepl
- pair selection strategypublic java.util.List<GenSolvablePolynomial<C>> normalizeZerosOnes(java.util.List<GenSolvablePolynomial<C>> A)
A
- list of polynomials.public boolean isLeftGB(java.util.List<GenSolvablePolynomial<C>> F)
isLeftGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
F
- solvable polynomial list.public boolean isLeftGB(java.util.List<GenSolvablePolynomial<C>> F, boolean b)
F
- solvable polynomial list.b
- true for simple test, false for GB test.public boolean isLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)
isLeftGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
modv
- module variable number.F
- solvable polynomial list.public boolean isLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F, boolean b)
modv
- module variable number.F
- solvable polynomial list.b
- true for simple test, false for GB test.public boolean isLeftGBsimple(int modv, java.util.List<GenSolvablePolynomial<C>> F)
modv
- number of module variables.F
- solvable polynomial list.public boolean isLeftGBidem(int modv, java.util.List<GenSolvablePolynomial<C>> F)
modv
- module variable number.F
- solvable polynomial list.public boolean isTwosidedGB(java.util.List<GenSolvablePolynomial<C>> Fp)
isTwosidedGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
Fp
- solvable polynomial list.public boolean isTwosidedGB(int modv, java.util.List<GenSolvablePolynomial<C>> Fp)
isTwosidedGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
modv
- number of module variables.Fp
- solvable polynomial list.public boolean isTwosidedGBidem(java.util.List<GenSolvablePolynomial<C>> F)
F
- solvable polynomial list.public boolean isTwosidedGBidem(int modv, java.util.List<GenSolvablePolynomial<C>> F)
modv
- module variable number.F
- solvable polynomial list.public boolean isRightGB(java.util.List<GenSolvablePolynomial<C>> F)
isRightGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
F
- solvable polynomial list.public boolean isRightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)
isRightGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
modv
- number of module variables.F
- solvable polynomial list.public boolean isRightGBidem(java.util.List<GenSolvablePolynomial<C>> F)
F
- solvable polynomial list.public boolean isRightGBidem(int modv, java.util.List<GenSolvablePolynomial<C>> F)
modv
- module variable number.F
- solvable polynomial list.public java.util.List<GenSolvablePolynomial<C>> leftGB(java.util.List<GenSolvablePolynomial<C>> F)
leftGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
F
- solvable polynomial list.public SolvableExtendedGB<C> extLeftGB(java.util.List<GenSolvablePolynomial<C>> F)
extLeftGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
F
- solvable polynomial list.public SolvableExtendedGB<C> extLeftGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)
extLeftGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
modv
- module variable number.F
- polynomial list.public java.util.List<GenSolvablePolynomial<C>> leftMinimalGB(java.util.List<GenSolvablePolynomial<C>> Gp)
leftMinimalGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
Gp
- a left Groebner base.public java.util.List<GenSolvablePolynomial<C>> rightMinimalGB(java.util.List<GenSolvablePolynomial<C>> Gp)
Gp
- a right Groebner base.public java.util.List<GenSolvablePolynomial<C>> twosidedGB(java.util.List<GenSolvablePolynomial<C>> Fp)
twosidedGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
Fp
- solvable polynomial list.public java.util.List<GenSolvablePolynomial<C>> rightGB(java.util.List<GenSolvablePolynomial<C>> F)
rightGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
F
- solvable polynomial list.public java.util.List<GenSolvablePolynomial<C>> rightGB(int modv, java.util.List<GenSolvablePolynomial<C>> F)
rightGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
modv
- number of module variables.F
- solvable polynomial list.public boolean isLeftGB(ModuleList<C> M)
isLeftGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
M
- a module basis.public boolean isLeftGB(ModuleList<C> M, boolean top)
M
- a module basis.top
- true for TOP term order, false for POT term order.public ModuleList<C> leftGB(ModuleList<C> M)
leftGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
M
- a module basis.public ModuleList<C> leftGB(ModuleList<C> M, boolean top)
M
- a module basis.top
- true for TOP term order, false for POT term order.public boolean isTwosidedGB(ModuleList<C> M)
isTwosidedGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
M
- a module basis.public boolean isTwosidedGB(ModuleList<C> M, boolean top)
M
- a module basis.top
- true for TOP term order, false for POT term order.public ModuleList<C> twosidedGB(ModuleList<C> M)
twosidedGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
M
- a module basis.public ModuleList<C> twosidedGB(ModuleList<C> M, boolean top)
M
- a module basis.top
- true for TOP term order, false for POT term order.public boolean isRightGB(ModuleList<C> M)
isRightGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
M
- a module basis.public boolean isRightGB(ModuleList<C> M, boolean top)
M
- a module basis.top
- true for TOP term order, false for POT term order.public ModuleList<C> rightGB(ModuleList<C> M)
rightGB
in interface SolvableGroebnerBase<C extends RingElem<C>>
M
- a module basis.public boolean isLeftReductionMatrix(SolvableExtendedGB<C> exgb)
isLeftReductionMatrix
in interface SolvableGroebnerBase<C extends RingElem<C>>
exgb
- an SolvableExtendedGB container.public boolean isLeftReductionMatrix(java.util.List<GenSolvablePolynomial<C>> F, java.util.List<GenSolvablePolynomial<C>> G, java.util.List<java.util.List<GenSolvablePolynomial<C>>> Mf, java.util.List<java.util.List<GenSolvablePolynomial<C>>> Mg)
isLeftReductionMatrix
in interface SolvableGroebnerBase<C extends RingElem<C>>
F
- a solvable polynomial list.G
- a left Groebner base.Mf
- a possible left reduction matrix.Mg
- a possible left reduction matrix.public int commonZeroTest(java.util.List<GenSolvablePolynomial<C>> A)
public java.util.List<java.lang.Long> univariateDegrees(java.util.List<GenSolvablePolynomial<C>> A)
A
- list of solvable polynomials.public GenSolvablePolynomial<C> constructUnivariate(int i, java.util.List<GenSolvablePolynomial<C>> G)
i
- variable index.G
- list of solvable polynomials, a monic reduced left Gröbner
base of a zero dimensional ideal.public java.util.List<GenSolvablePolynomial<C>> constructUnivariate(java.util.List<GenSolvablePolynomial<C>> G)
public void terminate()
public int cancel()