Iterative methods for approximating inverse and Moore-Penrose inverse of sparse matrices computing

Abstract

This thesis shows iterative methods for computing the inverse matrix or the Moore-Penrose pseudoinverse based on the Schulz method. The methods are then implemented in GNU Octave and PETSc to show the difference between the two languages. In the end, various experiments are performed to see how well these methods perform, and how well they scale for parallelization.