L. Huang et al: The Moore–Penrose inverses of matrices over quaternion polynomial rings


Liji Huang, Qing-Wen Wang, Yang Zhang, The Moore–Penrose inverses of matrices over quaternion polynomial rings, Linear Algebra and its Applications, Volume 475, 15 June 2015, Pages 45–61. doi:10.1016/j.laa.2015.02.004

Abstract: In this paper, we define and discuss the Moore–Penrose inverses of matrices with quaternion polynomial entries. When the Moore–Penrose inverses exist, we prove that Leverrier–Faddeev algorithm works for these matrices by using generalized characteristic polynomials. Furthermore, after studying interpolations for quaternion polynomials, we give an efficient algorithm to compute the Moore–Penrose inverses. We developed a Maple package for quaternion polynomial matrices. All algorithms in this paper are implemented, and tested on examples.

Source: http://www.sciencedirect.com/science/article/pii/S0024379515000737

Leave a comment

Filed under publications

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s