suitesparse 1:5.7.1+dfsg-2 source package in Ubuntu
Changelog
suitesparse (1:5.7.1+dfsg-2) unstable; urgency=medium
* libatomic.patch: new patch, should fix FTBFS on armel, mipsel, m68k
and powerpc
-- Sébastien Villemot <email address hidden> Sat, 29 Feb 2020 14:16:34 +0100
Upload details
- Uploaded by:
- Debian Science Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Science Team
- Architectures:
- any all
- Section:
- math
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Focal | release | main | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| suitesparse_5.7.1+dfsg-2.dsc | 3.0 KiB | 4da625fc62ec35bfe9a91c62ff8d508407ebe69364e15c8819508d32ea4d8110 |
| suitesparse_5.7.1+dfsg.orig.tar.xz | 35.0 MiB | 47edbe6d1ed2ed00a0d08ecdbad0a57712d87efd3968c7d362cdf475ad597af7 |
| suitesparse_5.7.1+dfsg-2.debian.tar.xz | 41.7 KiB | c8c1681fa3a2518795c31f482ebd15160d33f0f9edff81558a09f84c701516f9 |
Available diffs
- diff from 1:5.7.1+dfsg-1 to 1:5.7.1+dfsg-2 (914 bytes)
No changes file available.
Binary packages built by this source
- libamd2: approximate minimum degree ordering library for sparse matrices
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The AMD library provides a set of routines for pre-ordering sparse matrices
prior to Cholesky or LU factorization, using the "Approximate Minimum Degree
ordering" algorithm.
- libamd2-dbgsym: No summary available for libamd2-dbgsym in ubuntu groovy.
No description available for libamd2-dbgsym in ubuntu groovy.
- libbtf1: No summary available for libbtf1 in ubuntu groovy.
No description available for libbtf1 in ubuntu groovy.
- libbtf1-dbgsym: No summary available for libbtf1-dbgsym in ubuntu groovy.
No description available for libbtf1-dbgsym in ubuntu groovy.
- libcamd2: No summary available for libcamd2 in ubuntu groovy.
No description available for libcamd2 in ubuntu groovy.
- libcamd2-dbgsym: debug symbols for libcamd2
- libccolamd2: constrained column approximate library for sparse matrices
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The CCOLAMD library implements the "Constrained COLumn Approximate Minimum
Degree ordering" algorithm. It computes a permutation vector P such that the
LU factorization of A (:,P) tends to be sparser than that of A. The Cholesky
factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser than that
of A'*A.
- libccolamd2-dbgsym: No summary available for libccolamd2-dbgsym in ubuntu groovy.
No description available for libccolamd2-dbgsym in ubuntu groovy.
- libcholmod3: sparse Cholesky factorization library for sparse matrices
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The CHOLMOD library provides a set of routines for factorizing sparse
symmetric positive definite matrices of the form A or AA', updating/downdating
a sparse Cholesky factorization, solving linear systems, updating/downdating
the solution to the triangular system Lx=b, and many other sparse matrix
functions for both symmetric and unsymmetric matrices. Its supernodal Cholesky
factorization relies on LAPACK and the Level-3 BLAS, and obtains a substantial
fraction of the peak performance of the BLAS.
- libcholmod3-dbgsym: No summary available for libcholmod3-dbgsym in ubuntu groovy.
No description available for libcholmod3-dbgsym in ubuntu groovy.
- libcolamd2: column approximate minimum degree ordering library for sparse matrices
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The COLAMD library implements the "COLumn Approximate Minimum Degree ordering"
algorithm. It computes a permutation vector P such that the LU factorization
of A (:,P) tends to be sparser than that of A. The Cholesky factorization of
(A (:,P))'*(A (:,P)) will also tend to be sparser than that of A'*A.
- libcolamd2-dbgsym: debug symbols for libcolamd2
- libcxsparse3: No summary available for libcxsparse3 in ubuntu groovy.
No description available for libcxsparse3 in ubuntu groovy.
- libcxsparse3-dbgsym: debug symbols for libcxsparse3
- libgraphblas3: No summary available for libgraphblas3 in ubuntu groovy.
No description available for libgraphblas3 in ubuntu groovy.
- libgraphblas3-dbgsym: debug symbols for libgraphblas3
- libklu1: circuit simulation sparse LU factorization library
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The KLU library provides routines for LU factorization, primarily for circuit
simulation.
- libklu1-dbgsym: No summary available for libklu1-dbgsym in ubuntu groovy.
No description available for libklu1-dbgsym in ubuntu groovy.
- libldl2: simple LDL' factorization library for sparse matrices
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The LDL library provides routines for sparse LDL' factorization and solving.
These routines are not terrifically fast (they do not use dense matrix
kernels), but the code is very short and concise. The purpose is to illustrate
the algorithms in a very concise and readable manner, primarily for
educational purposes.
- libldl2-dbgsym: debug symbols for libldl2
- libmongoose2: No summary available for libmongoose2 in ubuntu groovy.
No description available for libmongoose2 in ubuntu groovy.
- libmongoose2-dbgsym: debug symbols for libmongoose2
- librbio2: No summary available for librbio2 in ubuntu groovy.
No description available for librbio2 in ubuntu groovy.
- librbio2-dbgsym: debug symbols for librbio2
- libspqr2: No summary available for libspqr2 in ubuntu groovy.
No description available for libspqr2 in ubuntu groovy.
- libspqr2-dbgsym: debug symbols for libspqr2
- libsuitesparse-dev: libraries for sparse matrices computations (development files)
Suitesparse is a collection of libraries for computations involving
sparse matrices. This package includes the following libraries:
.
AMD approximate minimum degree ordering
.
CAMD symmetric approximate minimum degree
.
BTF permutation to block triangular form (beta)
.
COLAMD column approximate minimum degree ordering
.
CCOLAMD constrained column approximate minimum degree ordering
.
CHOLMOD sparse Cholesky factorization
.
CXSparse a concise sparse matrix package
.
KLU sparse LU factorization, primarily for circuit simulation
.
LDL a simple LDL' factorization
.
UMFPACK sparse LU factorization
.
RBio read/write sparse matrices in Rutherford/Boeing format
.
SPQR sparse QR factorization
.
GraphBLAS graph algorithms via sparse matrix operations on semirings
.
Mongoose graph partitioning library that can quickly compute edge cuts
.
SuiteSparse_config configuration routines for all the above packages.
.
This package contains the static libraries and header files.
- libsuitesparse-doc: No summary available for libsuitesparse-doc in ubuntu groovy.
No description available for libsuitesparse-doc in ubuntu groovy.
- libsuitesparseconfig5: No summary available for libsuitesparseconfig5 in ubuntu groovy.
No description available for libsuitesparsec
onfig5 in ubuntu groovy.
- libsuitesparseconfig5-dbgsym: debug symbols for libsuitesparseconfig5
- libumfpack5: sparse LU factorization library
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The UMFPACK library provides a set of routines solving sparse linear systems
via LU factorization.
- libumfpack5-dbgsym: debug symbols for libumfpack5
- mongoose: No summary available for mongoose in ubuntu groovy.
No description available for mongoose in ubuntu groovy.
- mongoose-dbgsym: No summary available for mongoose-dbgsym in ubuntu groovy.
No description available for mongoose-dbgsym in ubuntu groovy.
