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 587#587 for the integer kernel of 191#191using the LLL-algorithm ( system). The ideal corresponding to the lattice basis vectors

766#766
is saturated – as in the algorithm of Conti and Traverso – by inversion of all variables: One adds an auxiliary variable 503#503 and the generator 767#767 to obtain an ideal 763#763 in 768#768 from which one computes 752#752 by elimination of 503#503.


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.4.1, 2025, generated by texi2html.