Convergence Acceleration of Iterative Methods for Inverting Real Matrices Using Frobenius Norm Minimization

The Schulz-type methods for computing generalized matrix inverses are a family of iterative methods that are popular for their high order of convergence (≥ 2). We propose two new scaled acceleration techniques for such type of iterative methods for real matrices (based on Frobenius norm minimization) and lay out efficient algorithms to implement these techniques. Test results show one of our techniques to be most effective for dense matrices but also works for sparse cases as well.