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

Celý popis

Podrobná bibliografia

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