Improvement of the degree setting in Gosper's algorithm
This paper provides a useful detailed analysis of Gosper's algorithm for indefinite hypergeometric summation; it will prove invaluable for readers wishing to understand and improve upon the algorithms employed to that end by familiar computing packages. The issue is, given polynomials \(\sigma\) and \(\tau\), to determine the sums \(\sum_{k=1}^n a_k\) for sequences \((a_k)\) given by recurrence relations \(a_k= (\sigma(k)/\tau(k)) a_{k-1}\). One of the crucial steps in Gosper's algorithm is the determination of a degree bound for a possible polynomial solution of the key difference equation associated to the summation. The present analysis of that problem deals with that matter and, to do that, gives an instructive introduction to the principles underlying the algorithm. No doubt, readers other than the reviewer will be amused by the eccentric behaviour of Apery's sequence in the present context.
- A generalization of Gosper's algorithm
- Accelerating indefinite summation: simple classes of summands
- scientific article; zbMATH DE number 1262460 (Why is no real title available?)
- A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm
- Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula
- On the structure of solutions to the key Gosper equation in problems of symbolic summation
- Average case analysis of Gosper's algorithm for a class of urn model inputs
- Converging to Gosper's algorithm
This page was built for publication: Improvement of the degree setting in Gosper's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314432)
