mirror of
https://github.com/gentoo-mirror/guru.git
synced 2026-07-10 15:45:15 -04:00
36 lines
1.7 KiB
XML
36 lines
1.7 KiB
XML
<?xml version="1.0" encoding="UTF-8"?>
|
|
<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
|
|
<pkgmetadata>
|
|
<maintainer type="person">
|
|
<description>co-maintainers welcome</description>
|
|
<name>Alessandro Barbieri</name>
|
|
<email>lssndrbarbieri@gmail.com</email>
|
|
</maintainer>
|
|
<use>
|
|
<flag name="combblas">Use CombBLAS as dependency</flag>
|
|
<flag name="complex-precision">Enable complex16 precision library</flag>
|
|
<flag name="double-precision">Enable double precision library</flag>
|
|
<flag name="hip">Enable the HIP libraries</flag>
|
|
<flag name="metis">Use parmetis as dependency</flag>
|
|
<flag name="single-precision">Enable single precision library</flag>
|
|
</use>
|
|
<longdescription lang="en">
|
|
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 is the distributed version (MPI based).
|
|
</longdescription>
|
|
</pkgmetadata>
|