  A cumbersome operation in numerical analysis and linear algebra,
optimization, machine learning and engineering algorithms; is inverting large
full-rank matrices which appears in various processes and applications. This
has both numerical stability and complexity issues, as well as high expected
time to compute. We address the latter issue, by proposing an algorithm which
uses a black-box least squares optimization solver as a subroutine, to give an
estimate of the inverse (and pseudoinverse) of real nonsingular matrices; by
estimating its columns. This also gives it the flexibility to be performed in a
distributed manner, thus the estimate can be obtained a lot faster, and can be
made robust to \textit{stragglers}. Furthermore, we assume a centralized
network with no message passing between the computing nodes, and do not require
a matrix factorization; e.g. LU, SVD or QR decomposition beforehand.
