FSPAI
Factorized Sparse Approximate Inverses
- This is a dummy textLatest release is 1.0
We developed a sequential and highly scalable parallel C/C++ implementation
of the known FSPAI (Factorized SParse Approximate Inverses) algorithm.
Theory
Implementation and Features
Download
Tested environments
Some References
Authors
License
FSPAI: Factorized Sparse Approximate Inverses
Copyright © 2010-2011, Matous Sedlacek
Research Unit Scientific Computing in Computer Science - Informatics V
Technische Universität München
This program is free software: you can redistribute it and/or modify
it under the
terms of the GNU Lesser General Public License as published by
the Free Software
Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY
WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR
A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with
this program. If not, see http://www.gnu.org/licenses/.
If you obtain any results with FSPAI we would appreciate that you refer to FSPAI.
Further work on Sparse Approximate Inverses
- SPAI: Parallel Implementation on SPAI — Sparse Approximate Inverses:
http://www.computational.unibas.ch/software/spai/ - PARASAILS: Parallel Sparse Approximate Inverse (Least-Squares) Preconditioner:
https://computation.llnl.gov/casc/parasails/parasails.html - HYPRE: Software on high performance preconditioners containing a PARASAILS module:
https://computation.llnl.gov/casc/linear_solvers/sls_hypre.html