Abstract
This paper describes an iterative method for orthogonal projections <TEX>$AA^+$</TEX> and <TEX>$A^+A$</TEX> of an arbitrary matrix A, where <TEX>$A^+$</TEX> represents the Moore-Penrose inverse. Convergence analysis along with the first and second order error estimates of the method are investigated. Three numerical examples are worked out to show the efficacy of our work. The first example is on a full rank matrix, whereas the other two are on full rank and rank deficient randomly generated matrices. The results obtained by the method are compared with those obtained by another iterative method. The performance measures in terms of mean CPU time (MCT) and the error bounds for computing orthogonal projections are listed in tables. If <TEX>$Z_k$</TEX>, k = 0,1,2,... represents the k-th iterate obtained by our method then the sequence of the traces {trace(<TEX>$Z_k$</TEX>)} is a monotonically increasing sequence converging to the rank of (A). Also, the sequence of traces {trace(<TEX>$I-Z_k$</TEX>)} is a monotonically decreasing sequence converging to the nullity of <TEX>$A^*$</TEX>.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
