# Is it possible to parallelize matrix division

**URL:** <https://discourse.julialang.org/t/is-it-possible-to-parallelize-matrix-division/104398>\
**Category:** Performance\
**Created:** [September 29, 2023, 1:44pm UTC](https://discourse.julialang.org/t/is-it-possible-to-parallelize-matrix-division/104398 "2023-09-29T13:44:39Z")\
**Posts on this page:** 1\
**Showing post:** 2

<div class="post-metadata">

**Author:** ![mikmoore](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/mikmoore/32/31109_2.png) [@mikmoore](https://discourse.julialang.org/u/mikmoore)\
**Post date:** [September 29, 2023, 3:24pm UTC](https://discourse.julialang.org/t/is-it-possible-to-parallelize-matrix-division/104398/2 "2023-09-29T15:24:56Z")

</div>

It’s possible that the default sparse solver may be parallel already (I’m not sure), or at least to the extent it’s possible/useful for the problem and algorithm.

But you might look into other solvers based on different algorithms. Take a look at some of the packages suggested in [this thread](https://discourse.julialang.org/t/solving-sparse-linear-systems-fast/83071/11). Whether or not they’re parallel, they may offer a speed benefit depending on your problem.

---

_[View the full topic](https://discourse.julialang.org/t/is-it-possible-to-parallelize-matrix-division/104398)._