Abstract
In this paper, we present an iterative method based on gradient maximal convergence rate to compute Moore-Penrose inverse A+ of a given matrix A. By this iterative method, when taken the initial matrix X0 = A*, the M-P inverse A+ can be obtained with maximal convergence rate in absence of round off errors. In the end, a numerical example is given to illustrate the effectiveness, accuracy and its computation time, which are all superior than the other methods for the large singular matrix.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
