Faugère's F4 and F5 algorithms: Difference between revisions

Content deleted Content added
Added short description
Tags: Mobile edit Mobile app edit Android app edit App suggested edit App description add
Changing short description from "Algorithm for computing Gröbner bases" to "Algorithms for computing Gröbner bases"
 
Line 1:
{{Short description|AlgorithmAlgorithms for computing Gröbner bases}}
In [[computer algebra]], the '''Faugère F4 algorithm''', by [[Jean-Charles Faugère]], computes the [[Gröbner basis]] of an [[ideal (ring theory)|ideal]] of a multivariate [[polynomial ring]]. The algorithm uses the same mathematical principles as the [[Buchberger algorithm]], but computes many normal forms in one go by forming a generally [[sparse matrix]] and using fast linear algebra to do the reductions in parallel.