| Matrix | Standard matrix class |
| MatrixBlock | A generic view onto parts of a Matrix |
| MatrixCWise | Coefficient wise access to Matrix |
| MatrixEigenSym | Eigen decomposition of symmetric matrices |
| MatrixEigenUnsym | Eigen decomposition of unsymmetric matrices |
| MatrixLDLt | Cholesky LDL' decomposition |
| MatrixLLt | Cholesky LL' decomposition |
| MatrixLU | LU decomposition |
| MatrixQR | QR decomposition |
| MatrixSVD | Singular value decomposition |
| DynamicSparseMatrix | Sparse matrix class for random access |
| MUMPS | Solver for sparse matrices using MUMPS |
| SparseArpack | Eigen analyses solver for sparse matrices based on ARPACK |
| SparseLLT | Base class of LL' solvers. The input matrices must be selfadjoint (symmetric) It already implements the standard LL' decomposition |
| SparseLLTCholmod | LL' solver for selfadjoint sparse matrices using CHOLMOD |
| SparseLowerLLT | Default LL' solver for selfadjoint lowertriangular sparse matrices |
| SparseLowerLLTCholmod | LL' solver for selfadjoint lowertriangular sparse matrices using CHOLMOD |
| SparseLU | Base class of LU solvers. It already implements the standard LU decomposition |
| SparseLUUmfPack | LU solver for sparse matrices using UMFPACK |
| SparseMatrix | The default sparse matrix class |
| SparseSolver | The base class for sparse solvers. It provides a unified interface which can be used by generic algorithms |
| SparseSuperLU | LU solver for sparse matrices using SuperLU |
| SymSparseMatrix | Symmetric sparse matrix class with selfadjoint storage |
1.5.6