amg_match
| Crates.io | amg_match |
| lib.rs | amg_match |
| version | 0.1.0 |
| source | src |
| created_at | 2024-04-04 00:26:34.870693 |
| updated_at | 2024-04-04 00:26:34.870693 |
| description | Research iterative solver utilities |
| homepage | |
| repository | https://github.com/aujxn/amg_match |
| max_upload_size | |
| id | 1195698 |
| size | 5,089,500 |
Austen (aujxn)
documentation
README
AMG Match
AMG Match is research project for studying adaptive multigrid methods for solving large and sparse positive definite matrix systems. A few different smoothers and preconditioners are available and a couple iterative methods are implemented.
This is a work in progress and needs tons of work but if anyone needs a
sparse iterative solver to go on top of nalgebra-sparse this may be
of use.
Features
[x] Stationary solver [x] Preconditioned Conjugate Gradient [x] mu-cycle AMG solver / preconditioner [x] L1 and Gauss-Seidel smoothers [x] Triangular solvers (for Gauss-Seidel)
License
MIT 2022 Austen Nelson