Fast Computation of the $N$-th Term of a $q$-Holonomic Sequence and Applications

Abstract

In 1977, Strassen invented a famous baby-step/giant-step algorithm that computes the factorial $N!$ in arithmetic complexity quasi-linear in $\sqrt{N}$. In 1988, the Chudnovsky brothers generalized Strassen's algorithm to the computation of the $N$-th term of any holonomic sequence in essentially the same arithmetic complexity. We design $q$-analogues of these algorithms. We first extend Strassen's algorithm to the computation of the $q$-factorial of $N$, then Chudnovskys' algorithm to the computation of the $N$-th term of any $q$-holonomic sequence. Both algorithms work in arithmetic complexity quasi-linear in $\sqrt{N}$; surprisingly, they are simpler than their analogues in the holonomic case. We provide a detailed cost analysis, in both arithmetic and bit complexity models. Moreover, we describe various algorithmic consequences, including the acceleration of polynomial and rational solving of linear $q$-differential equations, and the fast evaluation of large classes of polynomials, including a family recently considered by Nogneng and Schost.

References in corpus (6)

• A fast algorithm for computing the characteristic polynomial of the p-curvature
• Automatic Classification of Restricted Lattice Walks
• A Fast Algorithm for Computing the p-Curvature
• Low Complexity Algorithms for Linear Recurrences
• Congruences modulo cyclotomic polynomials and algebraic independence for $q$-series
• A Simple and Fast Algorithm for Computing the $N$-th Term of a Linearly Recurrent Sequence