Effective bounds for P-recursive sequences

We describe an algorithm that takes as input a complex sequence (un) given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound (vn) such that |un|≤vn for all n. Generically, the bound is tight, in the sense that its asymptotic behaviour matches that of un. We discuss applications to the evaluation of power series with guaranteed precision.