Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation |
| |
| Authors: | Kathy Driver Helmut Prodinger Carsten Schneider J A C Weideman |
| |
| Institution: | (1) The John Knopfmacher Centre for Applicable Analysis and Number Theory, School of Mathematics, University of the Witwatersrand, P.O. Wits, Johannesburg, 2050, South Africa;(2) Research Institute for Symbolic Computation, Johannes Kepler University Linz, A–4040 Linz, Austria;(3) Department of Applied Mathematics, University of Stellenbosch, Stellenbosch, 7600, South Africa |
| |
| Abstract: | Combinatorial identities that were needed in 25] 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.
2000 Mathematics Subject Classification Primary—41A21, 05A19, 33F10
Supported by NRF-grant 2047226.
Supported by NRF-grant 2053748.
Supported by the Austrian Academy of Sciences, by the John Knopfmacher Research Centre for Applicable Analysis and Number
Theory, and by the SFB-grant F1305 and the grant P16613-N12 of the Austrian FWF.
Supported by NRF-grant 2053756. |
| |
| Keywords: | Padé approximation Combinatorial identities Computer algebra Creative telescoping |
| 本文献已被 SpringerLink 等数据库收录！ |
|
