Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

An Implementation of Faugère's F4 Algorithm for Computing Gröbner Bases

Cabarcas, Daniel

Abstract Details

2010, MS, University of Cincinnati, Engineering : Computer Science.
Gröbner Bases are an important tool for analyzing systems of polynomial equations. They allow the system of equations to be solved exactly and therefore have gained popularity in many areas of science and technology. However, finding Gröbner Bases is a computationally intensive task, thus, several algorithms have been developed for this goal. Faugère invented an elaborate algorithm to compute Gröbner Bases in 1999 called F4, which has become a benchmark due to its efficiency. We have implemented F4 from scratch in C++. In this thesis we revisit the theoretical foundation of the algorithm, provide details of our implementation, and compare it with other software that computes Gröbner Bases.
John Franco, PhD (Committee Chair)
Dieter Schmidt, PhD (Committee Member)
Jintai Ding, PhD (Committee Member)
George Purdy, PhD (Committee Member)
78 p.

Recommended Citations

Citations

  • Cabarcas, D. (2010). An Implementation of Faugère's F4 Algorithm for Computing Gröbner Bases [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1277120935

    APA Style (7th edition)

  • Cabarcas, Daniel. An Implementation of Faugère's F4 Algorithm for Computing Gröbner Bases. 2010. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1277120935.

    MLA Style (8th edition)

  • Cabarcas, Daniel. "An Implementation of Faugère's F4 Algorithm for Computing Gröbner Bases." Master's thesis, University of Cincinnati, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1277120935

    Chicago Manual of Style (17th edition)