1 Summary: COLAMD: column approximate minimum degree
7 Source0: http://www.cise.ufl.edu/research/sparse/colamd/COLAMD-%{version}.tar.gz
8 # Source0-md5: 49e185756896c1e918a535ec409c48b9
9 URL: http://www.cise.ufl.edu/research/sparse/colamd/
10 Patch0: %{name}-ufconfig.patch
11 Patch1: %{name}-shared.patch
12 BuildRequires: UFconfig
13 BuildRoot: %{tmpdir}/%{name}-%{version}-root-%(id -u -n)
16 The COLAMD column approximate minimum degree ordering algorithm
17 computes a permutation vector P such that the LU factorization of A
18 (:,P) tends to be sparser than that of A. The Cholesky factorization
19 of (A (:,P))'*(A (:,P)) will also tend to be sparser than that of
20 A'*A. SYMAMD is a symmetric minimum degree ordering method based on
21 COLAMD, available as a MATLAB-callable function. It constructs a
22 matrix M such that M'*M has the same pattern as A, and then uses
23 COLAMD to compute a column ordering of M. Colamd and symamd tend to be
24 faster and generate better orderings than their MATLAB counterparts,
28 Summary: Header files for colamd library
29 Group: Development/Libraries
30 Requires: %{name} = %{version}-%{release}
34 Header files for colamd library.
37 Summary: Static colamd library
38 Group: Development/Libraries
39 Requires: %{name}-devel = %{version}-%{release}
42 Static colamd library.
55 rm -rf $RPM_BUILD_ROOT
57 DESTDIR=$RPM_BUILD_ROOT
59 install -D colamd.h $RPM_BUILD_ROOT%{_includedir}/colamd.h
62 rm -rf $RPM_BUILD_ROOT
64 %post -p /sbin/ldconfig
65 %postun -p /sbin/ldconfig
68 %defattr(644,root,root,755)
70 %attr(755,root,root) %{_libdir}/libcolamd.so.*.*.*
73 %defattr(644,root,root,755)
74 %{_libdir}/libcolamd.la
75 %{_libdir}/libcolamd.so
76 %{_includedir}/colamd.h
79 %defattr(644,root,root,755)
80 %{_libdir}/libcolamd.a