suitesparse 1:5.8.1+dfsg-2build1 source package in Ubuntu
Changelog
suitesparse (1:5.8.1+dfsg-2build1) impish; urgency=medium * No-change rebuild to build packages with zstd compression. -- Matthias Klose <email address hidden> Thu, 07 Oct 2021 12:24:56 +0200
Upload details
- Uploaded by:
- Matthias Klose
- Uploaded to:
- Impish
- Original maintainer:
- Debian Science Team
- Architectures:
- any all
- Section:
- math
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
suitesparse_5.8.1+dfsg.orig.tar.xz | 35.9 MiB | cf45a3d4c935cc2100bd4ba61a6f682a049027dce5d91846541a4933e0267752 |
suitesparse_5.8.1+dfsg-2build1.debian.tar.xz | 52.1 KiB | f06ee910c2afde894014de0d2f4dc79477dda4e34c3c51456850e7c56d563ae6 |
suitesparse_5.8.1+dfsg-2build1.dsc | 3.1 KiB | c948cf715bd6afec6787c1f619b1a2bfb0ae4a1ca76f8faac64ac45b8aa10ea2 |
Available diffs
Binary packages built by this source
- libamd2: No summary available for libamd2 in ubuntu impish.
No description available for libamd2 in ubuntu impish.
- libamd2-dbgsym: debug symbols for libamd2
- libbtf1: permutation to block triangular form library for sparse matrices
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The BTF library is a software package for permuting a matrix into Block upper
Triangular Form. It includes a maximum transversal algorithm, which finds a
permutation of a square or rectangular matrix so that it has a zero-free
diagonal (if one exists); otherwise, it finds a maximal matching which
maximizes the number of nonzeros on the diagonal. The package also includes a
method for finding the strongly connected components of a graph. These two
methods together give the permutation to block upper triangular form.
- libbtf1-dbgsym: No summary available for libbtf1-dbgsym in ubuntu impish.
No description available for libbtf1-dbgsym in ubuntu impish.
- libcamd2: symmetric approximate minimum degree library for sparse matrices
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The CAMD library provides a set of routines for pre-ordering sparse matrices
prior to Cholesky or LU factorization, using the approximate minimum degree
ordering algorithm with optional ordering constraints.
- 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 impish.
No description available for libccolamd2-dbgsym in ubuntu impish.
- 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: debug symbols for libcholmod3
- 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: concise sparse matrix library
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The CXSparse library provides several matrix algorithms. The focus is on direct
methods; iterative methods and solvers for eigenvalue problems are beyond the
scope of this package.
.
The performance of the sparse factorization methods in CXSparse will not be
competitive with UMFPACK or CHOLMOD, but the codes are much more concise and
easy to understand. Other methods are competitive.
- libcxsparse3-dbgsym: No summary available for libcxsparse3-dbgsym in ubuntu impish.
No description available for libcxsparse3-dbgsym in ubuntu impish.
- libgraphblas3: No summary available for libgraphblas3 in ubuntu impish.
No description available for libgraphblas3 in ubuntu impish.
- libgraphblas3-dbgsym: No summary available for libgraphblas3-dbgsym in ubuntu impish.
No description available for libgraphblas3-
dbgsym in ubuntu impish.
- libklu1: No summary available for libklu1 in ubuntu impish.
No description available for libklu1 in ubuntu impish.
- libklu1-dbgsym: No summary available for libklu1-dbgsym in ubuntu impish.
No description available for libklu1-dbgsym in ubuntu impish.
- 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: graph partitioning tool that can quickly compute edge cuts (shared library)
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
Mongoose is a graph partitioning library that can quickly compute edge cuts in
arbitrary graph. Given a graph with a vertex set and edge set, an edge cut is
a partitioning of the graph into two subgraphs that are balanced (contain the
same number of vertices) and the connectivity between the subgraphs is
minimized (few edges are in the cut).
.
This package contains the shared C++ library.
- libmongoose2-dbgsym: No summary available for libmongoose2-dbgsym in ubuntu impish.
No description available for libmongoose2-dbgsym in ubuntu impish.
- librbio2: read/write sparse matrices in Rutherford/Boeing format
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
RBio is a library for reading/writing sparse matrices in the Rutherford/Boeing
format.
- librbio2-dbgsym: No summary available for librbio2-dbgsym in ubuntu impish.
No description available for librbio2-dbgsym in ubuntu impish.
- libsliplu1: solves sparse linear systems in exact arithmetic
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
SLIP LU is a software package designed to exactly solve unsymmetric sparse
linear systems, Ax = b, where A, b and x contain rational numbers. This
package performs a left-looking, roundoff-error-free (REF) LU factorization
PAQ = LDU, where L and U are integer, D is diagonal, and P and Q are row and
column permutations, respectively. Note that the matrix D is never explicitly
computed nor needed; thus this package uses only the matrices L and U.
.
This package relies on GNU GMP and MPRF for exact arithmetic computations.
- libsliplu1-dbgsym: No summary available for libsliplu1-dbgsym in ubuntu impish.
No description available for libsliplu1-dbgsym in ubuntu impish.
- libspqr2: sparse QR factorization library
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
SuiteSparseQR (SPQR) is a multithreaded, multifrontal, rank-revealing sparse
QR factorization method.
- libspqr2-dbgsym: No summary available for libspqr2-dbgsym in ubuntu impish.
No description available for libspqr2-dbgsym in ubuntu impish.
- 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
.
Mongoose graph partitioning library that can quickly compute edge cuts
.
SLIP_LU solves sparse linear systems in exact arithmetic
.
SuiteSparse_config configuration routines for all the above packages.
.
This package contains the static libraries and header files.
- libsuitesparse-doc: libraries for sparse matrices computations (documentation)
Suitesparse is a collection of libraries for computations involving
sparse matrices. This package contains the user guides for the
libraries distributed by the SuiteSparse project.
- libsuitesparseconfig5: configuration routines for all SuiteSparse modules
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The SuiteSparse_config library provides configuration routines that are common
to all SuiteSparse libraries.
- libsuitesparseconfig5-dbgsym: No summary available for libsuitesparseconfig5-dbgsym in ubuntu impish.
No description available for libsuitesparsec
onfig5- dbgsym in ubuntu impish.
- 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: No summary available for libumfpack5-dbgsym in ubuntu impish.
No description available for libumfpack5-dbgsym in ubuntu impish.
- mongoose: graph partitioning tool that can quickly compute edge cuts (executable)
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
Mongoose is a graph partitioning library that can quickly compute edge cuts in
arbitrary graph. Given a graph with a vertex set and edge set, an edge cut is
a partitioning of the graph into two subgraphs that are balanced (contain the
same number of vertices) and the connectivity between the subgraphs is
minimized (few edges are in the cut).
.
This package contains the standalone executable.
- mongoose-dbgsym: debug symbols for mongoose