Pivoting in extended rings for computing approximate Gröbner bases
type: Item
instance of: scholarly article
title: Pivoting in extended rings for computing approximate Gröbner bases
zbMATH Open document ID: 1252.68356
author: Jean-Charles Faugère
author: Ye Liang
published in: Mathematics in Computer Science
publication date: 2012-12-03T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 13P10
zbMATH DE Number: 6112128
zbMATH Keywords: approximate Gröbner basis
zbMATH Keywords: artificial discontinuity
zbMATH Keywords: monomial basis
zbMATH Keywords: \(F_5\) algorithm
describes a project that uses: FGb
describes a project that uses: ISOLATE
MaRDI profile type: Publication
full work available at URL: s11786-011-0089-y
OpenAlex ID: W2042569450
cites work: Stable border bases for ideals of points
cites work: Q3806684
cites work: Q4693774
cites work: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
cites work: Q3714165
cites work: 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
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: Q4660688
cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering
cites work: Artificial discontinuities of single-parametric Gröbner bases
cites work: Characterizations of border bases
cites work: Computing border bases
cites work: Q5505187
cites work: Q4279505
cites work: Q3341887
cites work: Q4502650
cites work: Generalized normal forms and polynomial system solving
cites work: Computer Algebra and Geometric Algebra with Applications
cites work: Q4660670
cites work: Solving zero-dimensional systems through the rational univariate representation
cites work: Finding at least one point in each connected component of a real algebraic set defined by a single equation
cites work: Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
cites work: Q5188244
cites work: Term Cancellations in Computing Floating-Point Gröbner Bases
cites work: Floating point Gröbner bases.
cites work: Remarks on automatic algorithm stabilization
cites work: Q4226949
cites work: Numerical Polynomial Algebra
cites work: Q4660714
DOI: 10.1007/S11786-011-0089-Y
Recommended article: Efficient Gröbner bases computation over principal ideal rings
Recommended article: Gröbner bases and generalized Padé approximation
Recommended article: A generalization of Gröbner basis algorithms to polycyclic group rings
Recommended article: A new framework for computing Gröbner bases
Recommended article: A p-adic approach to the computation of Gröbner bases
Recommended article: An efficient method for computing comprehensive Gröbner bases
Recommended article: p-adic algorithm for bivariate Gröbner bases
Recommended article: Q3677849
Recommended article: Computing a structured Gröbner basis approximately
Recommended article: Applying Buchberger's criteria for computing Gröbner bases over finite-chain rings
description: scientific article; zbMATH DE number 6112128