A Fast Algorithm of Moore-Penrose Inverse for the Loewner-Type Matrix. (4th January 2012)

• Record Type: Journal Article
• Authors: Tong, QiuJuan; Liu, SanYang; Lu, Quan
• Other Names: Kaczorek Tadeusz Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2012(2012)
• Publication Date: 2012-01-04
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2012/301971
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : In this paper, we present a fast algorithm of Moore-Penrose inverse for m × n Loewner-type matrix with full column rank by forming a special block matrix and studying its inverse. Its computation complexity is O ( m n ) + O ( n 2 ), but it is O ( m n 2 ) + O ( n 3 ) by using L + = ( L T L ) − 1 L T .