Interface  Description 

DirectSolver  
IterativeSolver 
Class  Description 

CGSolver 
Solves linear systems using the conjugate gradient algorithm

CGSolverTest 
Unit test for the class CGSolver

CRSolver  
CRSolverTest 
Unit test for the class CGSolver

DantzigLCPSolver 
Solves linear complementarity problems (LCPs) for symmetric positive
semidefinite (SPSD) matrices using Dantzig's method.

DantzigLCPSolverTest  
DantzigQPSolver 
A dense QP (Quadratic Program) solver that that uses Dantzig's algorithm.

DantzigQPSolverTest 
Testing program for the QPSolver

IncompleteCholeskyDecomposition 
Constructs the Cholesky decomposition of a symmetric positive definite
matrix.

IncompleteCholeskyDecompositionTest  
IncompleteLUDecomposition 
Constructs the Cholesky decomposition of a symmetric positive definite
matrix.

IncompleteLUDecompositionTest  
KellerLCPSolver 
Solves linear complementarity problems (LCPs) for symmetric positive
semidefinite (SPSD) matrices using Kellers's method.

KellerLCPSolverTest  
KKTSolver  
KKTSolverTest  
LemkeContactSolver  
LemkeContactSolverTest  
LemkeSolverBase  
PardisoSolver 
JNI interface to the Pardiso sparse solver.

PardisoSolverTest  
PardisoThreadTest  
PardisoThreadTest.SparseElement  
ProjectedCGSolver 
Solves linear systems using the conjugate gradient algorithm

UmfpackSolver  
UmfpackSolverTest 
Enum  Description 

DantzigLCPSolver.Status 
Described whether or not a solution was found.

DantzigQPSolver.Status 
Described whether or not a solution was found.

IterativeSolver.ToleranceType  
KellerLCPSolver.Status 
Described whether or not a solution was found.

KKTSolver.Status 
Described whether or not a solution was found.

PardisoSolver.ReorderMethod 
Describes the reorder methods that can be used during the analyze phase
to reduce factorization fillin.

SparseSolverId 
Identifies the generalpurpose sparse solvers available in this package.
