A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices

Conference paper

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.

References

  1. 1.
    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)Google Scholar
  2. 2.
    Cheng, H., Labahn, G.: Modular computation for matrices of ore polynomials. In: Computer Algebra 2006: Latest Advances in Symbolic Algorithms, pp. 43–66 (2007)Google Scholar
  3. 3.
    Beckermann, B., Cheng, H., Labahn, G.: Fraction-free row reduction of matrices of ore polynomials. J. Symb. Comput. 41(5), 513–543 (2006)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Li, Z.: A Subresultant Theory for Linear Differential, Linear Difference and Ore Polynomials, with Applications. PhD thesis, RISC-Linz, Johannes Kepler University, Linz, Austria, 1996Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Davies, P., Cheng, H., Labahn, G.: Computing popov form of general ore polynomial matrices. Milest. Comput. Algebra (MICA) 2008, 149–156 (2008)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Loos, R.: Generalized Polynomial Remainder Sequences. In: Computer Algebra: Symbolic and Algebraic Computation, pp. 115–137. Springer, New York (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceUniversity of LethbridgeLethbridgeCanada
  2. 2.Symbolic Computation Group, David R. Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations