Polynomial-division-based algorithms for computing linear recurrence relations

Sparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra. They come down to computing linear recurrence relations of a sequence with the Berlekamp–Massey algorithm. Likewise, sparse multivariate polynomial interpola...

Full description

Bibliographic Details

Published in:	Journal of symbolic computation Vol. 109; pp. 1 - 30
Main Authors:	Berthomieu, Jérémy, Faugère, Jean-Charles
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.03.2022 Elsevier
Subjects:	Berlekamp–Massey–Sakata Computer Science Extended Euclidean algorithm Gröbner bases Linear recursive sequences Padé approximants Symbolic Computation Gröbner bases Linear recursive sequences Padé approximants Extended Euclidean algorithm Berlekamp–Massey–Sakata Berlekamp-Massey-Sakata extended Euclidean algorithm
ISSN:	0747-7171, 1095-855X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!