sci-libs/superlu (gentoo)

Search

Package Information

Description:
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.
Homepage:
https://portal.nersc.gov/project/sparse/superlu/
License:
BSD

Versions

Version EAPI Keywords Slot
7.0.1 8 ~alpha amd64 arm arm64 ~hppa ~loong ~ppc ppc64 ~riscv ~sparc ~x86 0/$(ver_cut 1)
5.3.0 8 ~alpha amd64 arm arm64 ~hppa ~loong ~ppc ppc64 ~riscv ~sparc ~x86 0/$(ver_cut 1)
4.3-r4 8 ~alpha amd64 ~arm ~hppa ~ppc ~ppc64 ~x86 0

Metadata

Description

Maintainers

Upstream

Raw Metadata XML
<pkgmetadata>
	<maintainer type="project">
		<email>sci@gentoo.org</email>
		<name>Gentoo Science Project</name>
	</maintainer>
	<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.
  </longdescription>
	<upstream>
		<remote-id type="github">xiaoyeli/superlu</remote-id>
	</upstream>
</pkgmetadata>

Lint Warnings

USE Flags

Flag Description 7.0.1 5.3.0 4.3-r4
doc Add extra documentation (API, Javadoc, etc). It is recommended to enable per package instead of globally
examples Install examples, usually source code
test Enable dependencies and/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently)

Files

Manifest

Type File Size Versions
DIST superlu-5.3.0.tar.gz 2483070 bytes 5.3.0
DIST superlu-7.0.1.tar.gz 2512312 bytes 7.0.1
Unmatched Entries
Type File Size
DIST superlu_4.3.new.tar.gz 2875951 bytes