Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
401636 | Journal of Symbolic Computation | 2011 | 26 Pages |
Abstract
We propose a direct algorithm for computing regular formal solutions of a given higher-order linear differential system near a singular point. With such a system, we associate a matrix polynomial and we say that the system is simple if the determinant of this matrix polynomial does not identically vanish. In this case, we show that the algorithm developed in Barkatou et al. (2009) can be applied to compute a basis of the regular formal solutions space. Otherwise, we develop an algorithm which, given a non-simple system, computes an auxiliary simple one from which the regular formal solutions space of the original system can be recovered. We also give the arithmetic complexity of our algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence