Two inverse-of-N-free methods for AM,N†

Jun Ji

Applied Mathematics and Computation, 2014, vol. 232, issue C, 39-48

Abstract: We develop a new representation for the weighted Moore–Penrose inverse AM,N† of a matrix A. From this novel expression, we develop a Gauss–Jordan elimination method and a QR-based method for the computation of AM,N†. One major feature of our methods is that they do not need to compute the inverse of N. Thus, the new methods are less sensitive than the traditional Q-method on the conditioning of N. The former is suitable for computing the generalized inverses of matrices of low order “by hand” and the latter is efficient and robust for matrices of high order. Preliminary numerical testing indicates that the QR-based method is faster than the Matlab’s pinv function for A†.

Keywords: Explicit expression; Gauss–Jordan elimination; Moore–Penrose inverse; QR decomposition; Weighted Moore–Penrose inverse (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314000861
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:232:y:2014:i:c:p:39-48

DOI: 10.1016/j.amc.2014.01.049

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().