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

Ramanujan Journal

Volumn 11, Issue 2, 2006, Pages 139-158

  Driver, Kathy ^a   Prodinger, Helmut ^a   Schneider, Carsten ^b   Weideman, J A C ^c  

^a UNIVERSITY OF THE WITWATERSRAND   (South Africa)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^c STELLENBOSCH UNIVERSITY   (South Africa)

Author keywords

Combinatorial identities; Computer algebra; Creative telescoping; Pad approximation

Indexed keywords

EID: 33744718824     PISSN: 13824090     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11139-006-6503-4     Document Type: Article

References (27)

1. Abramov, S.A., Petkovšek, M.: D'Alembertian solutions of linear differential and difference equations. In: Gathen, J.von zur, (ed.), Proc. ISSAC'94, pp. 169-174. ACM Press, Baltimore (1994)
2. Borwein, P.B.: Quadratic and higher order Padé approximants. In: A. Haar memorial conference, Vol. I, II(Budapest, 1985)
3. volume 49 of Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam, pp. 213-224 (1987)
4. Bronstein, M.: On solutions of linear ordinary difference equations in their coefficient field. J. Symbolic Comput. 29(6), 841-877 (2000)
5. Cohn, R.M.: Difference algebra. Interscience Publishers, John Wiley & Sons (1965)
6. Driver, K., Prodinger, H., Schneider, C., Weideman, J.A.C.: Padé approximations to the logarithm III: Alternative methods and additional results. Ramanujan J., to appear
7. Gosper, R.W.: Decision procedures for indefinite hypergeometric summation. Proc. Nat. Acad. Sci. U.S.A. 75, 40-42 (1978)
8. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: a foundation for computer science. Addison-Wesley Publishing Company, Amsterdam, 2nd edition (1994)
9. Hendriks, P.A., Singer, M.F.: Solving difference equations in finite terms. J. Symbolic Comput. 27(3), 239-259, (1999)
10. Jager, H.: A multidimensional generalization of the Padé table. IV, V, VI. Nederl. Akad. Wetensch. Proc. Ser. A 67 = Indag. Math. 26, 227-239, 240-244, 245-249 (1964)
11. Karr, M.: Summation in finite terms. J. ACM 28, 305-350 (1981)
12. Karr, M.: Theory of summation in finite terms. J. Symbolic Comput. 1, 303-315 (1985)
13. Paule, P., Riese, A.: A mathematica q-analogue of Zeilberger's algorithm based on an algebraically motivated aproach to q-hypergeometric telescoping. In: Ismail, M. and Rahman, M., (eds.) Special Functions, q-Series and Related Topics, volume 14, Fields Institute Toronto, pp. 179-210. AMS (1997)
14. Paule, P., Schneider, C.: Computer proofs of a new family of harmonic number identities. Adv. in Appl. Math. 31(2), 359-378 (2003)
15. Paule, P., Schorn, M.: A Mathematica version of Zeilberger's algorithm for proving binomial coefficient identities. J. Symbolic Comput. 20(5-6), 673-698 (1995)
16. Paule, P., Strehl, V.: Symbolic summation-some recent developments. In: Fleischeret al., J. (ed.), Computer algebra in science and engineering-algorithms, systems, and applications, pp. 138-162. World Scientific. Singapore (1995)
17. Petkovšek, M., Wilf, M.S., Zeilberger, D.: A = B. A. K. Peters, Wellesley, MA (1996)
18. Risch, R.: The solution to the problem of integration in finite terms. Bull. Amer. Math. Soc. 76, 605-608 (1970)
19. Schneider, C.: The summation package Sigma: Underlying principles and a rhombus tiling application. Discrete Math. Theor. Comput. Sci. 6(2), 365-386 (2004)
20. Schneider, C.: Symbolic summation in difference fields. Technical Report 01-17, RISC-Linz, J. Kepler University. PhD Thesis (2001)
21. Schneider, C.: Degree bounds to find polynomial solutions of parameterized linear difference equations in Π∑-fields. Appl. Algebra. Engrg. Comm. Comput. 16(1), 1-32 (2005)
22. Schneider, C.: A collection of denominator bounds to solve parameterized linear difference equations in Π∑-extensions. In: Petcu, D. et al. (eds.) Proc. SYNASC04, 6th Internat. Symposium on Symbolic and Numeric Algorithms for Scientfic Computation, pp. 269-282. Milton Publishing (2004)
23. Schneider, C.: Solving parameterized linear difference equations in terms of indefinite nested sums and products. J. Differ. Equations Appl. 11(9), 799-821 (2005)
24. Schneider, C.: Finding telescopers with minimal depth for indefinite nested sum and product expressions. In: Kauers, M. (ed.) Proc. ISSAC'05, pp. 285-292. ACM (2005)
25. Weideman, J.A.C.: http://dip.sun. ac.za/~weideman/PADE
26. Weideman, J.A.C.: Padé approximations to the logarithm I: Derivation via differential equations. Quaest. Math. 28(3), 375-390 (2005)
27. Zeilberger, D.: A fast algorithm for proving terminating hypergeometric identities. Discrete Math. 80(2), 207-211 (1990)