#
iterative-linear-solvers
Here are 2 public repositories matching this topic...
Numerical computation in native Haskell
matrixlinear-algebrasparse-systemsmatrix-factorizationsparse-datanumerical-calculationsscientific-computinglinear-systemseigenvectorsscientific-computationssparse-linear-systemsnumerical-methodsiterative-methodsmatrix-transposesparse-vectorseigenvaluesmatrix-computationsmatrix-productlu-factorizationiterative-linear-solvers
- Updated
Aug 21, 2020 - 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.
- Updated
May 20, 2022 - Fortran
Improve this page
Add a description, image, and links to theiterative-linear-solvers topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with theiterative-linear-solvers topic, visit your repo's landing page and select "manage topics."