Effective Bounds for P-Recursive Sequences

Details Effective Bounds for P-Recursive Sequences Effective Bounds for P-Recursive Sequences

2009-04-16

arxiv.org/abs/0904.2452v2

Computer Science

Symbolic Computation

26 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Effective Bounds for P-Recursive Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Effective Bounds for P-Recursive Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effective Bounds for P-Recursive Sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-464704