Formal Solutions of Completely Integrable Pfaffian Systems With Normal Crossings
Symbolic Computation
2016-10-06 v3
Abstract
In this paper, we present an algorithm for computing a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in several variables. This algorithm is a generalization of a method developed for the bivariate case based on a combination of several reduction techniques and is implemented in the computer algebra system Maple.
Keywords
Cite
@article{arxiv.1511.00180,
title = {Formal Solutions of Completely Integrable Pfaffian Systems With Normal Crossings},
author = {Moulay A. Barkatou and Maximilian Jaroschek and Suzy S. Maddah},
journal= {arXiv preprint arXiv:1511.00180},
year = {2016}
}
Comments
Final revision