Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10325552 | Journal of Symbolic Computation | 2005 | 9 Pages |
Abstract
We show that the uniqueness of the Gosper-PetkovÅ¡ek representation of rational functions can be utilized to give a simpler version of Gosper's algorithm. This approach also applies to PetkovÅ¡ek's generalization of Gosper's algorithm, and its q-analogues by Abramov-Paule-PetkovÅ¡ek and Böing-Koepf.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
William Y.C. Chen, Husam L. Saad,