Numerical computation in native Haskell
-
Updated
Aug 21, 2020 - Haskell
Numerical computation in native Haskell
This is a sparse iterative parallel linear solver I developed during my PhD. The solver works by splitting the matrix into blocks which are then solved in parallel. The solver assumes the input matrix to already have been ordered by a Reverse Cuthill-Mckee reordering algorithm.
Add a description, image, and links to the iterative-linear-solvers topic page so that developers can more easily learn about it.
To associate your repository with the iterative-linear-solvers topic, visit your repo's landing page and select "manage topics."