Multibasic and mixed hypergeometric Gosper-type algorithms (Q1974697): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1006/jsco.1999.0321 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1006/JSCO.1999.0321 / rank
 
Normal rank

Latest revision as of 16:02, 16 December 2024

scientific article
Language Label Description Also known as
English
Multibasic and mixed hypergeometric Gosper-type algorithms
scientific article

    Statements

    Multibasic and mixed hypergeometric Gosper-type algorithms (English)
    0 references
    0 references
    0 references
    8 May 2000
    0 references
    The authors extend Gosper's algorithm for indefinite hypergeometric summation [see e.g. (1998; Zbl 0909.33001)] for the case when the terms are simultaneously hypergeometric and multibasic hypergeometric. Furthermore they present algorithms to detect the polynomial as well as hypergeometric solutions of recurrence equations in the mixed case. Finally they generalize the concept of greatest factorial factorization to the mixed hypergeometric case. Note that a variant of the multibasic Gosper algorithm appeared also in [\textit{H. Böing} and \textit{W. Koepf}, J. Symb. Comput. 28, 777-799 (1999)].
    0 references
    0 references
    Gosper algorithm
    0 references
    greatest factorial factorization
    0 references
    polynomial solutions of recurrence equations
    0 references
    hypergeometric solutions of equations
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers