On improving approximate results of Buchberger's algorithm by Newton's method

DOI10.1145/1089389.1089392zbMATH Open0563.12024OpenAlexW2080183299MaRDI QIDQ3676239FDOQ3676239

Wolfgang Trinks

Publication date: 1984

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1089389.1089392

Recommendations

• Improved Buchberger's algorithm
• On an installation of Buchberger's algorithm
• A subresultant-like theory for Buchberger's procedure
• On Buchberger's method of solving systems of algebraic equations
• Solving algebraic equations via Buchberger's algorithm

zbMATH Keywords

polynomial equationsBuchberger's algorithmconstructive Galois theoryp-adic splitting of polynomials

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Algorithms in computer science (68W99) Equations in general fields (12E12)

Cited In (11)

• An application of regular chain theory to the study of limit cycles
• Some examples for solving systems of algebraic equations by calculating Gröbner bases
• Certain orthogonal and symplectic groups as Galois groups over \(\mathbb{Q}\)
• Complexity results for triangular sets
• p-adic algorithm for bivariate Gröbner bases
• An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
• Realization of the Mathieu groups \(M_{11}\) and \(M_{12}\) as Galois groups over \({\mathbb Q})\).
• Detecting algebraic curves in bad position
• On radical zero-dimensional ideals
• Floating point Gröbner bases.
• A p-adic approach to the computation of Gröbner bases

This page was built for publication: On improving approximate results of Buchberger's algorithm by Newton's method

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