Identities of nonterminating series by Zeilberger's algorithm (Q1298586)

From MaRDI portal
Revision as of 20:44, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Identities of nonterminating series by Zeilberger's algorithm
scientific article

    Statements

    Identities of nonterminating series by Zeilberger's algorithm (English)
    0 references
    5 October 2000
    0 references
    The Gosper algorithm and in particular the subsequent Zeilberger algorithm and the related WZ method have been extremely successful for an approach by computer algebra to identities involving hypergeometric functions [cf. \textit{M. Petovšek}, \textit{H. S. Wilfe} and \textit{D. Zeilberger}, \(A=B\). Wellesley, MA: A. K. Peters (1996; Zbl 0848.05002)]. But this method remains restricted to the case of identities for the terminating hypergeometric series. The author shows that automated proofs of the identities for non-terminating hypergeometric series are feasible by a combination of Zeilberger's algorithm and asymptotic estimates. It is shown that the method extends to the non-terminating generalization of Saalschütz' summation formula for a terminating Saalschützian \({_3F_2}\) hypergeometric series of argumentation \(1\).
    0 references
    Gosper algorithm
    0 references
    Zeilberger algorithm
    0 references
    WZ method
    0 references
    computer algebra
    0 references
    non-terminating hypergeometric series
    0 references
    asymptotic estimates
    0 references
    Saalschütz' summation formula
    0 references
    \({_3F_2}\) hypergeometric series
    0 references
    0 references
    0 references
    0 references

    Identifiers