Top
Back: B.2 Monomial orderings
Forward: B.2.2 General definitions for orderings
FastBack: B. Polynomial data
FastForward: C. Mathematical background
Up: B.2 Monomial orderings
Top: Singular 2-0-4 Manual
Contents: Table of Contents
Index: F. Index
About: About This Document

B.2.1 Introduction to orderings

SINGULAR offers a great variety of monomial orderings which provide an enormous functionality, if used diligently. However, this flexibility might also be confusing for the novice user. Therefore, we recommend to those not familiar with monomial orderings to generally use the ordering dp for computations in the polynomial ring $K[x_1,\ldots,x_n]$, resp. ds for computations in the localization $\hbox{Loc}_{(x)}K[x_1,\ldots,x_n]$.

For inhomogeneous input ideals, standard (resp. groebner) bases computations are generally faster with the orderings $\hbox{Wp}(w_1, \ldots, w_n)$ (resp. $\hbox{Ws}(w_1, \ldots, w_n)$) if the input is quasihomogeneous w.r.t. the weights $w_1$, $\ldots$, $w_n$ of $x_1$, $\ldots$, $x_n$.

If the output needs to be "triangular" (resp. "block-triangular"), the lexicographical ordering lp (resp. lexicographical block-orderings) need to be used. However, these orderings usually result in much less efficient computations.

Top Back: B.2 Monomial orderings Forward: B.2.2 General definitions for orderings FastBack: B. Polynomial data FastForward: C. Mathematical background Up: B.2 Monomial orderings Top: Singular 2-0-4 Manual Contents: Table of Contents Index: F. Index About: About This Document
            User manual for Singular version 2-0-4, October 2002, generated by texi2html.