Given two linear di erential systems with rational function coe cients, we give an algorithm to decide whether these two systems are equivalent and to compute the corresponding transformation matrices.Expand

We propose a method for computing the regular singular formal solutions of a linear differential system in the neighbourhood of a singular point.Expand

Jcu~ (dlcre the ruitt.ions of ClpiLtiOIlS of type (3) llas otlwrs appliwtions [14]. Iu bhis pilper wv(â€™ shall iwisitlcr ilnd Solve tll(! following more general prol. Bosidrs t.SVHkIllS.Expand

Applicable Algebra in Engineering, Communicationâ€¦

2009

TLDR

In this paper we describe an efficient algorithm, fully implemented in the Maple computer algebra system, that computes the exponential part of a formal fundamental matrix solution of a linear differential system having a singularity of pole type at the origin.Expand

Applicable Algebra in Engineering, Communicationâ€¦

27 September 2004

TLDR

We prove that one can effectively construct a left multiple with polynomial coefficients of L such that every singularity of L that is not apparent is a t-(resp. l)-singularity of L.Expand

The notion of irreducible forms of systems of linear differential equations with formal power series coefficients as defined by Moser [Moser, J., 1960. The order of a singularity in Fuchs' theory.â€¦ Expand

In this paper, we give a new algorithm for computing, given an arbitrary linear differential system with formal power series coefficients as input, an equivalent system which is super-irreducible.Expand

We propose an algorithm to compute rational function solutions for a first order system of linear difference equations with rational coefficients that does not require preliminary uncoupling.Expand

Applicable Algebra in Engineering, Communicationâ€¦

1 September 1993

TLDR

We present a new algorithm for constructing a matrix T such that the transformation Y = TZ reduces the system (1) to an equivalent system (2) where B(x) has the block diagonal form.Expand