4 Monomials

In ginv the following monomial orders have been implemented:

Degree compatible orders:
"TopDegRevLex", "DegRevLex"
Orders with vectorization of computations:
"TopDegRevLexByte", "DegRevLexByte"

Note: Manipulations with the machine word are the fastest ones for a processor. Vectorization allows to place several exponents in the machine word (for C compilers it is type unsigned int). Thereby, some operations over monomials are accelerated several times, and the memory consumed is also decreased. This makes sense when the exponents are accordingly bounded, and it is advisable for degree compatible orders.

For vectorization it is necessary to know where in a given computer the sign bit is located: in the beginning or in the end of the machine word. This is defined by the C macros WORDS_BIGENDIAN or WORDS_LITTLEENDIAN. If they are not specified, then all vectorization does is the memory optimization.

Ordesr which are not degree compatible:
"TopLex", "TopElim", "PotLex", "PotDegRevLex", "PosElim", "Lex", "Elim"



Subsections