Computing closed form solutions of integrable connections

DOI10.1145/2442829.2442840zbMath1323.68580OpenAlexW2055495248MaRDI QIDQ5244515

Thomas Cluzeau, Carole El Bacha, Jacques-Arthur Weil, Moulay A. Barkatou

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2442829.2442840

zbMATH Keywords

complexitycomputer algebraimplementation\(D\)-finite linear systems of PDEsrational and hyperexponential solutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Methods of ordinary differential equations applied to PDEs (35A24) Systems of linear first-order PDEs (35F35)

Related Items (12)

Algorithms for Pfaffian Systems and Cohomology Intersection Numbers of Hypergeometric Integrals ⋮ On rational solutions of pseudo-linear systems ⋮ A characterization of reduced forms of linear differential systems ⋮ On \(k\)-simple forms of first-order linear differential systems and their computation ⋮ Difference integrability conditions for parameterized linear difference and differential equations ⋮ Darboux transformations for orthogonal differential systems and differential Galois theory ⋮ Macaulay matrix for Feynman integrals: linear relations and intersection numbers ⋮ Restrictions of Pfaffian systems for Feynman integrals ⋮ Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras ⋮ Formal solutions of completely integrable Pfaffian systems with normal crossings ⋮ Galoisian methods for testing irreducibility of order two nonlinear differential equations ⋮ Computing the Lie algebra of the differential Galois group: the reducible case

Uses Software

• Maple

This page was built for publication: Computing closed form solutions of integrable connections