Computing closed form solutions of integrable connections

  title={Computing closed form solutions of integrable connections},
  author={M. Barkatou and T. Cluzeau and Carole El Bacha and Jacques-Arthur Weil},
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. 
20 Citations
Formal solutions of completely integrable Pfaffian systems with normal crossings
  • 1
  • PDF
On k-simple forms of first-order linear differential systems and their computation
  • 12
Simple Forms and Rational Solutions of Pseudo-Linear Systems
  • 3
Computing the Lie Algebra of the Differential Galois Group of a Linear Differential System
  • 6
  • PDF
Algorithms for Pfaffian Systems and Cohomology Intersection Numbers of Hypergeometric Integrals
  • 1
  • PDF
Computing the Lie algebra of the differential Galois group: the reducible case
  • 1
  • PDF
Symbolic Integration of Hyperexponential 1-Forms
  • PDF
Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras
  • 26
  • PDF


Letac. Meixner matrix ensembles
  • To appear in Journ. Theoret. Probab.,
  • 2012
Isolde (integration of systems of ordinary linear differential equations) project
  • Isolde (integration of systems of ordinary linear differential equations) project