Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences
Jérémy Berthomieu, Brice Boyer, Jean‐Charles Faugère · 2015
Sakata generalized the Berlekamp--Massey algorithm to n dimensions in~1988. The Berlekamp--Massey--Sakata (BMS) algorithm can be used for finding a Grbner basis of a 0-dimensional ideal of relations verified by a table. We investigate this problem usingö linear algebra techniques, with motivations such as accelerating change of basis algorithms (FGLM) or improving their complexity.