A generalization of Gosper's algorithm
From MaRDI portal
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.
Recommendations
Cites work
- Decision procedure for indefinite hypergeometric summation
- Differentiably finite power series
- scientific article; zbMATH DE number 4129910 (Why is no real title available?)
- scientific article; zbMATH DE number 4139223 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- Hypergeometric solutions of linear recurrences with polynomial coefficients
Cited in
(24)- Solutions of linear difference equations with variable coefficients
- Improvement of the degree setting in Gosper's algorithm
- A generalized insertion algorithm for the seriation problem
- A generalization of Gosper's algorithm to bibasic hypergeometric summation
- A generalization of the Massey-Ding algorithm
- Computer proofs of a new family of harmonic number identities.
- Multibasic and mixed hypergeometric Gosper-type algorithms
- On the Gosper-Petkovšek representation of rational functions
- A generalization of Takane's algorithm for DEDICOM
- A relation between sequences generated by Golomb's preference algorithm
- Revisiting the Gentry-Szydlo Algorithm
- scientific article; zbMATH DE number 6475500 (Why is no real title available?)
- On the summation of P-recursive sequences
- Minimal universal denominators for linear difference equations
- scientific article; zbMATH DE number 3908170 (Why is no real title available?)
- scientific article; zbMATH DE number 1501083 (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
- Solving parameterized linear difference equations in terms of indefinite nested sums and products
- Properties of the Golub-Wilkinson algorithm
- On the structure of solutions to the key Gosper equation in problems of symbolic summation
- Marko Petkovšek 1955--2023
- On a general -algorithm
- Converging to Gosper's algorithm
This page was built for publication: A generalization of Gosper's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339870)
