Hypergeometric Summation - An Algorithmic Approach to Summation and Special Function Identities (Paperback, 2nd ed. 2014)

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 (TM). The algorithms of Fasenmyer, Gosper, Zeilberger, Petkovsek 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.

General

Imprint:	Springer London
Country of origin:	United Kingdom
Series:	Universitext
Release date:	June 2014
First published:	2014
Authors:	Wolfram Koepf
Dimensions:	235 x 155 x 16mm (L x W x T)
Format:	Paperback
Pages:	279
Edition:	2nd ed. 2014
ISBN-13:	978-1-4471-6463-0
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Functional analysis Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Differential equations Books > Computing & IT > Computer software packages > Other software packages > Mathematical & statistical software Promotions
LSN:	1-4471-6463-6
Barcode:	9781447164630

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!