All Classes and Interfaces
Classes
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
FMatrixSparseCSC.Computes the column counts of the upper triangular portion of L as in L*LT=A.
Most common operations on
FMatrixSparseCSC.Concurrent implementations of functions found in
CommonOps_FSCC.Factory for sparse matrix decompositions
Implementation class.
Concurrent implementations of
ImplCommonOps_FSCC.based on ImplCommonOps_FSCC
Implementation of single thread sparse matrix multiplication.
Implementation of concurrent matrix multiplication for DSCC matrices.
based on ImplSparseSparseGraphMult_FSCC
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_FSCC.LU Decomposition using a left looking algorithm for
FMatrixSparseCSC.Functions for computing the features/properties of matrices.
based on MartrixVectorMult_FSCC
Operations for computing different types of norms.
Functions used with a sparse QR decomposition
Left-looking QR decomposition algorithm for sparse matrices.
Determines the structure of the QR decomposition.
Functions for creating randomly generated sparse matrices.
Workspace for concurrent algorithms.