Concepts

Classes
class	DiagonalizeTraits< FT, dim >
	Concept providing functions to extract eigenvectors and eigenvalues from covariance matrices represented by an array a, using symmetric diagonalization. More...
class	MixedIntegerProgramVariable
	MixedIntegerProgramVariable is a concept of a variable in a Mixed Integer Programming (MIP) problem. More...
class	MixedIntegerProgramLinearConstraint< FT >
	MixedIntegerProgramLinearConstraint is a concept of a linear constraint in a Mixed Integer Programming (MIP) problem. More...
class	MixedIntegerProgramLinearObjective< FT >
	MixedIntegerProgramLinearObjective is a concept of the linear objective function in a Mixed Integer Programming (MIP) problem. More...
class	MixedIntegerProgramTraits< FT >
	Concept describing the set of requirements for (constrained or unconstrained) Mixed Integer Programming (MIP) problems. A model of this concept stores the integer variables, linear objective, and linear constraints (if any) and provides a method to solve the problem. More...
class	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. More...
class	SparseLinearAlgebraTraits_d
	The concept SparseLinearAlgebraTraits_d is used to solve sparse linear systems A \( \times \) X = B. More...
class	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. More...
class	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. More...