Alin Bostan
Shaoshi Chen
ABSTRACT
The long-term goal initiated in this work is to obtain fast algorithms and implementations for definite integration in Almkvist and Zeilberger's framework of (differential) creative telescoping. Our complexity-driven approach is to obtain tight degree bounds on the various expressions involved in the method. To make the problem more tractable, we restrict to bivariate rational functions. By considering this constrained class of inputs, we are able to blend the general method of creative telescoping with the well-known Hermite reduction. We then use our new method to compute diagonals of rational power series arising from combinatorics.
- G. Almkvist and D. Zeilberger. The method of differentiating under the integral sign. J. Symb. Comput., 10:571--591, 1990. Google Scholar
Digital Library
- M. Apagodu and D. Zeilberger. Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory. Adv. in Appl. Math., 37(2):139--152, 2006.Google ScholarDigital Library
- A. Bostan, F. Chyzak, B. Salvy, G. Lecerf, and É. Schost. Differential equations for algebraic functions. In ISSAC'07, pages 25--32. ACM, New York, 2007. Google ScholarDigital Library
- M. Bronstein. Symbolic Integration I: Transcendental functions, volume 1 of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin, second edition, 2005. Google ScholarDigital Library
- A. Flaxman, A. W. Harrow, and G. B. Sorkin. Strings with maximally many distinct subsequences and substrings. Electron. J. Combin., 11(1):R8, 10 pp., 2004.Google ScholarCross Ref
- J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, Cambridge, second edition, 2003. Google ScholarDigital Library
- K. O. Geddes and H. Q. Le. An algorithm to compute the minimal telescopers for rational functions (differential-integral case). In Mathematical Software, pages 453--463. WSP, 2002.Google ScholarCross Ref
- J. Gerhard. Fast modular algorithms for squarefree factorization and Hermite integration. Appl. Algebra Engrg. Comm. Comput., 11(3):203--226, 2001.Google ScholarCross Ref
- J. Gerhard. Modular Algorithms in Symbolic Summation and Symbolic Integration (LNCS). Springer-Verlag, 2004. Google ScholarDigital Library
- C. Hermite. Sur l'intégration des fractions rationnelles. Ann. Sci. École Norm. Sup. (2), 1:215--218, 1872.Google ScholarCross Ref
- E. Horowitz. Algorithms for partial fraction decomposition and rational function integration. In SYMSAC'71, pages 441--457, New York, USA, 1971. ACM. Google ScholarDigital Library
- H. Q. Le. On the differential-integral analogue of Zeilberger's algorithm to rational functions. In Proc. of the 2000 Asian Symposium on Computer Mathematics, pages 204--213, 2000.Google ScholarCross Ref
- L. Lipshitz. The diagonal of a D-finite power series is D-finite. J. Algebra, 113(2):373--378, 1988.Google ScholarCross Ref
- L. Lipshitz. D-finite power series. J. Algebra, 122(2):353--373, 1989.Google ScholarCross Ref
- M. Ostrogradsky. De l'intégration des fractions rationnelles. Bull. de la classe physico-mathématique de l'Acad. Impériale des Sciences de Saint-Pétersbourg, 4:145--167, 286--300, 1845.Google Scholar
- R. P. Stanley. Enumerative Combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. CUP, 1999.Google Scholar
- A. Storjohann and G. Villard. Computing the rank and a small nullspace basis of a polynomial matrix. In ISSAC'05, pages 309--316. ACM, New York, 2005. Google ScholarDigital Library
- D. Zeilberger. A holonomic systems approach to special functions identities. J. Comput. Appl. Math., 32:321--368, 1990. Google ScholarDigital Library
- D. Zeilberger. The method of creative telescoping. J. Symbolic Comput., 11(3):195--204, 1991. Google ScholarDigital Library
- http://algo.inria.fr/chen/BivRatCT/, 2010.Google Scholar
Index Terms
- Complexity of creative telescoping for bivariate rational functions
Recommendations
Creative telescoping for rational functions using the griffiths: dwork method
ISSAC '13: Proceedings of the 38th International Symposium on Symbolic and Algebraic ComputationCreative telescoping algorithms compute linear differential equations satisfied by multiple integrals with parameters. We describe a precise and elementary algorithmic version of the Griffiths-Dwork method for the creative telescoping of rational ...
Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions
ISSAC '18: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic ComputationHermite reduction is a classical algorithmic tool in symbolic integration. It is used to decompose a given rational function as a sum of a function with simple poles and the derivative of another rational function. We extend Hermite reduction to ...
Hermite reduction and creative telescoping for hyperexponential functions
ISSAC '13: Proceedings of the 38th International Symposium on Symbolic and Algebraic ComputationWe present a new reduction algorithm that simultaneously extends Hermite's reduction for rational functions and the Hermite-like reduction for hyperexponential functions. It yields a unique additive decomposition that allows to decide hyperexponential ...
Comments