Linear algebra is introduced by Faugère in F4 to speed up the reduction procedure during Gröbner basis computations. Linear algebra has also been used in fast implementations of F5 and other signature-based Gröbner basis algorithms. To use linear algebra for reductions, an important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function...
