علیرضا عطایی

Through extensive numerical experiments, the results indicate that the improved qrginv algorithm not only yields a more precise pseudoinverse but also significantly reduces computation time compared to existing methods. This advancement has practical implications for various applications in applied mathematics and computational science, where efficient matrix computations are essential. In 2011 Katsikis et al. presented a computational method to calculate the Pseudoinverse of an arbitrary matrix. In this paper, an improved version of this method is presented for computing the Moore- Penrose of a 𝑚 × 𝑛 real matrix A with rank 𝑟 > 0. Numerical experiments show that the resulting Moore- Penrose matrix is reasonably accurate and its computation time is significantly less than that obtained by Katsikis et al.