A novel iterative method for computing generalized inverse
Youshen Xia1, Tianping Chen, Jinjun Shan
1College of Mathematics and Computer Science, Fuzhou University, Fuzhou, Fujian 350002, China ysxia2001@yahoo.com.
Abstract:
In this letter, we propose a novel iterative method for computing generalized inverse, based on a novel KKT formulation. The proposed iterative algorithm requires making four matrix and vector multiplications at each iteration and thus has low computational complexity. The proposed method is proved to be globally convergent without any condition. Furthermore, for fast computing generalized inverse, we present an acceleration scheme based on the proposed iterative method. The global convergence of the proposed acceleration algorithm is also proved. Finally, the effectiveness of the proposed iterative algorithm is evaluated numerically.
Related Concept Videos
Newton’s Method
Inverse z-Transform by Partial Fraction Expansion
To begin the process, the poles of the function are identified and the function is...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Gaussian Elimination: Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Deconvolution
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...

