suitesparse 1:5.10.1+dfsg-4build1 source package in Ubuntu
Changelog
suitesparse (1:5.10.1+dfsg-4build1) jammy; urgency=high * No change rebuild for ppc64el baseline bump. -- Julian Andres Klode <email address hidden> Fri, 25 Mar 2022 10:52:16 +0100
Upload details
- Uploaded by:
- Julian Andres Klode
- Uploaded to:
- Jammy
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- math
- Urgency:
- Very Urgent
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Jammy | release | main | math |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
suitesparse_5.10.1+dfsg.orig.tar.xz | 36.5 MiB | 051d81ae96ecd57aa92134605654a95433a5de67c6b298ece09b262b2c8edc2a |
suitesparse_5.10.1+dfsg-4build1.debian.tar.xz | 22.6 KiB | d11a1d3b753c03898382331047661acf461b341a8d93b0225989a22b7adb0d14 |
suitesparse_5.10.1+dfsg-4build1.dsc | 3.2 KiB | 54bfd0abd9b57819dd76bc136df6261858d23a6fefeb81b3a362cee533c7572b |
Available diffs
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: 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: debug symbols for libbtf1
- 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: No summary available for libcamd2-dbgsym in ubuntu kinetic.
No description available for libcamd2-dbgsym in ubuntu kinetic.
- 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 kinetic.
No description available for libccolamd2-dbgsym in ubuntu kinetic.
- 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 kinetic.
No description available for libcholmod3-dbgsym in ubuntu kinetic.
- 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 kinetic.
No description available for libcxsparse3 in ubuntu kinetic.
- libcxsparse3-dbgsym: debug symbols for libcxsparse3
- 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: debug symbols for libklu1
- libldl2: No summary available for libldl2 in ubuntu kinetic.
No description available for libldl2 in ubuntu kinetic.
- libldl2-dbgsym: No summary available for libldl2-dbgsym in ubuntu kinetic.
No description available for libldl2-dbgsym in ubuntu kinetic.
- 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: 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: debug symbols for librbio2
- libsliplu1: No summary available for libsliplu1 in ubuntu kinetic.
No description available for libsliplu1 in ubuntu kinetic.
- libsliplu1-dbgsym: No summary available for libsliplu1-dbgsym in ubuntu kinetic.
No description available for libsliplu1-dbgsym in ubuntu kinetic.
- 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: 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
.
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: 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 kinetic.
No description available for mongoose in ubuntu kinetic.
- mongoose-dbgsym: debug symbols for mongoose