Hypergeometric Summation

An Algorithmic Approach to Summation and Special Function Identities

By: Wolfram Koepf

Write A Review

eText | 10 June 2014 | Edition Number 2

At a Glance

Format
ePUB

eText

$119.00

or 4 interest-free payments of $29.75 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are developed here and carefully implemented in the computer algebra system Maple?.

The algorithms of Fasenmyer, Gosper, Zeilberger, Petkov?ek and van Hoeij for hypergeometric summation and recurrence equations, efficient multivariate summation as well as q-analogues of the above algorithms are covered. Similar algorithms concerning differential equations are considered. An equivalent theory of hyperexponential integration due to Almkvist and Zeilberger completes the book.

The combination of these results gives orthogonal polynomials and (hypergeometric and q-hypergeometric) special functions a solid algorithmic foundation. Hence, many examples from this very active field are given.

The materials covered are suitable for an introductory course on algorithmic summation and will appeal to students and researchers alike.