Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences

The so-called Berlekamp–Massey–Sakata algorithm computes a Gröbner basis of a 0-dimensional ideal of relations satisfied by an input table. It extends the Berlekamp–Massey algorithm to n-dimensional tables, for n>1. We investigate this problem and design several algorithms for computing such a Gr...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of symbolic computation Vol. 83; no. Supplement C; pp. 36 - 67
Main Authors:	Berthomieu, Jérémy, Boyer, Brice, Faugère, Jean-Charles
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.11.2017 Elsevier
Subjects:	0-dimensional ideal Computer Science Gröbner basis computation Multidimensional linear recursive sequence Symbolic Computation The BMS algorithm The FGLM algorithm Multidimensional linear recursive sequence The FGLM algorithm The BMS algorithm Gröbner basis computation 0-dimensional ideal FGLM algorithm Berlekamp - Massey - Sakata algorithm multidimensional linear recurrent sequence 0$-dimensional ideal
ISSN:	0747-7171, 1095-855X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!