amd
- Ebuilds: 1, Testing: 3.3.4 Description:
AMD is a set of routines for ordering a sparse matrix prior to Cholesky
factorization (or for LU factorization with diagonal pivoting). There
are versions in both C and Fortran.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: BSD
brial
- Ebuilds: 1, Testing: 1.2.15 Description:
BRiAl is a C++ library (the successor to PolyBoRi) that provides
high-level data types for Boolean polynomials and monomials,
exponent vectors, as well as for the underlying polynomial rings
and subsets of the powerset of the Boolean variables.
Homepage:https://github.com/BRiAl/BRiAl License: BSD GPL-2+
btf
- Ebuilds: 1, Testing: 2.3.3 Description:
The Block Triangular Form is a library of routines offering
permutation of an unsymmetric matrix (square or rectangular) into
its block upper triangular form (more precisely, it computes a
Dulmage-Mendelsohn decomposition).
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: LGPL-2.1
camd
- Ebuilds: 1, Testing: 3.3.5 Description:
Constrained Approximate Minimum Degree ordering is a set of routines
for ordering a sparse matrix prior to Cholesky factorization (or for
LU factorization with diagonal pivoting).
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: BSD
ccolamd
- Ebuilds: 1, Testing: 3.3.5 Description:
Constrained COLAMD computes an column approximate minimum degree ordering
algorithm, (like COLAMD), but it can also be given a set of ordering
constraints.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: BSD
colamd
- Ebuilds: 1, Testing: 3.3.5 Description:
The COLumn Approximate Minimum Degree ordering algorithm
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. SYMAMD is a symmetric minimum degree ordering method based on
COLAMD, available as a MATLAB-callable function. It constructs a
matrix M such that M\'*M has the same pattern as A, and then uses
COLAMD to compute a column ordering of M.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: BSD
cxsparse
- Ebuilds: 1, Testing: 4.4.2 Description:
CXSparse is an extended version of CSparse, a sparse matrix package,
with support for double or complex matrices, with int or long
integers.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: LGPL-2.1
klu
- Ebuilds: 1, Testing: 2.3.6 Description:
KLU is a sparse LU factorization algorithm well-suited for use in
circuit simulation. It is also part of the University
of Florida sparse matrix suite.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: LGPL-2.1+
ldl
- Ebuilds: 1, Testing: 3.3.3 Description:
LDL is a set of concise routines for factorizing symmetric
positive-definite sparse matrices, with some applicability to
symmetric indefinite matrices. Its primary purpose is to illustrate
much of the basic theory of sparse matrix algorithms in as concise a
code as possible, including an elegant new method of sparse symmetric
factorization that computes the factorization row-by-row but stores it
column-by-column. The entire symbolic and numeric factorization
consists of a total of only 49 lines of code. The package is written
in C, and includes a MATLAB interface.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: LGPL-2.1+
mpfrcx
- Ebuilds: 1, Testing: 0.6.3 Description:
Mpfrcx is a library for the arithmetic of univariate polynomials over arbitrary
precision real (Mpfr) or complex (Mpc) numbers, without control on the rounding.
Homepage:https://www.multiprecision.org/mpfrcx/home.html License: LGPL-2.1+
qdldl
- Ebuilds: 1, Testing: 0.1.6 Description: A free LDL factorisation routine for quasi-definite linear systems
Homepage:https://github.com/osqp/qdldl License: Apache-2.0
rbio
- Ebuilds: 1, Testing: 4.3.5 Description:
Library for reading/writing sparse matrices in the Rutherford/Boeing
format, and for reading/writing problems in the SuiteSparse Matrix
Collection from/to a set of files in a directory.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: GPL-2+
spex
- Ebuilds: 1, Testing: 3.2.4 Description:
SPEX is a software package comprising several state-of-the-art
SParse EXact linear algebra routines. It currently is comprised
of the following:
*Utility and auxiliary functions for all SPEX routines:
interface to the GMP/MPFR library, memory management
functions, the SPEX_matrix data structure, and various
functions that are auxiliary to the factorization and solve
functions
*Sparse exact left-looking LU factorization to solve the
linear system Ax=B. The solution time is proportional to the
arithmetic work in the bit-complexity model; this is an
asymptotically efficient complexity bound.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: BSD
spqr
- Ebuilds: 1, Testing: 4.3.6 Description:
SuiteSparseQR is an implementation of the multifrontal sparse QR
factorization method. Parallelism is exploited both in the BLAS and
across different frontal matrices using Intel's Threading Building
Blocks. It can obtain a substantial fraction of the theoretical
peak performance of a multicore computer.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: GPL-2+
suitesparseconfig
- Ebuilds: 1, Testing: 7.12.2 Description:
SuiteSparse_config is a set of configuration files for the SuiteSparse matrix libraries
from CISE at University of Florida. It contains some headers and makefiles.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: BSD
umfpack
- Ebuilds: 1, Testing: 6.3.7 Description:
UMFPACK is a set of routines for solving unsymmetric sparse linear
systems, Ax=b, using the Unsymmetric MultiFrontal method.
Includes a C-callable interface, and a Fortran-callable interface.
MATLAB routines are not included in the Gentoo package.
Homepage:https://people.engr.tamu.edu/davis/suitesparse.html License: GPL-2+