zbMATH — the first resource for mathematics

Extended rate, more GFUN. (English) Zbl 1189.65040
Fourth colloquium on mathematics and computer science IV. Algorithms, trees, combinatorics and probabilities. Papers based on the presentations at the colloquium, Nancy, France, September 18–22, 2006. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 431-434, electronic only (2006).
Summary: We present a software package that guesses formulas for sequences of, for example, rational numbers or rational functions, given the first few terms. Thereby we extend and complement C. Krattenthaler’s program RATE [RATE: a Mathematica guessing machine, http://mat.univie.ac.at/~kratt/rate/rate.html] and the relevant parts of B. Salvy and P. Zimmermann’s GFUN [ACM Trans. Math. Softw. 20, No. 2, 163–177 (1994; Zbl 0888.65010)].
For the entire collection see [Zbl 1189.68002].

65D20 Computation of special functions and constants, construction of tables
68W30 Symbolic computation and algebraic computation
65Y15 Packaged methods for numerical algorithms
AXIOM; gfun; Guess; RATE
Full Text: Link