Abstract
We briefly review a modular algorithm to perform row reduction of a matrix of Ore polynomials with coefficients in \(\mathbb {Z}[t]\), and describe a practical implementation in Maple that improves over previous modular and fraction-free versions. The algorithm can be used for finding the rank, left nullspace, and the Popov form of such matrices.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Orders in this paper will be with respect to \(\mathrm {\mathbf {F}}(Z)\) and it will not be explicitly stated for the remainder of the paper.
References
Beckermann, B., Cheng, H., Labahn, G.: Fraction-free row reduction of matrices of skew polynomials. In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp. 8–15. ACM (2002)
Cheng, H., Labahn, G.: Modular computation for matrices of ore polynomials. In: Computer Algebra 2006: Latest Advances in Symbolic Algorithms, pp. 43–66 (2007)
Beckermann, B., Cheng, H., Labahn, G.: Fraction-free row reduction of matrices of ore polynomials. J. Symb. Comput. 41(5), 513–543 (2006)
Li, Z.: A Subresultant Theory for Linear Differential, Linear Difference and Ore Polynomials, with Applications. PhD thesis, RISC-Linz, Johannes Kepler University, Linz, Austria, 1996
Li, Z.: A subresultant theory for ore polynomials with applications. In: Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, pp. 132–139. ACM (1998)
Li, Z., Nemes, I.: A modular algorithm for computing greatest common right divisors of ore polynomials. In: Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pp. 282–289. ACM (1997)
Davies, P., Cheng, H., Labahn, G.: Computing popov form of general ore polynomial matrices. Milest. Comput. Algebra (MICA) 2008, 149–156 (2008)
Halas, M., Kotta, U., Li, Z., Wang, H., Yuan, C.: Submersive rational difference systems and formal accessibility. In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pp. 175–182. ACM (2009)
Dumas, J.-G., Giorgi, P., Pernet, C.: FFPACK: finite field linear algebra package. In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, pp. 119–126. ACM (2004)
Loos, R.: Generalized Polynomial Remainder Sequences. In: Computer Algebra: Symbolic and Algebraic Computation, pp. 115–137. Springer, New York (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, H., Labahn, G. (2014). A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices. In: Feng, R., Lee, Ws., Sato, Y. (eds) Computer Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43799-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-43799-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43798-8
Online ISBN: 978-3-662-43799-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)