| Name: | SuperLUMT |
|---|---|
| Version: | 3.1.0 |
| Release: | 24.el8 |
| Architecture: | x86_64 |
| Group: | Unspecified |
| Size: | 273424 |
| License: | BSD |
| RPM: | SuperLUMT-3.1.0-24.el8.x86_64.rpm |
| Source RPM: | SuperLUMT-3.1.0-24.el8.src.rpm |
| Build Date: | Wed Nov 27 2019 |
| Build Host: | jenkins-10-147-72-125-bac5542f-61c6-401e-b77d-0b3f5c5c5425.appad1iad.osdevelopmeniad.oraclevcn.com |
| Vendor: | Oracle America |
| URL: | http://crd-legacy.lbl.gov/~xiaoye/SuperLU/ |
| Summary: | Single precision real SuperLU routines for shared memory parallel machines |
| Description: | Subroutines to solve sparse linear systems for shared memory parallel machines. SuperLU contains a set of subroutines to solve a sparse linear system A*X=B. It uses Gaussian elimination with partial pivoting (GEPP). The columns of A may be preordered before factorization; the preordering for sparsity is completely separate from the factorization. |