Top
Back: C.6.2.1 The algorithm of Conti and Traverso
Forward: C.6.2.3 The algorithm of Hosten and Sturmfels
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.2 The algorithm of Pottier

The algorithm of Pottier (see [Pot94]) starts by computing a lattice basis $v_1, \ldots, v_r$ for the integer kernel of $A$ using the LLL-algorithm. The ideal corresponding to the lattice basis vectors

\begin{displaymath}I_1=<x^{v_i^+}-x^{v_i^-}\vert i=1,\ldots,r> \end{displaymath}

is saturated - as in the algorithm of Conti and Traverso - by inversion of all variables: One adds an auxiliary variable $t$ and the generator $t\cdot x_1\cdot\ldots\cdot x_n -1$ to obtain an ideal $I_2$ in $K[t,x_1,\ldots,x_n]$ from which one computes $I_A$ by elimination of $t$.

Top Back: C.6.2.1 The algorithm of Conti and Traverso Forward: C.6.2.3 The algorithm of Hosten and Sturmfels 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.