# Moore-Penrose Generalized Inverse of Sparse Matrix

**URL:** https://discourse.julialang.org/t/moore-penrose-generalized-inverse-of-sparse-matrix/17414
**Category:** Optimization (Mathematical)
**Created:** [November 11, 2018, 11:05pm UTC](https://discourse.julialang.org/t/moore-penrose-generalized-inverse-of-sparse-matrix/17414 "2018-11-11T23:05:51Z")
**Posts on this page:** 1
**Showing post:** 2

<div class="post-metadata">

### Author: ![StefanKarpinski](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/stefankarpinski/32/24_2.png) [@StefanKarpinski](https://discourse.julialang.org/u/StefanKarpinski)
#### Post date: [November 11, 2018, 11:40pm UTC](https://discourse.julialang.org/t/moore-penrose-generalized-inverse-of-sparse-matrix/17414/2 "2018-11-11T23:40:04Z")

</div>

The pseudo-inverse of a sparse matrix would almost always be dense, wouldn’t it? Given that, it seems like it doesn’t make too much sense to have a sparse pinv—or if one does it would be equivalent to converting to sense first.

---

_[View the full topic](https://discourse.julialang.org/t/moore-penrose-generalized-inverse-of-sparse-matrix/17414)._
