superlu 5.2.1+dfsg1-ok1 source package in openKylin
Changelog
superlu (5.2.1+dfsg1-ok1) yangtze; urgency=medium * Build for openKylin. -- openKylinBot <email address hidden> Mon, 25 Apr 2022 22:03:04 +0800
superlu (5.2.1+dfsg1-ok1) yangtze; urgency=medium * Build for openKylin. -- openKylinBot <email address hidden> Mon, 25 Apr 2022 22:03:04 +0800
Series | Published | Component | Section | |
---|---|---|---|---|
Yangtze V1.0 | release | main | devel |
File | Size | SHA-256 Checksum |
---|---|---|
superlu_5.2.1+dfsg1.orig.tar.xz | 686.1 KiB | 6b09d9ad5f384300e9d2c85ccabb88e748405fbf768c79d7325bf1b8aba9d5e1 |
superlu_5.2.1+dfsg1-ok1.debian.tar.xz | 5.0 KiB | c973172e43a0459b8adc0f01dce63228746560dbd8e46af749b1a8d98915edb1 |
superlu_5.2.1+dfsg1-ok1.dsc | 2.0 KiB | c48dbd7a3a9e11c0fcbd3ea1b0fa0c55b07d42efcdc271cfd887f97581236b2c |
Development files for SuperLU.
.
SuperLU is a general purpose library for the direct solution of
large, sparse, nonsymmetric systems of linear equations on high
performance machines.
.
The library is written in C and is callable from either C or Fortran.
The library routines will perform an LU decomposition with partial
pivoting and triangular system solves through forward and back
substitution. The LU factorization routines can handle non-square
matrices but the triangular solves are performed only for square
matrices. The matrix columns may be preordered (before factorization)
either through library or user supplied routines. This preordering
for sparsity is completely separate from the factorization. Working
precision iterative refinement subroutines are provided for improved
backward stability. Routines are also provided to equilibrate the
system, estimate the condition number, calculate the relative
backward error, and estimate error bounds for the refined solutions.
.
This package contains the header and development files to build
against SuperLU.
This package contains the user guide and the reference manual of SuperLU.
It also includes some example programs.
SuperLU is a general purpose library for the direct solution of
large, sparse, nonsymmetric systems of linear equations on high
performance machines.
.
The library is written in C and is callable from either C or Fortran.
The library routines will perform an LU decomposition with partial
pivoting and triangular system solves through forward and back
substitution. The LU factorization routines can handle non-square
matrices but the triangular solves are performed only for square
matrices. The matrix columns may be preordered (before factorization)
either through library or user supplied routines. This preordering
for sparsity is completely separate from the factorization. Working
precision iterative refinement subroutines are provided for improved
backward stability. Routines are also provided to equilibrate the
system, estimate the condition number, calculate the relative
backward error, and estimate error bounds for the refined solutions.
.
This package contains the SuperLU shared library.