Abstract
The aim of this paper is to propose a higher order iterative method for computing the outer inverse \(A^{(2)}_{T,S}\) for a given matrix A. Convergence analysis along with the error bounds of the proposed method is established. A number of numerical examples including singular square, rectangular, randomly generated rank deficient matrices and a set of singular matrices obtained from the Matrix Computation Toolbox (mctoolbox) are worked out. The performance measures used are the number of iterations, the mean CPU time (MCT) and the error bounds. The results obtained are compared with some of the existing methods. It is observed that our method gives improved results in terms of both computational speed and accuracy.
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.
