SuperLU matrix solver
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.
- Sources inherited from project openSUSE:Factory:Rings:1-MinimalX
- Links to openSUSE:Factory / superlu
- Has a link diff
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory:Staging:J/superlu && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| README.SUSE | 0000000503 503 Bytes | |
| _multibuild | 0000000084 84 Bytes | |
| get-tarball.sh | 0000000550 550 Bytes | |
| superlu-7.0.0.tar.gz | 0002460826 2.35 MB | |
| superlu-make.linux.patch | 0000000397 397 Bytes | |
| superlu-remove-mc64ad.patch | 0000001011 1011 Bytes | |
| superlu.changes | 0000015280 14.9 KB | |
| superlu.rpmlintrc | 0000000464 464 Bytes | |
| superlu.spec | 0000007853 7.67 KB |
Latest Revision
Yuchen Lin (maxlin_factory)
committed
(revision 1)
Comments 0