\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.13.1 - CGAL and Solvers
Classes
Concepts
CGAL and Solvers Reference

Concepts

conceptDiagonalizeTraits< FT, dim >
 Concept providing functions to extract eigenvectors and eigenvalues from covariance matrices represented by an array a, using symmetric diagonalization. More...
 
conceptNormalEquationSparseLinearAlgebraTraits_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. More...
 
conceptSparseLinearAlgebraTraits_d
 The concept SparseLinearAlgebraTraits_d is used to solve sparse linear systems A \( \times \) X = B. More...
 
conceptSparseLinearAlgebraWithFactorTraits_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. More...
 
conceptSvdTraits
 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. More...