Abstract
If the leading matrix of a linear differential system is nonsingular, then its determinant is known to bear useful information about solutions of the system. Of interest is also the frontal matrix. However, each of these matrices (we call them revealing matrices) may occur singular. In the paper, a brief survey of algorithms for transforming a system of full rank to a system with a nonsingular revealing matrix of a desired type is given. The same transformations can be used to check whether the rank of the original system is full. A Maple implementation of these algorithms (package EGRR) is discussed, and results of comparison of estimates of their complexity with actual operation times on a number of examples are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abramov, S.A., On the differential and full algebraic complexities of operator matrices transformations, Proc. of CASC 2016, 2016, pp. 1–14.
van der Put, M. and Singer, M.F., Galois Theory of Linear Differential Equations, Grundlehren der mathematischen Wissenschaften 328, Heidelberg: Springer, 2003.
Rosenlicht, M., Integration in finite terms, Am. Math. Monthly, 1972, vol. 79, no. 9, pp. 963–972.
Abramov, S.A. and Barkatou, M.A., On the dimension of solution spaces of full rank linear differential systems, Proc. of CASC 2013, 2013, pp. 1–9.
Abramov, S. and Barkatou, M., On solution spaces of products of linear differential or difference operators, ACM Commun. Comput. Algebra, 2014, vol. 48, no. 4, pp. 155–165.
Miyake, M., Remarks on the formulation of the Cauchy problem for general system of ordinary differential equations, Tohoku Math. J., 1980, vol. 32, no. 1, pp. 79–89.
Abramov, S. and Bronstein, M., On solutions of linear functional systems, Proc. of ISSAC 2001, 2001, pp. 1–6.
Abramov, S.A. and Bronstein, M., Linear algebra for skew-polynomial matrices, Rapport de Recherche INRIA, RR-4420, March 2002. http://www.inria.fr/ RRRT/RR-4420.html.
Abramov, S.A. and Khmelnov, D.E., On singular points of solutions of linear differential systems with polynomial coefficients, J. Math. Sci., 2012, vol. 185, no. 3, pp. 347–359.
Beckermann, B., Cheng, H., and Labahn, G., Fraction-free row reduction of matrices of Ore polynomials, J. Symbolic Computation, 2006, vol. 41, no. 5, pp. 513–543.
Barkatou, M.A., El Bacha, C., Labahn, G.,and Pflugel, E., On simultaneous row and column reduction of higher-order linear differential systems, J. Symbolic Computation, 2013, vol. 49, pp. 45–64.
Abramov, S., EG-eliminations, J. Difference Equations Appl., 1999, vol. 5, nos. 4–5, pp. 393–433.
Mulders, T. and Storjohann, A., On lattice reduction for polynomial matrices, J. Symbolic Computation, 2003, vol. 35, no. 4, pp. 377–401.
Maple online help. http: //www.maplesoft.com/support/ help/
Giesbrecht, M. and Sub Kim, M., Computing the Hermite form of a matrix of Ore polynomials, J. Algebra, 2013, vol. 376, pp. 341–362.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © S.A. Abramov, A.A. Ryabenko, D.E. Khmelnov, 2017, published in Programmirovanie, 2017, Vol. 43, No. 2.
Rights and permissions
About this article
Cite this article
Abramov, S.A., Ryabenko, A.A. & Khmelnov, D.E. Revealing matrices of linear differential systems of arbitrary order. Program Comput Soft 43, 67–74 (2017). https://doi.org/10.1134/S0361768817020025
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0361768817020025