Sisyphus repository
Last update: 1 october 2023 | SRPMs: 18631 | Visits: 37882117
en ru br
ALT Linux repos
S:5.2.2-alt1.1
5.0: 3.1-alt1.M50.1

Group :: Sciences/Mathematics
RPM: superlu

 Main   Changelog   Spec   Patches   Sources   Download   Gear   Bugs and FR  Repocop 

%define altname superlu_dist

Name: superlu
Version: 3.1
Release: alt1.M50.1
Summary: A set of subroutines to solve a sparse linear system A*X=B
License: BSD-like
Group: Sciences/Mathematics
Url: http://acts.nersc.gov/superlu/
Packager: Eugeny A. Rostovtsev (REAL) <real at altlinux.org>

Source: http://crd.lbl.gov/~xiaoye/SuperLU/superlu_3.1.tar.gz

Requires: lib%name-devel = %version-%release
Conflicts: %altname

BuildPreReq: gcc-fortran gcc-c++ libatlas-devel-static liblapack-devel-static
BuildPreReq: csh doxygen

%description
SuperLU contains a set of subroutines to solve a sparse linear system
A*X=B. It uses Gaussian elimination with partial pivoting (GEPP).
The columns of A may be preordered before factorization; the
preordering for sparsity is completely separate from the factorization.
SuperLU provides functionality for both real and complex matrices, in both
single and double precision.

%package -n lib%name-devel
Summary: Development files for SuperLU
Group: Development/C
Requires: %name = %version-%release
Conflicts: lib%altname-devel

%description -n lib%name-devel
SuperLU contains a set of subroutines to solve a sparse linear system
A*X=B. It uses Gaussian elimination with partial pivoting (GEPP).
The columns of A may be preordered before factorization; the
preordering for sparsity is completely separate from the factorization.
SuperLU provides functionality for both real and complex matrices, in both
single and double precision.

This package contains static libraries and headers of SuperLU.

%package -n lib%name-devel-doc
Summary: Documentation for SuperLU
Group: Development/Documentation
BuildArch: noarch

%description -n lib%name-devel-doc
SuperLU contains a set of subroutines to solve a sparse linear system
A*X=B. It uses Gaussian elimination with partial pivoting (GEPP).
The columns of A may be preordered before factorization; the
preordering for sparsity is completely separate from the factorization.
SuperLU provides functionality for both real and complex matrices, in both
single and double precision.

This package contains documentation for SuperLU.

%prep
%setup

%build
sed -i "s|(HOME)|$PWD|" make.inc
sed -i "s|(LIBDIR)|%_libdir|" make.inc
%make_build superlulib tmglib doc

%install
install -d %buildroot%_libdir
install -d %buildroot%_includedir
install -d %buildroot%_docdir/%name/html
install -m644 SRC/*.h %buildroot%_includedir
install -m644 *.a %buildroot%_libdir
install -m644 DOC/*.pdf %buildroot%_docdir/%name
install -m644 DOC/html/* %buildroot%_docdir/%name/html

%files
%doc README

%files -n lib%name-devel
%_libdir/*
%_includedir/*

%files -n lib%name-devel-doc
%_docdir/%name

%changelog

Full changelog you can see here

 
design & coding: Vladimir Lettiev aka crux © 2004-2005, Andrew Avramenko aka liks © 2007-2008
current maintainer: Michael Shigorin