Skip to main content

Computing Moore-Penrose Inverses of Ore Polynomial Matrices

  • Conference paper
Mathematical Software – ICMS 2014 (ICMS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8592))

Included in the following conference series:

  • 1999 Accesses

Abstract

In this paper we define and discuss the generalized inverse and Moore-Penrose inverse for Ore polynomial matrices. Based on GCD computations and Leverrier-Faddeeva method, some fast algorithms for computing these inverses are constructed, and the corresponding Maple package including quaternion case is developed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnett, S.: Leverrier’s algorithm: a new proof and extensions. SIAM J. Matrix Anal. Appl. 10, 551–556 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Beckermann, B., Cheng, H., Labahn, G.: Fraction-free Row Reduction of Matrices of Ore Polynomials. Journal of Symbolic Computation 41(5), 513–543 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ben-Israel, A., Greville, T.N.E.: Generalized Inverses: Theory and Applications, 2nd edn. Springer, New York (2003)

    Google Scholar 

  4. Bostan, A., Chyzak, F., Li, Z., Salvy, B.: Fast computation of common left multiples of linear ordinary differential operators. In: Proceedings of the 2012 International Symposium on Symbolic and Algebraic Computation, pp. 99–106. ACM Press (2012)

    Google Scholar 

  5. Damiano, A., Gentili, G., Sreuppa, D.: Computations in the ring of quaternionic polynomials. J. of Symbolic Computation 45, 38–45 (2010)

    Article  MATH  Google Scholar 

  6. Decell, H.P.: An application of the Cayley-Hamilton theorem to generalized matrix inversion. SIAM Rev. 7, 526–528 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  7. Faddeeva, V.N.: Computational methods of linear algebra. Dover books on advanced mathematics. Dover Publications (1959)

    Google Scholar 

  8. Giesbrecht, M., Sub Kim, M.: Computation of the Hermite form of a Matrix of Ore Polynomials. Journal of Algebra 376, 341–362 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gordon, B., Motzkin, T.S.: On the zeros of polynomials over division rings. Trans. Amer. Math. Soc. 116, 218–226 (1965)

    Article  MathSciNet  Google Scholar 

  10. Horn, R.A., Johnson, C.R.: Matrix analysis. Cambridge University Press (1990)

    Google Scholar 

  11. Huang, L., Zhang, Y.: Maple package for quaternion matrices, The University of Manitoba (2013)

    Google Scholar 

  12. Jacobson, N.: The Theory of Rings. Amer. Math. Soc., New York (1943)

    Book  MATH  Google Scholar 

  13. Jones, J., Karampetakis, N.P., Pugh, A.C.: The computation and application of the generalized inverse via Maple. J. Symbolic Comput. 25, 99–124 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lam, T.Y.: A first course in noncommutative rings. Graduate Texts in Mathematics, vol. 131. Springer (2001)

    Google Scholar 

  15. Liand, 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 Press (1997)

    Google Scholar 

  16. Niven, I.: The roots of a quaternion. Amer. Math. Monthly 49, 386–388 (1942)

    Article  MATH  MathSciNet  Google Scholar 

  17. Opfer, G.: Polynomials and Vandermonde matrices over the field of quaternions. Electronic Transactions on Numerical Analysis 36, 9–16 (2009)

    MATH  MathSciNet  Google Scholar 

  18. Pereira, R., Rocha, P.: On the determinant of quaternionic polynomial matrices and its application to system stability. Math. Meth. Appl. Sci. 31, 99–122 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  19. Pereira, R., Rocha, P., Vettori, P.: Algebraic tools for the study of quaternionic behavioral systems. Linear Algebra and its Applications 400, 121–140 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  20. Pereira, R., Vettori, P.: Stability of Quaternionic linear systems. IEEE Transactions on Automatic Control 51, 518–523 (2006)

    Article  MathSciNet  Google Scholar 

  21. Penrose, R.: A generalized inverse for matrices. Proc. Cambridge Philos. Soc. 51, 406–413 (1955)

    Article  MATH  MathSciNet  Google Scholar 

  22. Puystjens, R.: Moore-Penrose inverses for matrices over some Noetherian rings. J. Pure Appl. Algebra 31(1-3), 191–198 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  23. Zhang, F.: Quaternions and matrices of quaternions. Linear Algebra and its Applications 251, 21–57 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  24. Ziegler, M.: Quasi-optimal arithmetic for quaternion polynomials. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 705–715. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Y. (2014). Computing Moore-Penrose Inverses of Ore Polynomial Matrices. In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_73

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44199-2_73

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44198-5

  • Online ISBN: 978-3-662-44199-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics