Computing closed form solutions of integrable connections

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 22 Jul 2012Publisher:ACMJournal:Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Authors: Moulay A. Barkatou; Thomas Cluzeau; Carole El Bacha; Jacques-Arthur Weil;

doi: 10.1145/2442829.2442840

Computing closed form solutions of integrable connections

- Summary
- Metrics

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.

Related Organizations

University of Limoges
France

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	10
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average