Please use this identifier to cite or link to this item:
|Title:||Computing the Moore-Penrose inverse using its error bounds|
|Citation:||Applied Mathematics and Computation, 2020, Vol.371, , pp.-|
|Abstract:||A new iterative scheme for the computation of the Moore-Penrose generalized inverse of an arbitrary rectangular or singular complex matrix is proposed. The method uses appropriate error bounds and is applicable without restrictions on the rank of the matrix. But, it requires that the rank of the matrix is known in advance or computed beforehand. The method computes a sequence of monotonic inclusion interval matrices which contain the Moore-Penrose generalized inverse and converge to it. Successive interval matrices are constructed by using previous approximations generated from the hyperpower iterative method of an arbitrary order and appropriate error bounds of the Moore-Penrose inverse. A convergence theorem of the introduced method is established. Numerical examples involving randomly generated matrices are presented to demonstrate the efficacy of the proposed approach. The main property of our method is that the successive interval matrices are not defined using principles of interval arithmetic, but using accurately defined error bounds of the Moore-Penrose inverse. 2019 Elsevier Inc.|
|Appears in Collections:||1. Journal Articles|
Files in This Item:
|5 Computing the Moore-Penrose inverse.pdf||795.46 kB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.