Improvement of the degree setting in Gosper's algorithm (Q1314432): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2131914309 / rank | |||
Normal rank |
Latest revision as of 03:31, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improvement of the degree setting in Gosper's algorithm |
scientific article |
Statements
Improvement of the degree setting in Gosper's algorithm (English)
0 references
20 February 1996
0 references
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.
0 references
hypergeometric series
0 references
summation algorithms
0 references
computational complexity
0 references
Gosper's algorithm
0 references