A generalization of Gosper's algorithm (Q1339870): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3031846 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3471654 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decision procedure for indefinite hypergeometric summation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hypergeometric solutions of linear recurrences with polynomial coefficients / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Differentiably finite power series / rank | |||
Normal rank | |||
Latest revision as of 10:54, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of Gosper's algorithm |
scientific article |
Statements
A generalization of Gosper's algorithm (English)
0 references
11 December 1994
0 references
In this paper a derivation of Gosper's algorithm permitting generalization to high-order recurrences with constant least and most significant coefficients is presented. This generalized algorithm requires only ``rational'' operations but not factorization.
0 references
Gosper's algorithm
0 references
