The EGRR package implements in Maple 2016 a family of algorithms for transforming a full-rank system to a system having a nonsingular revealing matrix of a desired type.
We consider an arbitrary order linear ordinary system S of differential equations with polynomial coefficients:
An(x) diff(y(x),x$n) + … + A1(x) diff(y(x),x) + A0(x) y(x) = 0,
where
For any full rank system S:
- the algorithm EG constructs an l-embracing system, whose the leading matrix coefficient being invertible, and with the set of solutions containing all the solutions of S;
- the algorithm RR constructs an equivalent system, whose the frontal matrix being invertible;
- the algorithm TriangleEG constructs an l-embracing system, whose the leading matrix coefficient being triangular, and with the set of solutions containing all the solutions of S;
- the algorithm TriangleRR constructs an equivalent system, whose the frontal matrix coefficient being triangular.
The details are to be available in the paper S.A. Abramov, A.A. Ryabenko, and D. E. Khmelnov. Revealing Matrices of Linear Differential Systems of Arbitrary Order. Programming and Computer Software, 2017, Vol.43, No.2, pp. 67-74.
Each procedure of the EGRR package has three input parameters:
The values returned are a sequence of two elements: