By Wolfram Koepf
Modern algorithmic innovations for summation, such a lot of that have been brought within the Nineteen Nineties, are constructed the following and thoroughly carried out within the laptop algebra approach Maple™.
The algorithms of Fasenmyer, Gosper, Zeilberger, Petkovšek and van Hoeij for hypergeometric summation and recurrence equations, effective multivariate summation in addition to q-analogues of the above algorithms are coated. comparable algorithms bearing on differential equations are thought of. An similar conception of hyperexponential integration because of Almkvist and Zeilberger completes the book.
The blend of those effects offers orthogonal polynomials and (hypergeometric and q-hypergeometric) distinct capabilities a great algorithmic starting place. therefore, many examples from this very lively box are given.
The fabrics lined are compatible for an introductory path on algorithmic summation and may attract scholars and researchers alike.