Top
Back: C.6.2.4 The algorithm of Di Biase and Urbanke
Forward: C.6.3 The Buchberger algorithm for toric ideals
FastBack: C. Mathematical background
FastForward: D. SINGULAR libraries
Up: C.6.2 Algorithms
Top: Singular 2-0-4 Manual
Contents: Table of Contents
Index: F. Index
About: About This Document

C.6.2.5 The algorithm of Bigatti, La Scala and Robbiano

The algorithm of Bigatti, La Scala and Robbiano (see [BLR98]) combines the ideas of the algorithms of Pottier and of Hosten and Sturmfels. The computations are performed on a graded ideal with one auxiliary variable $u$ and one supplementary generator $x_1\cdot\ldots\cdot x_n - u$ (instead of the generator $t\cdot x_1\cdot\ldots\cdot x_n -1$ in the algorithm of Pottier). The algorithm uses a quite unusual technique to get rid of the variable $u$ again.

There is another algorithm of the authors which tries to parallelize the computations (but which is not implemented in this library).

Top Back: C.6.2.4 The algorithm of Di Biase and Urbanke Forward: C.6.3 The Buchberger algorithm for toric ideals FastBack: C. Mathematical background FastForward: D. SINGULAR libraries Up: C.6.2 Algorithms 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.