Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation (Q850522)

From MaRDI portal
Revision as of 20:50, 9 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation
scientific article

    Statements

    Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation (English)
    0 references
    0 references
    0 references
    3 November 2006
    0 references
    Combinatorial identities that were needed in [\textit{J. A. C. Weidemann}, Quaest. Math. 28, No. 3, 375--390 (2005; Zbl 1085.41011)] are proved, mostly with C. Schneider's computer algebra package Sigma. The form of the Padé approximation of the logarithm of arbitrary order is stated as a conjecture.
    0 references
    Padé approximation
    0 references
    Combinatorial identities
    0 references
    Computer algebra
    0 references
    Creative telescoping
    0 references

    Identifiers