Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.

[detail level 12]

CGAL
Diagonalize_traits	The class `Diagonalize_traits` provides an internal implementation for the diagonalization of Variance-Covariance Matrices
Eigen_diagonalize_traits	The class `Eigen_diagonalize_traits` provides an interface to the diagonalization of covariance matrices of Eigen
Eigen_sparse_matrix	The class `Eigen_sparse_matrix` is a wrapper around Eigen matrix type `Eigen::SparseMatrix` that represents general matrices, be they symmetric or not
Eigen_sparse_symmetric_matrix	The class `Eigen_sparse_symmetric_matrix` is a wrapper around Eigen matrix type `Eigen::SparseMatrix`
Eigen_matrix	The class `Eigen_matrix` is a wrapper around Eigen matrix type `Eigen::Matrix`
Eigen_solver_traits	The class `Eigen_solver_traits` provides an interface to the sparse solvers of Eigen
Eigen_svd	The class `Eigen_svd` provides an algorithm to solve in the least square sense a linear system with a singular value decomposition using Eigen
Eigen_vector	The class `Eigen_vector` is a wrapper around Eigen vector type , which is a simple array of numbers
DiagonalizeTraits	Concept providing functions to extract eigenvectors and eigenvalues from covariance matrices represented by an array `a`, using symmetric diagonalization. For example, a matrix of dimension 3 is defined as follows: $\begin{bmatrix} a[0] & a[1] & a[2] \\ a[1] & a[3] & a[4] \\ a[2] & a[4] & a[5] \\ \end{bmatrix}$
NormalEquationSparseLinearAlgebraTraits_d	Concept describing the set of requirements for solving the normal equation $A^t A X = A^t B$ , $A$ being a matrix, $At$ its transpose matrix, $B$ and $X$ being two vectors
SparseLinearAlgebraTraits_d	The concept `SparseLinearAlgebraTraits_d` is used to solve sparse linear systems A $\times$ X = B
Matrix	`SparseLinearAlgebraTraits_d::Matrix` is a concept of a sparse matrix class
Vector	`SparseLinearAlgebraTraits_d::Vector` is a concept of a vector that can be multiplied by a sparse matrix
SparseLinearAlgebraWithFactorTraits_d	Concept describing the set of requirements for a direct sparse linear system solver with factorization. A model of this concept stores the left-hand matrix (denoted $A$ ) and provides an additional factorization method to solve the system for different right-hand vectors
SvdTraits	The concept `SvdTraits` describes the linear algebra types and algorithms needed to solve in the least square sense a linear system with a singular value decomposition
Matrix	Concept of matrix type used by the concept `SvdTraits`
Vector	Concept of vector type used by the concept `SvdTraits`