suitesparse 1:4.5.6-1 source package in Ubuntu

Changelog

suitesparse (1:4.5.6-1) unstable; urgency=medium

  * New upstream version 4.5.6
  * The AMD, CAMD, CCOLAMD and COLAMD modules are now under BSD-3-clause
    license.
  * d/control: drop Suggests on liblapack-doc-man, superseded by liblapack-doc.
  * d/rules: add option -V to dh_makeshlibs.
  * Bump to Standards-Version 4.1.1.
  * Mark libsuitesparse-doc as M-A foreign.

 -- S├ębastien Villemot <email address hidden>  Fri, 06 Oct 2017 11:13:48 +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 Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
suitesparse_4.5.6-1.dsc 2.7 KiB c92a37c725dfef3f0363de0426d184e6cb8235ac059caba991c9526cc96c7653
suitesparse_4.5.6.orig.tar.gz 28.9 MiB de5fb496bdc029e55955e05d918a1862a177805fbbd5b957e8b5ce6632f6c77e
suitesparse_4.5.6-1.debian.tar.xz 17.2 KiB d907843f5a4a6169699fe6038b958d8f76e81451fd23b8c0df1fd61a472f89c5

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: 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: 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: debug symbols for libccolamd2
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: 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: 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
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
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
 .
 GraphBLAS graph algorithms via sparse matrix operations on semirings
 .
 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.

libsuitesparseconfig4: No summary available for libsuitesparseconfig4 in ubuntu bionic.

No description available for libsuitesparseconfig4 in ubuntu bionic.

libsuitesparseconfig4-dbgsym: No summary available for libsuitesparseconfig4-dbgsym in ubuntu bionic.

No description available for libsuitesparseconfig4-dbgsym in ubuntu bionic.

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