Convergence Acceleration of Iterative Methods for Inverting Real Matrices Using Frobenius Norm Minimization
Ajinkya Borle, Samuel J. Lomonaco
Abstract
Ajinkya Borle, Samuel J. Lomonaco
Abstract
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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Matrix norm, Convergence (economics), Acceleration, Iterative method, Minification, Norm (philosophy), Matrix (chemical analysis), Computer science