suitesparse 1:4.5.3-1 source package in Ubuntu
Changelog
suitesparse (1:4.5.3-1) unstable; urgency=low * Release to unstable. * Imported Upstream version 4.5.3. -- Sébastien Villemot <email address hidden> Tue, 17 May 2016 16:11:44 +0200
Upload details
- Uploaded by:
- Debian Science Team on 2016-05-17
- Uploaded to:
- Sid
- Original maintainer:
- Debian Science Team
- Architectures:
- any all
- Section:
- math
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Yakkety | release | on 2016-06-10 | main | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| suitesparse_4.5.3-1.dsc | 2.8 KiB | 5a3e879cfa46b93036a54e8fb9705da808a63bd0406769fd86930afb9dfe77ca |
| suitesparse_4.5.3.orig.tar.gz | 28.6 MiB | 6199a3a35fbce82b155fd2349cf81d2b7cddaf0dac218c08cb172f9bc143f37a |
| suitesparse_4.5.3-1.debian.tar.xz | 17.2 KiB | a6bbddd92ce0aa7baa6e3723d339f70ac0240612eefea45553d76ecfd4c7717b |
Available diffs
- diff from 1:4.4.6-1 to 1:4.5.3-1 (4.8 MiB)
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 package libamd2
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.
- 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 package libbtf1
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.
- 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 package libcamd2
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.
- 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 package libccolamd2
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.
- 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 package libcholmod3
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.
- 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 package libcolamd2
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.
- 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 package libcxsparse3
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.
- 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 package libklu1
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The KLU library provides routines for LU factorization, primarily for circuit
simulation.
- 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 package libldl2
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.
- 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 package librbio2
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.
- 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 package libspqr2
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
SuiteSparseQR (SPQR) is a multithreaded, multifrontal, rank-revealing sparse
QR factorization method.
- 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
.
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: 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.
- libsuitesparseconfig4-dbgsym: debug symbols for package libsuitesparseconfig4
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.
- 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 package libumfpack5
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.
