A fast algorithm for solving linearly recurrent sequences

06/09/2018
by   Seung Gyu Hyun, et al.
0

We present an algorithm which computes the D^th term of a sequence satisfying a linear recurrence relation of order d over a field K in O( M(d̅)log(D) + M(d)log(d)) operations in K, where d̅≤ d is the degree of the squarefree part of the annihilating polynomial of the recurrence and M is the cost of polynomial multiplication in K. This is a refinement of the previously optimal result of O( M(d)log(D) ) operations, due to Fiduccia.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2017

Faster integer and polynomial multiplication using cyclotomic coefficient rings

We present an algorithm that computes the product of two n-bit integers ...
research
08/20/2020

A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence

We present a simple and fast algorithm for computing the N-th term of a ...
research
07/25/2018

Toward an Optimal Quantum Algorithm for Polynomial Factorization over Finite Fields

We present a randomized quantum algorithm for polynomial factorization o...
research
11/17/2019

Faster Integer Multiplication Using Preprocessing

A New Number Theoretic Transform(NTT), which is a form of FFT, is introd...
research
10/25/2018

Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus

We present a probabilistic Las Vegas algorithm for computing the local z...
research
11/21/2022

The Berlekamp-Massey Algorithm revisited

We propose a slight modification of the Berlekamp-Massey Algorithm for o...
research
10/29/2021

Computing Lewis Weights to High Precision

We present an algorithm for computing approximate ℓ_p Lewis weights to h...

Please sign up or login with your details

Forgot password? Click here to reset