Identities of nonterminating series by Zeilberger's algorithm

This paper argues that automated proofs of identities for nonterminating hypergeometric series are feasible by a combination of Zeilberger's algorithm and asymptotic estimates. For two analogues of Saalschütz' summation formula in the nonterminating case this is illustrated.

Saved in:
Bibliographic Details
Published inJournal of computational and applied mathematics Vol. 99; no. 1; pp. 449 - 461
Main Author Koornwinder, Tom H.
Format Journal Article Conference Proceeding
LanguageEnglish
Published Amsterdam Elsevier B.V 16.11.1998
Elsevier
Subjects
Asymptotics
Computer algebra
Exact sciences and technology
Mathematical analysis
Mathematics
Nonterminating hypergeometric series
Saalschütz' summation formula
Sciences and techniques of general use
Sequences, series, summability
Special functions
Zeiberger's algorithm
Nonterminating hypergeometric series
Asymptotics
Computer algebra
Zeiberger's algorithm
Saalschütz' summation formula
Hypergeometric series
Asymptotic behavior
Special function
Algorithm
Summation
Orthogonal polynomial
Online AccessGet full text

Cover

More Information
Summary:This paper argues that automated proofs of identities for nonterminating hypergeometric series are feasible by a combination of Zeilberger's algorithm and asymptotic estimates. For two analogues of Saalschütz' summation formula in the nonterminating case this is illustrated.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISSN:0377-0427
1879-1778
DOI:10.1016/S0377-0427(98)00176-9