A highly efficient solver for Ax = b, capable of solving sparse symmetric matrices in Compressed Sparse Row (CSR) format of size 100,000 x 100,000. Implemented in C using Successive Over-Relaxation (SOR) numerical method.
-
Notifications
You must be signed in to change notification settings - Fork 0
A highly efficient solver for Ax = b, capable of solving sparse symmetric matrices in Compressed Sparse Row (CSR) format of size 100,000 x 100,000. Implemented in C using Successive Over-Relaxation (SOR) numerical method.
License
inhald/Sparse-Matrix-Solver
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A highly efficient solver for Ax = b, capable of solving sparse symmetric matrices in Compressed Sparse Row (CSR) format of size 100,000 x 100,000. Implemented in C using Successive Over-Relaxation (SOR) numerical method.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published