2011-11-09 11:33:19 +04:00
|
|
|
<?xml version="1.0" encoding="UTF-8"?>
|
2015-08-25 09:01:42 +03:00
|
|
|
<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
|
2011-11-09 11:33:19 +04:00
|
|
|
<pkgmetadata>
|
2016-01-25 16:13:40 +03:00
|
|
|
<maintainer type="project">
|
|
|
|
|
<email>sci@gentoo.org</email>
|
|
|
|
|
<name>Gentoo Science Project</name>
|
|
|
|
|
</maintainer>
|
2012-12-13 11:28:27 +04:00
|
|
|
<longdescription lang="en">
|
2016-12-20 09:40:04 +03:00
|
|
|
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.
|
|
|
|
|
</longdescription>
|
|
|
|
|
<upstream>
|
|
|
|
|
<remote-id type="github">xiaoyeli/superlu</remote-id>
|
|
|
|
|
</upstream>
|
|
|
|
|
|
2011-11-09 11:33:19 +04:00
|
|
|
</pkgmetadata>
|
