| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8901234 | Applied Mathematics and Computation | 2018 | 11 Pages |
Abstract
In this paper, two new algorithms for computing the Weighted Moore-Penrose inverse AM,Nâ of a general matrix A for weights M and N which are based on elementary row and column operations on two appropriate block partitioned matrices are introduced and investigated. The computational complexity of the introduced two algorithms is analyzed in detail. These two algorithms proposed in this paper are always faster than those in Sheng and Chen (2013) and Ji (2014), respectively, by comparing their computational complexities. In the end, an example is presented to demonstrate the two new algorithms.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Xingping Sheng,