# From toy to production code with sparse matrix and sparse-direct factorizations

**URL:** https://discourse.julialang.org/t/from-toy-to-production-code-with-sparse-matrix-and-sparse-direct-factorizations/89105
**Category:** Performance
**Tags:** sparse, cholmod
**Created:** [October 22, 2022, 12:37pm UTC](https://discourse.julialang.org/t/from-toy-to-production-code-with-sparse-matrix-and-sparse-direct-factorizations/89105 "2022-10-22T12:37:59Z")
**Posts on this page:** 1
**Showing post:** 12

<div class="post-metadata">

### Author: ![Gravlax](https://avatars.discourse-cdn.com/v4/letter/g/dbc845/32.png) [@Gravlax](https://discourse.julialang.org/u/Gravlax)
#### Post date: [October 24, 2022, 7:33pm UTC](https://discourse.julialang.org/t/from-toy-to-production-code-with-sparse-matrix-and-sparse-direct-factorizations/89105/12 "2022-10-24T19:33:51Z")

</div>

Thanks, yes that’s right. I will definitely enjoy the luxury of having 3 different Cholesky factorizations implementations available (CHOLMOD, Pardiso and upcoming Sparpak). I will tests for my specific case. (preconditioning of KSP solvers for 2D FDM/FEM analysis as discussed [here](https://discourse.julialang.org/t/defining-a-preconditionner-for-iterativesolvers/86977/12))

---

_[View the full topic](https://discourse.julialang.org/t/from-toy-to-production-code-with-sparse-matrix-and-sparse-direct-factorizations/89105)._