A Fast Algorithm of Moore-Penrose Inverse for the Loewner-Type Matrix
Joint Authors
Tong, QiuJuan
Lu, Quan
Liu, San-Yang
Source
Mathematical Problems in Engineering
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-01-04
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
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(mn)+O(n2), but it is O(mn2)+O(n3) by using L+=(LTL)−1LT.
American Psychological Association (APA)
Tong, QiuJuan& Liu, San-Yang& Lu, Quan. 2012. A Fast Algorithm of Moore-Penrose Inverse for the Loewner-Type Matrix. Mathematical Problems in Engineering،Vol. 2012, no. 2012, pp.1-7.
https://search.emarefa.net/detail/BIM-1029531
Modern Language Association (MLA)
Tong, QiuJuan…[et al.]. A Fast Algorithm of Moore-Penrose Inverse for the Loewner-Type Matrix. Mathematical Problems in Engineering No. 2012 (2012), pp.1-7.
https://search.emarefa.net/detail/BIM-1029531
American Medical Association (AMA)
Tong, QiuJuan& Liu, San-Yang& Lu, Quan. A Fast Algorithm of Moore-Penrose Inverse for the Loewner-Type Matrix. Mathematical Problems in Engineering. 2012. Vol. 2012, no. 2012, pp.1-7.
https://search.emarefa.net/detail/BIM-1029531
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1029531
