By Topic

A Fast Algorithm of Moore-Penrose Inverse for the Symmetric Loewner-Type Matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Qiujuan Tong ; Sch. of Sci., Xidian Univ., Xi'an, China ; Sanyang Liu ; Quan Lu ; Junfeng Chai

Abstract-Symmetric Loewner-type matrix has broad applications in natural sciences and engineering technologies. Many of the issues are summarized for the sake of symmetric Loewner (type) matrix and its correlation matrix algebraic problem. We present a new fast algorithm of Moore-Penrose inverse for an m×n symmetric Loewner-type matrix with full column rank by forming a special block matrix and studying its inverse in this paper. Its computation complexity is O(mn) + O(n2), but it is O(mn2) + O(n3) by using L+ = (LTL)-1 LT. Experimental results also show that the former in terms of time and accuracy are better than the latter.

Published in:

2009 International Conference on Information Engineering and Computer Science

Date of Conference:

19-20 Dec. 2009