| C. Mallinger, Algorithmic manipulations and transformations of univariate holonomic functions and sequences, diploma thesis, RISC, J. Kepler University, Linz, 1996. |
....algorithm [36, 50, 51] finds a recurrence for the sum in the first line of (6.13) Carsten Schneider s extension of Karr s algorithm [19] implemented by Schneider, finds a recurrence for the double sum in the second line of (6. 13) Finally, Mallinger s Mathematica package GeneratingFunctions [29] or Salvy and Zimmermann s Maple package gfun [45] can be used to combine these two recurrences into one, a recurrence of order 10. It is then routine to check (preferably on the computer) that the right hand side of (6.13) satisfies this same recurrence. However, in the present implementation, ....
C. Mallinger, Algorithmic manipulations and transformations of univariate holonomic functions and sequences, diploma thesis, RISC, J. Kepler University, Linz, 1996.
No context found.
C. Mallinger, Algorithmic manipulations and transformations of univariate holonomic functions and sequences, diploma thesis, RISC, J. Kepler University, Linz, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC