Computer Science – Symbolic Computation
Scientific paper
2010-05-04
Computer Science
Symbolic Computation
Scientific paper
We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed on a great many examples, there is no guarantee for them to terminate, and they do in fact not terminate for every input. For some restricted classes of P-finite recurrence equations of order up to three we provide a priori criteria that assert the termination of the algorithms.
Kauers Manuel
Pillwein Veronika
No associations
LandOfFree
When can we decide that a P-finite sequence is positive? 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 When can we decide that a P-finite sequence is positive?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and When can we decide that a P-finite sequence is positive? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-532618