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.