SuperLU solver for linear systems (CSCMatrix)
http://crd.lbl.gov/~xiaoye/SuperLU/
SuperLU is an algorithm that uses group theory to optimize LU decomposition of sparse matrices. It's the fastest direct solver for linear systems that the author is aware of. Docu can be found on http://www.netlib.org.
Source Files 
| Filename | Size | Changed | Actions |
|---|---|---|---|
| libsuperlu3.spec | 00000076567.48 KB | 1247603078almost 9 years ago | 
|
| superlu-3.0.diff | 00000028212.75 KB | 1247238053almost 9 years ago |
|
| superlu-dont-opt-away.diff | 0000000599599 Bytes | 1168904296over 11 years ago |
|
| superlu-include.patch | 00000064856.33 KB | 1168904296over 11 years ago |
|
| superlu-initialize.diff | 000007769675.9 KB | 1168904296over 11 years ago |
|
| superlu-overflow.patch | 00000023882.33 KB | 1168904296over 11 years ago |
|
| superlu-sharedlib.diff | 00000034263.35 KB | 1247256654almost 9 years ago |
|
| superlu-undef-code.diff | 00000011061.08 KB | 1168904296over 11 years ago |
|
| superlu.changes | 00000052595.14 KB | 1247238054almost 9 years ago |
|
| superlu_3.0.tar.bz2 | 0000867019847 KB | 1168904296over 11 years ago |
|
| superlu_ug.ps.gz | 0000204281199 KB | 1168904296over 11 years ago |
|