M. A. Barkatou
ABSTRACT
We present algorithms for computing rational and hyperexponential solutions of linear D-finite partial differential systems written as integrable connections. We show that these types of solutions can be computed recursively by adapting existing algorithms handling ordinary linear differential systems. We provide an arithmetic complexity analysis of the algorithms that we develop. A Maple implementation is available and some examples and applications are given.
- M. A. Barkatou. Rational Newton algorithm for computing formal solutions of linear differential equations. In Proceedings of ISSAC 1988, Springer Lecture Notes in Computer Science vol. 358, 1988. Google Scholar
Digital Library
- M. A. Barkatou. An algorithm to compute the exponential part of a formal fundamental matrix solution of a linear differential system near an irregular singularity. Journal of App. Alg. in Eng. Comm. and Comp., 8(1):1--23, 1997.Google ScholarDigital Library
- M. A. Barkatou. On rational solutions of systems of linear differential equations. Journal of Symbolic Computation, 28:547--567, 1999.Google ScholarDigital Library
- M. A. Barkatou. Factoring systems of linear functional equations using eigenrings. Latest Advances in Symbolic Algorithms, Proc. of the Waterloo Workshop, Ontario, Canada (10--12/04/06), I. Kotsireas and E. Zima (Eds.), World Scientific:22--42, 2007.Google Scholar
- M. A. Barkatou, T. Cluzeau, and C. El Bacha. Simple forms of higher-order linear differential systems and their applications in computing regular solutions. Journal of Symbolic Computation, 46:633--658, 2011. Google ScholarDigital Library
- M. A. Barkatou, T. Cluzeau, and J.-A. Weil. Factoring partial differential systems in positive characteristic. Differential Equations with Symbolic Computation (DESC Book), Editor D. Wang, Birkhaüser, 2005.Google Scholar
- M. A. Barkatou and E. Pfluegel. Isolde (integration of systems of ordinary linear differential equations) project, http://isolde.sourceforge.net/.Google Scholar
- M. A. Barkatou and E. Pfluegel. On the Moser- and super-reduction algorithms of systems of linear differential equations and their complexity. Journal of Symbolic Computation, 44:1017--1036, 2009. Google ScholarDigital Library
- W. Bryc and G. Letac. Meixner matrix ensembles. To appear in Journ. Theoret. Probab., 2012. http://arxiv.org/pdf/1009.4653v2.pdf.Google Scholar
- F. Chyzak. An extension of Zeilberger's fast algorithm to general holonomic functions. Discrete Math., 217:115--134, 2000. Google ScholarDigital Library
- F. Chyzak, A. Quadrat, and D. Robertz. OreModules project, http://wwwb.math.rwth-aachen.de/OreModules.Google Scholar
- F. Chyzak and B. Salvy. Non-commutative elimination in Ore algebras proves multivariate identities. Journal of Symbolic Computation, 26:187--227, 1998. Google ScholarDigital Library
- T. Cluzeau and A. Quadrat. Factoring and decomposing a class of linear functional systems. Linear Alg. and its App., 428(1):324--381, 2008.Google ScholarCross Ref
- T. Cluzeau and M. van Hoeij. A modular algorithm for computing the exponential solutions of a linear differential operator. Journal of Symbolic Computation, 38(3):1043--1076, 2004.Google ScholarCross Ref
- C. El Bacha. Méthodes algébriques pour la résolution d'équations différentielles matricielles d'ordre arbitraire. PhD Thesis, Univ. of Limoges, 2011.Google Scholar
- D. Y. Grigoriev. Complexity of irreducibility testing for a system of linear ordinary differential equations. In Proceedings of ISSAC 1990, pages 225--230, 1990. Google ScholarDigital Library
- E. Kolchin. Differential algebra and algebraic groups. Academic Press, New York, 1973.Google Scholar
- Z. Li, F. Schwarz, and S. Tsarev. Factoring systems of PDE's with finite-dimensional solution space. Journal of Symbolic Computation, 36:443--471, 2003. Google ScholarDigital Library
- Z. Li, M. S. Singer, M. Wu, and D. Zheng. A recursive method for determining the one-dimensional submodules of Laurent-Ore modules. In Proceedings of ISSAC 2006, pages 200--208, 2006. Google ScholarDigital Library
- T. Oaku, N. Takayama, and H. Tsai. Polynomial and rational solutions of holonomic systems. Journal of Pure and Applied Algebra, 164:199--220, 2001.Google ScholarCross Ref
- E. Pfluegel. An algorithm for computing exponential solutions of first order linear differential systems. In Proceedings of ISSAC 1997, pages 164--171, 1997. Google ScholarDigital Library
- J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, New York, 1999. Google ScholarDigital Library
- M. Wu. On solutions of linear functional systems and factorization of modules over Laurent-Ore algebras. PhD Thesis, Univ. of Nice-Sophia Antipolis, 2005.Google Scholar
Index Terms
- Computing closed form solutions of integrable connections
Recommendations
Recurrence equations and their classical orthogonal polynomial solutions
Orthogonal systems and applicationsThe classical orthogonal polynomials are given as the polynomial solutions p"n(x) of the differential equation@s(x)y''(x)+@t(x)y^'(x)+@l"ny(x)=0,where @s(x) is a polynomial of at most second degree and @t(x) is a polynomial of first degree. In this ...
Fast algorithms for polynomial solutions of linear differential equations
ISSAC '05: Proceedings of the 2005 international symposium on Symbolic and algebraic computationWe investigate polynomial solutions of homogeneous linear differential equations with coefficients that are polynomials with integer coefficients. The problems we consider are the existence of nonzero polynomial solutions, the determination of the ...
Differential equations for algebraic functions
ISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computationIt is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential equation of ...
Comments