Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 301971, 7 pages
Research Article

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

1School of Science, Xidian University, Xi'an 710071, China
2School of Science, Xi'an University of Post and Telecommunications, Xi'an 710061, China
3Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an 710072, China

Received 25 July 2011; Accepted 8 October 2011

Academic Editor: Tadeusz Kaczorek

Copyright © 2012 QiuJuan Tong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


In this paper, we present a fast algorithm of Moore-Penrose inverse for Loewner-type matrix with full column rank by forming a special block matrix and studying its inverse. Its computation complexity is , but it is by using .