suitesparse 1:5.4.0+dfsg-1 source package in Ubuntu
Changelog
suitesparse (1:5.4.0+dfsg-1) unstable; urgency=medium * New upstream version 5.4.0+dfsg * d/rules: use new JOBS Makefile variable for parallel build * Add Build-Depends-Package field in symbols files * Migrate to new way of specifying debhelper compat level * Bump to S-V 4.3.0 -- Sébastien Villemot <email address hidden> Thu, 27 Dec 2018 09:52:31 +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 |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| suitesparse_5.4.0+dfsg-1.dsc | 3.0 KiB | 0c18f97f8a736f0071296ab9c331e66583145ee108e41ab5e3786811beba142f |
| suitesparse_5.4.0+dfsg.orig.tar.xz | 39.9 MiB | 95bf7956b8ccbb5c9db0071221ef88f39dc0439e8f321d7f95a451e670ce1ace |
| suitesparse_5.4.0+dfsg-1.debian.tar.xz | 30.8 KiB | eb19a768a88ad0a43b3b079d70af2e126369e49ba9f9155505f4ea6089081dcc |
Available diffs
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 disco.
No description available for libamd2-dbgsym in ubuntu disco.
- 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 eoan.
No description available for libbtf1-dbgsym in ubuntu eoan.
- libcamd2: No summary available for libcamd2 in ubuntu disco.
No description available for libcamd2 in ubuntu disco.
- libcamd2-dbgsym: No summary available for libcamd2-dbgsym in ubuntu disco.
No description available for libcamd2-dbgsym in ubuntu disco.
- libccolamd2: No summary available for libccolamd2 in ubuntu disco.
No description available for libccolamd2 in ubuntu disco.
- libccolamd2-dbgsym: No summary available for libccolamd2-dbgsym in ubuntu eoan.
No description available for libccolamd2-dbgsym in ubuntu eoan.
- 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 disco.
No description available for libcholmod3-dbgsym in ubuntu disco.
- libcolamd2: No summary available for libcolamd2 in ubuntu disco.
No description available for libcolamd2 in ubuntu disco.
- 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 disco.
No description available for libcxsparse3-dbgsym in ubuntu disco.
- libgraphblas2: No summary available for libgraphblas2 in ubuntu focal.
No description available for libgraphblas2 in ubuntu focal.
- libgraphblas2-dbgsym: No summary available for libgraphblas2-dbgsym in ubuntu disco.
No description available for libgraphblas2-
dbgsym in ubuntu disco.
- libklu1: No summary available for libklu1 in ubuntu disco.
No description available for libklu1 in ubuntu disco.
- libklu1-dbgsym: No summary available for libklu1-dbgsym in ubuntu disco.
No description available for libklu1-dbgsym in ubuntu disco.
- 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: No summary available for libldl2-dbgsym in ubuntu disco.
No description available for libldl2-dbgsym in ubuntu disco.
- 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: debug symbols for libmongoose2
- librbio2: No summary available for librbio2 in ubuntu disco.
No description available for librbio2 in ubuntu disco.
- librbio2-dbgsym: debug symbols for librbio2
- libspqr2: No summary available for libspqr2 in ubuntu disco.
No description available for libspqr2 in ubuntu disco.
- libspqr2-dbgsym: No summary available for libspqr2-dbgsym in ubuntu disco.
No description available for libspqr2-dbgsym in ubuntu disco.
- libsuitesparse-dev: No summary available for libsuitesparse-dev in ubuntu disco.
No description available for libsuitesparse-dev in ubuntu disco.
- 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: No summary available for libsuitesparseconfig5 in ubuntu disco.
No description available for libsuitesparsec
onfig5 in ubuntu disco.
- libsuitesparseconfig5-dbgsym: No summary available for libsuitesparseconfig5-dbgsym in ubuntu disco.
No description available for libsuitesparsec
onfig5- dbgsym in ubuntu disco.
- 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 disco.
No description available for mongoose in ubuntu disco.
- mongoose-dbgsym: No summary available for mongoose-dbgsym in ubuntu disco.
No description available for mongoose-dbgsym in ubuntu disco.
