A fast algorithm for solving linearly recurrent sequences

DOI10.1145/3313880.3313894zbMath1439.39001arXiv1806.03554OpenAlexW2963324215MaRDI QIDQ4630320

Catherine st-Pierre, Seung Gyu Hyun, Stephen Melczer

Publication date: 29 March 2019

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.03554

zbMATH Keywords

annihilating polynomiallinear recurrence relation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonnumerical algorithms (68W05) Linear difference equations (39A06)

This page was built for publication: A fast algorithm for solving linearly recurrent sequences