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 SUSE:SLE-15-SP1:Update
-
Checkout Package
osc checkout SUSE:SLE-15-SP2:Update/superlu && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
README.SUSE | 0000000434 434 Bytes | |
_multibuild | 0000000084 84 Bytes | |
superlu-4.3-dont-opt-away.diff | 0000000537 537 Bytes | |
superlu-4.3-include.patch | 0000000808 808 Bytes | |
superlu-5.2-make.patch | 0000001411 1.38 KB | |
superlu-5.2-remove-mc64ad.patch | 0000000942 942 Bytes | |
superlu-examples_Makefile_remove_itersol.patch | 0000003357 3.28 KB | |
superlu-make.linux.patch | 0000000418 418 Bytes | |
superlu.changes | 0000011451 11.2 KB | |
superlu.spec | 0000007897 7.71 KB | |
superlu_5.2.1.tar.gz | 0002560875 2.44 MB | |
superlu_ug.pdf | 0000687318 671 KB |
Latest Revision
Samu Voutilainen (Smar)
committed
(revision 1)
osc copypac from project:openSUSE.org:SUSE:SLE-15-SP1:Update package:superlu revision:b1e0f7ce24c948b88fdf231dab784e9b
Comments 0