Procedures for searching local solutions of linear differential systems with infinite power series in the role of coefficients

Abstract

Construction of Laurent, regular, and formal (exponential–logarithmic) solutions of full-rank linear ordinary differential systems is discussed. The systems may have an arbitrary order, and their coefficients are formal power series given algorithmically. It has been established earlier that the first two problems are algorithmically decidable and the third problem is not decidable. A restricted variant of the third problem was suggested for which the desired algorithm exists. In the paper, a brief survey of algorithms for the abovementioned decidable problems is given. Implementations of these algorithms in the form of Maple procedures with a uniform interface and data representation are suggested.