Top
Back: Conti and Traverso
Forward: Hosten and Sturmfels
FastBack: Gauss-Manin connection
FastForward: Buchberger algorithm
Up: Algorithms
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

C.6.2.2 The algorithm of Pottier

The algorithm of Pottier (see [Pot94]) starts by computing a lattice basis 585#585 for the integer kernel of 190#190using the LLL-algorithm ( system). The ideal corresponding to the lattice basis vectors

764#764
is saturated – as in the algorithm of Conti and Traverso – by inversion of all variables: One adds an auxiliary variable 501#501 and the generator 765#765 to obtain an ideal 761#761 in 766#766 from which one computes 750#750 by elimination of 501#501.


Top Back: Conti and Traverso Forward: Hosten and Sturmfels FastBack: Gauss-Manin connection FastForward: Buchberger algorithm Up: Algorithms Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 4.3.2, 2023, generated by texi2html.