Pivoting in extended rings for computing approximate Gröbner bases

DOI10.1007/S11786-011-0089-YzbMATH Open1252.68356OpenAlexW2042569450MaRDI QIDQ691644FDOQ691644

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

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

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)

Cites Work

• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Title not available (Why is that?)
• Solving zero-dimensional systems through the rational univariate representation
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Numerical Polynomial Algebra
• Generalized normal forms and polynomial system solving
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding at least one point in each connected component of a real algebraic set defined by a single equation
• Characterizations of border bases
• An algebraist's view on border bases
• Computing border bases
• Stable border bases for ideals of points
• Title not available (Why is that?)
• Floating point Gröbner bases.
• Term cancellations in computing floating-point Gröbner bases
• Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Artificial discontinuities of single-parametric Gröbner bases
• Title not available (Why is that?)
• Remarks on automatic algorithm stabilization
• A practical method for floating-point Gröbner basis computation
• Computer Algebra and Geometric Algebra with Applications

Cited In (3)

• Extending the GVW Algorithm to Local Ring
• Matrix-F5 algorithms and tropical Gröbner bases computation
• Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs

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)