GitHub / tueboesen / Sparse-iterative-parallel-linear-solver
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.
Stars: 14
Forks: 0
Open issues: 0
License: mit
Language: Fortran
Size: 4.41 MB
Dependencies parsed at: Pending
Created at: over 3 years ago
Updated at: over 1 year ago
Pushed at: about 3 years ago
Last synced at: about 1 year ago
Topics: iterative-linear-solvers, sparse-linear-systems