Hypergeometric Summation: An Algorithmic Approach to Summation and Special Function Identities
In this book modern algorithmic techniques for summation, most of which have been introduced within the last decade, are developed and carefully implemented in the computer algebra system Maple.
The algorithms of Gosper, Zeilberger and Petkovsek on hypergeometric summation and recurrence equations and their q-analogues are covered, and similar algorithms on differential equations are considered. An equivalent theory of hyperexponential integration due to Almkvist and Zeilberger completes the book.
17 pages matching option Copyright 1998 in this book
Results 1-3 of 17
What people are saying - Write a review
We haven't found any reviews in the usual places.
9 other sections not shown
1998 Wolfram Koepf Algorithm 10.2 Algorithm 2.1 antiderivative application of Gosper's applied binomial coefficients binomial theorem calculation chapter Chu-Vandermonde identity computation computer algebra system Copyright 1998 Wolfram database deduce degree bound denominator denote equate coefficients equation of order ERROR('algorithm Example Exercise finite support formula g-analogues given Gosper-summable Gosper's algorithm Hence holonomic recurrence equation hyperexponential term Hypergeom hypergeometric function hypergeometric identities hypergeometric representation hypergeometric summation hypergeometric term solutions implementation initial values input integer integer-linear integral Jacobi polynomials Konrad-Zuse-Zentrum Berlin Laguerre polynomials Legendre polynomials Lemma linear system lower parameters Maple procedure nonnegative integer Note option Copyright 1998 order recurrence equation orthogonal polynomials Petkovsek's algorithm Pn(x Pochhammer symbols proof rational certificate rational functions recurrence and differential rewriting right-hand side Rodrigues formula satisfies Session Show sn+i summand term ratio term with respect Theorem valid WZ method Zeilberger Zeilberger's algorithm zero