suitesparse 1:7.6.1+dfsg-ok1 source package in openKylin
Changelog
suitesparse (1:7.6.1+dfsg-ok1) nile; urgency=medium * Build for openkylin. -- Luoyaoming <email address hidden> Tue, 11 Jun 2024 15:07:27 +0800
suitesparse (1:7.6.1+dfsg-ok1) nile; urgency=medium * Build for openkylin. -- Luoyaoming <email address hidden> Tue, 11 Jun 2024 15:07:27 +0800
Series | Published | Component | Section | |
---|---|---|---|---|
Huanghe V3.0 | proposed | main | math | |
Huanghe V3.0 | release | main | math | |
Nile V2.0 | release | main | math | |
Nile V2.0 | proposed | main | math |
File | Size | SHA-256 Checksum |
---|---|---|
suitesparse_7.6.1+dfsg.orig.tar.xz | 48.3 MiB | e90cf7f45c48c00ba1525307483301c86cdc5144924d6ad4eb08082e7ea5b24c |
suitesparse_7.6.1+dfsg-ok1.debian.tar.xz | 17.8 KiB | 0a5263729937345534375068b14a833e243f677e459de9ad083c64df89be38ef |
suitesparse_7.6.1+dfsg-ok1.dsc | 3.1 KiB | 06039e25a9880e2f1e4e53fcd2951cf6d3ec6316a82acbe11c79a835b52ecf9b |
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.
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.
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.
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.
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.
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.
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.
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The KLU library provides routines for LU factorization, primarily for circuit
simulation.
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.
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
ParU is an implementation of the multifrontal sparse LU factorization
method. Parallelism is exploited both in the BLAS and across different frontal
matrices using OpenMP tasking, a shared-memory programming model for modern
multicore architectures. The package is written in C++ and real sparse matrices
are supported.
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.
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
SPEX Left LU is a software package designed to exactly solve unsymmetric sparse
linear systems, Ax = b, where A, b and x contain rational numbers. This
package performs a left-looking, roundoff-error-free (REF) LU factorization
PAQ = LDU, where L and U are integer, D is diagonal, and P and Q are row and
column permutations, respectively. Note that the matrix D is never explicitly
computed nor needed; thus this package uses only the matrices L and U.
.
This package relies on GNU GMP and MPRF for exact arithmetic computations.
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
SuiteSparseQR (SPQR) is a multithreaded, multifrontal, rank-revealing sparse
QR factorization method.
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
.
ParU unsymmetric multifrontal multithreaded 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
.
SPEX 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.
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.
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.
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.
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.
This package eases the transition from mongoose to suitesparse-
It can be safely removed.
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.