Logo - springer
Slogan - springer

Mathematics - Computational Science & Engineering | Hypergeometric Summation

Hypergeometric Summation

An Algorithmic Approach to Summation and Special Function Identities

Series: Universitext

Koepf, Wolfram

2nd ed. 2014, XVII, 279 p. 5 illus., 3 illus. in color.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$49.99

(net) price for USA

ISBN 978-1-4471-6464-7

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$69.99

(net) price for USA

ISBN 978-1-4471-6463-0

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Provides a self-contained and easy-to-read introduction to algorithmic summation
  • Presents the essential algorithms due to Fasenmyer, Gosper, Zeilberger and Petkovšek
  • Studies the ideas of the state-of-the-art algorithm for hypergeometric term solutions of recurrence equations (van Hoeij algorithm)
  • Includes the most efficient ideas for multiple summation
  • Contains many examples from the field of orthogonal polynomials and special functions

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.

Content Level » Graduate

Keywords » Algorithmic Summation - Antidifference - Basic Hypergeometric Series - Differential Equation - Fasenmyer Algorithm - Generating Function - Gosper Algorithm - Hypergeometric Series - Non-commutative Factorization - Operator Equation - Petkovsek Algorithm - Recurrence Equation - Rodrigues Formulas - Van Hoeij Algorithm - Zeilberger Algorithm

Related subjects » Analysis - Computational Science & Engineering - Dynamical Systems & Differential Equations

Table of contents / Preface / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithms.