Pivoting in extended rings for computing approximate Gröbner bases

DOI10.1007/S11786-011-0089-YMaRDI QIDQ691644zbMATHOpenAlexFDO

Authors Jean-Charles Faugère, Ye Liang

Publication date 3 December 2012

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-011-0089-y

zbMATH Keywords

monomial basis\(F_5\) algorithmartificial discontinuityapproximate Gröbner basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Recommendations

• Efficient Gröbner bases computation over principal ideal rings
• Gröbner bases and generalized Padé approximation
• A generalization of Gröbner basis algorithms to polycyclic group rings
• A new framework for computing Gröbner bases
• A p-adic approach to the computation of Gröbner bases
• An efficient method for computing comprehensive Gröbner bases
• p-adic algorithm for bivariate Gröbner bases
• scientific article; zbMATH DE number 3899033
• Computing a structured Gröbner basis approximately
• Applying Buchberger's criteria for computing Gröbner bases over finite-chain rings

Cites work

• scientific article; zbMATH DE number 3876580 (Why is no real title available?)
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 4076472 (Why is no real title available?)
• scientific article; zbMATH DE number 1253973 (Why is no real title available?)
• scientific article; zbMATH DE number 503184 (Why is no real title available?)
• scientific article; zbMATH DE number 1504686 (Why is no real title available?)
• scientific article; zbMATH DE number 2151203 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 2151244 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• A practical method for floating-point Gröbner basis computation
• An algebraist's view on border bases
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Artificial discontinuities of single-parametric Gröbner bases
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Characterizations of border bases
• Computer Algebra and Geometric Algebra with Applications
• Computing border bases
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Finding at least one point in each connected component of a real algebraic set defined by a single equation
• Floating point Gröbner bases.
• Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
• Generalized normal forms and polynomial system solving
• Numerical Polynomial Algebra
• Remarks on automatic algorithm stabilization
• Solving zero-dimensional systems through the rational univariate representation
• Stable border bases for ideals of points
• Term cancellations in computing floating-point Gröbner bases

Cited in

(2)

• Extending the GVW Algorithm to Local Ring
• Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs

Describes a project that uses

Uses Software

• FGb
• ISOLATE

This page was built for publication: Pivoting in extended rings for computing approximate Gröbner bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691644)