suitesparse 1:5.12.0+dfsg-2 source package in Ubuntu
Changelog
suitesparse (1:5.12.0+dfsg-2) unstable; urgency=medium
* texlive-2022.patch: new patch, fixes FTBFS against TeX Live 2022
(Closes: #1013618)
* Bump S-V to 4.6.1
-- Sébastien Villemot <email address hidden> Mon, 27 Jun 2022 13:43:38 +0200
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 | |
|---|---|---|---|---|
| Lunar | release | main | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| suitesparse_5.12.0+dfsg-2.dsc | 3.0 KiB | 8ff049d38f3de1bd2e8a3820281d96d6d1aa75495eb6e1c6237ec8085967c5aa |
| suitesparse_5.12.0+dfsg.orig.tar.xz | 37.6 MiB | bb106c43049138c19675cd70322e72ff8e4fd8bdcab3a096307fd78488913faf |
| suitesparse_5.12.0+dfsg-2.debian.tar.xz | 22.9 KiB | 2e5836427ac968d6fdf33de80a46cd0f0f74ae43732663d6ec3a198bc99678f3 |
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 kinetic.
No description available for libamd2-dbgsym in ubuntu kinetic.
- libbtf1: No summary available for libbtf1 in ubuntu kinetic.
No description available for libbtf1 in ubuntu kinetic.
- libbtf1-dbgsym: No summary available for libbtf1-dbgsym in ubuntu mantic.
No description available for libbtf1-dbgsym in ubuntu mantic.
- 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 mantic.
No description available for libcamd2-dbgsym in ubuntu mantic.
- libccolamd2: No summary available for libccolamd2 in ubuntu kinetic.
No description available for libccolamd2 in ubuntu kinetic.
- libccolamd2-dbgsym: No summary available for libccolamd2-dbgsym in ubuntu mantic.
No description available for libccolamd2-dbgsym in ubuntu mantic.
- libcholmod3: No summary available for libcholmod3 in ubuntu mantic.
No description available for libcholmod3 in ubuntu mantic.
- libcholmod3-dbgsym: debug symbols for libcholmod3
- libcolamd2: No summary available for libcolamd2 in ubuntu kinetic.
No description available for libcolamd2 in ubuntu kinetic.
- libcolamd2-dbgsym: No summary available for libcolamd2-dbgsym in ubuntu kinetic.
No description available for libcolamd2-dbgsym in ubuntu kinetic.
- libcxsparse3: No summary available for libcxsparse3 in ubuntu kinetic.
No description available for libcxsparse3 in ubuntu kinetic.
- libcxsparse3-dbgsym: No summary available for libcxsparse3-dbgsym in ubuntu kinetic.
No description available for libcxsparse3-dbgsym in ubuntu kinetic.
- libklu1: No summary available for libklu1 in ubuntu kinetic.
No description available for libklu1 in ubuntu kinetic.
- 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 mantic.
No description available for libldl2-dbgsym in ubuntu mantic.
- libmongoose2: No summary available for libmongoose2 in ubuntu kinetic.
No description available for libmongoose2 in ubuntu kinetic.
- libmongoose2-dbgsym: No summary available for libmongoose2-dbgsym in ubuntu mantic.
No description available for libmongoose2-dbgsym in ubuntu mantic.
- librbio2: No summary available for librbio2 in ubuntu kinetic.
No description available for librbio2 in ubuntu kinetic.
- librbio2-dbgsym: No summary available for librbio2-dbgsym in ubuntu kinetic.
No description available for librbio2-dbgsym in ubuntu kinetic.
- libsliplu1: No summary available for libsliplu1 in ubuntu kinetic.
No description available for libsliplu1 in ubuntu kinetic.
- libsliplu1-dbgsym: debug symbols for libsliplu1
- 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 mantic.
No description available for libspqr2-dbgsym in ubuntu mantic.
- libsuitesparse-dev: No summary available for libsuitesparse-dev in ubuntu kinetic.
No description available for libsuitesparse-dev in ubuntu kinetic.
- 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 kinetic.
No description available for libsuitesparsec
onfig5 in ubuntu kinetic.
- libsuitesparseconfig5-dbgsym: No summary available for libsuitesparseconfig5-dbgsym in ubuntu kinetic.
No description available for libsuitesparsec
onfig5- dbgsym in ubuntu kinetic.
- libumfpack5: No summary available for libumfpack5 in ubuntu kinetic.
No description available for libumfpack5 in ubuntu kinetic.
- libumfpack5-dbgsym: No summary available for libumfpack5-dbgsym in ubuntu mantic.
No description available for libumfpack5-dbgsym in ubuntu mantic.
- 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
