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.
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout home:garloff:HPC/superlu && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| abort-message-formatting.diff | 0000000310 310 Bytes | |
| fat-lto-objects.diff | 0000000741 741 Bytes | |
| libsuperlu3.spec | 0000007875 7.69 KB | |
| superlu-3.0.diff | 0000002821 2.75 KB | |
| superlu-dont-opt-away.diff | 0000000599 599 Bytes | |
| superlu-include.patch | 0000006485 6.33 KB | |
| superlu-initialize.diff | 0000077696 75.9 KB | |
| superlu-overflow.patch | 0000002388 2.33 KB | |
| superlu-sharedlib.diff | 0000003426 3.35 KB | |
| superlu-undef-code.diff | 0000001106 1.08 KB | |
| superlu.changes | 0000005259 5.14 KB | |
| superlu_3.0.tar.bz2 | 0000867019 847 KB | |
| superlu_ug.ps.gz | 0000204281 199 KB |
Latest Revision
Kurt Garloff (garloff)
committed
(revision 22)
Add debugging and fat-lto-objects for Tumbleweed/Factory.
Comments 0