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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of symbolic computation Ročník 83; číslo Supplement C; s. 36 - 67
Hlavní autori:	Berthomieu, Jérémy, Boyer, Brice, Faugère, Jean-Charles
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.11.2017 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!