From b60411fd461200f71e9195fc0de81b8dfe25e1c9 Mon Sep 17 00:00:00 2001 From: =?utf8?q?S=C3=A9bastien=20Fabbro?= Date: Wed, 14 Dec 2016 05:16:57 +0000 Subject: [PATCH] sci-libs/superlu: added upstream remote-id Package-Manager: portage-2.3.3 --- sci-libs/superlu/metadata.xml | 34 +++++++++++++++++++--------------- 1 file changed, 19 insertions(+), 15 deletions(-) diff --git a/sci-libs/superlu/metadata.xml b/sci-libs/superlu/metadata.xml index b1926bde6b53..01512c58f866 100644 --- a/sci-libs/superlu/metadata.xml +++ b/sci-libs/superlu/metadata.xml @@ -6,19 +6,23 @@ Gentoo Science Project - 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. - + 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. + + + xiaoyeli/superlu + + -- 2.26.2