|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectedu.jas.gb.SolvableGroebnerBaseAbstract<C>
edu.jas.gb.SolvableGroebnerBaseSeq<C>
C - coefficient typepublic class SolvableGroebnerBaseSeq<C extends RingElem<C>>
Solvable Groebner bases sequential algorithms. Implements common left, right and twosided Groebner bases and left, right and twosided GB tests.
| Field Summary |
|---|
| Fields inherited from class edu.jas.gb.SolvableGroebnerBaseAbstract |
|---|
blas, red, sred, strategy |
| Constructor Summary | |
|---|---|
SolvableGroebnerBaseSeq()
Constructor. |
|
SolvableGroebnerBaseSeq(SolvableReduction<C> sred,
PairList<C> pl)
Constructor. |
|
| Method Summary | |
|---|---|
SolvableExtendedGB<C> |
extLeftGB(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Solvable Extended Groebner base using critical pair class. |
boolean |
isLeftReductionMatrix(SolvableExtendedGB<C> exgb)
Test if M is a left reduction matrix. |
java.util.List<GenSolvablePolynomial<C>> |
leftGB(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
Left Groebner base using pairlist class. |
SolvableExtendedGB<C> |
minimalSolvableExtendedGB(int flen,
java.util.List<GenSolvablePolynomial<C>> Gp,
java.util.List<java.util.List<GenSolvablePolynomial<C>>> M)
Minimal solvable extended groebner basis. |
java.util.List<java.util.List<GenSolvablePolynomial<C>>> |
normalizeMatrix(int flen,
java.util.List<java.util.List<GenSolvablePolynomial<C>>> M)
Normalize M. |
java.util.List<GenSolvablePolynomial<C>> |
twosidedGB(int modv,
java.util.List<GenSolvablePolynomial<C>> Fp)
Twosided Groebner base using pairlist class. |
| Methods inherited from class edu.jas.gb.SolvableGroebnerBaseAbstract |
|---|
extLeftGB, isLeftGB, isLeftGB, isLeftReductionMatrix, isRightGB, isRightGB, isTwosidedGB, isTwosidedGB, leftGB, leftMinimalGB, rightGB, rightGB, twosidedGB |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public SolvableGroebnerBaseSeq()
public SolvableGroebnerBaseSeq(SolvableReduction<C> sred,
PairList<C> pl)
sred - Solvable reduction enginepl - pair selection strategy| Method Detail |
|---|
public java.util.List<GenSolvablePolynomial<C>> leftGB(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
modv - number of module variables.F - solvable polynomial list.
public SolvableExtendedGB<C> extLeftGB(int modv,
java.util.List<GenSolvablePolynomial<C>> F)
modv - module variable number.F - solvable polynomial list.
public java.util.List<GenSolvablePolynomial<C>> twosidedGB(int modv,
java.util.List<GenSolvablePolynomial<C>> Fp)
modv - number of module variables.Fp - solvable polynomial list.
public java.util.List<java.util.List<GenSolvablePolynomial<C>>> normalizeMatrix(int flen,
java.util.List<java.util.List<GenSolvablePolynomial<C>>> M)
M - a reduction matrix.
public boolean isLeftReductionMatrix(SolvableExtendedGB<C> exgb)
isLeftReductionMatrix in interface SolvableGroebnerBase<C extends RingElem<C>>isLeftReductionMatrix in class SolvableGroebnerBaseAbstract<C extends RingElem<C>>exgb - an SolvableExtendedGB container.
public SolvableExtendedGB<C> minimalSolvableExtendedGB(int flen,
java.util.List<GenSolvablePolynomial<C>> Gp,
java.util.List<java.util.List<GenSolvablePolynomial<C>>> M)
Gp - a left Groebner base.M - a left reduction matrix, is modified.
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||