Content deleted Content added
Citation bot (talk | contribs) Add: s2cid, title. Changed bare reference to CS1/2. | Use this bot. Report bugs. | Suggested by BrownHairedGirl | Linked from User:BrownHairedGirl/Articles_with_bare_links | #UCB_webform_linked 12/2197 |
Changing short description from "Algorithm for computing Gröbner bases" to "Algorithms for computing Gröbner bases" |
||
| (3 intermediate revisions by 3 users not shown) | |||
Line 1:
{{Short description|Algorithms 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.
Line 49 ⟶ 50:
| last = Faugère
| first = J.-C.
|
▲ | journal = Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation (ISSAC)
| publisher = ACM Press
| date = July 2002
Line 64 ⟶ 65:
==External links==
* [http://www-polsys.lip6.fr/~jcf/ Faugère's home page] (includes pdf reprints of additional papers)
* [
{{DEFAULTSORT:Faugere's F4 and F5 algorithms}}
| |||