All Classes and Interfaces
Class
Description
Applies the fill reduction row pivots to the input matrix to reduce fill in during decomposition/solve.
Performs a Cholesky decomposition using an up looking algorthm on a
DMatrixSparseCSC.Computes the column counts of the upper triangular portion of L as in L*LT=A.
Most common operations on
DMatrixSparseCSC.Concurrent implementations of functions found in
CommonOps_DSCC.Factory for sparse matrix decompositions
Implementation class.
Concurrent implementations of
ImplCommonOps_DSCC.based on ImplCommonOps_DSCC
Implementation of single thread sparse matrix multiplication.
Implementation of concurrent matrix multiplication for DSCC matrices.
based on ImplSparseSparseGraphMult_DSCC
Linear solver using a sparse Cholesky decomposition.
Factory for sparse linear solvers
LU Decomposition based solver for square matrices.
Sparse linear solver implemented using
QrLeftLookingDecomposition_DSCC.LU Decomposition using a left looking algorithm for
DMatrixSparseCSC.Functions for computing the features/properties of matrices.
based on MartrixVectorMult_DSCC
Operations for computing different types of norms.
Functions used with a sparse QR decomposition
Left-looking QR decomposition algorithm for sparse matrices.
QrpSparseDecomposition<T extends org.ejml.data.Matrix>
Similar to
QRDecomposition but it can handle the rank deficient case by
performing column pivots during the decomposition.Determines the structure of the QR decomposition.
Functions for creating randomly generated sparse matrices.
Workspace for concurrent algorithms.