The Faugère F4 algorithm, devised by the mathematician Jean-Charles Faugère, computes the Groebner basis of an ideal of a multivariate polynomial ring. It uses the same mathematical principles as the Buchberger algorithm but computes many normal forms at once by forming a generally sparse matrix and using fast linear algebra to perform the reductions in parallel. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Connections
In Field
Source Wikipedia: Faugère's F4 and F5 algorithms
Sources
Wikipedia: Faugère's F4 and F5 algorithms
Lead section
In computer algebra, the Faugère F4 algorithm, by Jean-Charles Faugère, computes the Gröbner basis of an ideal of a multivariate polynomial ring.
In Field: Computer Algebra, Lead sentence
Faugère F4 algorithm, by Jean-Charles Faugère, computes the Gröbner basis of an ideal of a multivariate polynomial ring.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.