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

QiuJuan Tong, SanYang Liu and Quan Lu

Mathematical Problems in Engineering, 2012, vol. 2012, 1-7

Abstract:

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 .

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2012/301971.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2012/301971.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:301971

DOI: 10.1155/2012/301971

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().