| ►NEigen | |
| Caligned_allocator | STL compatible allocator to use with with 16 byte aligned types |
| CAlignedBox | An axis aligned box |
| CAngleAxis | Represents a 3D rotation as a rotation angle around an arbitrary 3D axis |
| CArray | General-purpose arrays with easy API for coefficient-wise operations |
| CArrayBase | Base class for all 1D and 2D array, and related expressions |
| CArrayWrapper | Expression of a mathematical vector or matrix as an array object |
| CArrayXpr | |
| CBiCGSTAB | A bi conjugate gradient stabilized solver for sparse square problems |
| CBlock | Expression of a fixed-size or dynamic-size block |
| CCholmodBase | The base class for the direct Cholesky factorization of Cholmod |
| CCholmodDecomposition | A general Cholesky factorization and solver based on Cholmod |
| CCholmodSimplicialLDLT | A simplicial direct Cholesky (LDLT) factorization and solver based on Cholmod |
| CCholmodSimplicialLLT | A simplicial direct Cholesky (LLT) factorization and solver based on Cholmod |
| CCholmodSupernodalLLT | A supernodal Cholesky (LLT) factorization and solver based on Cholmod |
| CColPivHouseholderQR | Householder rank-revealing QR decomposition of a matrix with column-pivoting |
| CCommaInitializer | Helper class used by the comma initializer operator |
| CComplexEigenSolver | Computes eigenvalues and eigenvectors of general complex matrices |
| CComplexSchur | Performs a complex Schur decomposition of a real or complex square matrix |
| CConjugateGradient | A conjugate gradient solver for sparse self-adjoint problems |
| CCwiseBinaryOp | Generic expression where a coefficient-wise binary operator is applied to two expressions |
| CCwiseNullaryOp | Generic expression of a matrix where all coefficients are defined by a functor |
| CCwiseUnaryOp | Generic expression where a coefficient-wise unary operator is applied to an expression |
| CCwiseUnaryView | Generic lvalue expression of a coefficient-wise unary operator of a matrix or a vector |
| CDense | |
| CDenseBase | Base class for all dense matrices, vectors, and arrays |
| CDenseCoeffsBase< Derived, DirectAccessors > | Base class providing direct read-only coefficient access to matrices and arrays |
| CDenseCoeffsBase< Derived, DirectWriteAccessors > | Base class providing direct read/write coefficient access to matrices and arrays |
| CDiagonal | Expression of a diagonal/subdiagonal/superdiagonal in a matrix |
| CDiagonalMatrix | Represents a diagonal matrix with its storage |
| CDiagonalPreconditioner | A preconditioner based on the digonal entries |
| CDiagonalWrapper | Expression of a diagonal matrix |
| CEigenBase | |
| CEigenSolver | Computes eigenvalues and eigenvectors of general matrices |
| CForceAlignedAccess | Enforce aligned packet loads and stores regardless of what is requested |
| CFullPivHouseholderQR | Householder rank-revealing QR decomposition of a matrix with full pivoting |
| CFullPivLU | LU decomposition of a matrix with complete pivoting, and related features |
| CGeneralizedSelfAdjointEigenSolver | Computes eigenvalues and eigenvectors of the generalized selfadjoint eigen problem |
| CGeneralProduct | Expression of the product of two general matrices or vectors |
| CHessenbergDecomposition | Reduces a square matrix to Hessenberg form by an orthogonal similarity transformation |
| CHomogeneous | Expression of one (or a set of) homogeneous vector(s) |
| CHouseholderQR | Householder QR decomposition of a matrix |
| CHouseholderSequence | Sequence of Householder reflections acting on subspaces with decreasing size |
| CHyperplane | A hyperplane |
| CIdentityPreconditioner | A naive preconditioner which approximates any matrix as the identity matrix |
| ►CIncompleteLUT | Incomplete LU factorization with dual-threshold strategy During the numerical factorization, two dropping rules are used : 1) any element whose magnitude is less than some tolerance is dropped. This tolerance is obtained by multiplying the input tolerance droptol by the average magnitude of all the original elements in the current row. 2) After the elimination of the row, only the fill largest elements in the L part and the fill largest elements in the U part are kept (in addition to the diagonal element ). Note that fill is computed from the input parameter fillfactor which is used the ratio to control the fill_in relatively to the initial number of nonzero elements |
| Ckeep_diag | |
| CInnerStride | Convenience specialization of Stride to specify only an inner stride See class Map for some examples |
| CIOFormat | Stores a set of parameters controlling the way matrices are printed |
| CIterativeSolverBase | Base class for linear iterative solvers |
| CJacobiRotation | Rotation given by a cosine-sine pair |
| CJacobiSVD | Two-sided Jacobi SVD decomposition of a rectangular matrix |
| CLDLT | Robust Cholesky decomposition of a matrix with pivoting |
| CLLT | Standard Cholesky decomposition (LL^T) of a matrix and associated features |
| CMap | A matrix or vector expression mapping an existing array of data |
| CMap< const Quaternion< _Scalar >, _Options > | Quaternion expression mapping a constant memory buffer |
| CMap< Quaternion< _Scalar >, _Options > | Expression of a quaternion from a memory buffer |
| CMapBase | Base class for Map and Block expression with direct access |
| CMappedSparseMatrix | Sparse matrix |
| CMatrix | The matrix class, also used for vectors and row-vectors |
| CMatrixBase | Base class for all dense matrices, vectors, and expressions |
| CMatrixWrapper | Expression of an array as a mathematical vector or matrix |
| CMatrixXpr | |
| CNestByValue | Expression which must be nested by value |
| CNoAlias | Pseudo expression providing an operator = assuming no aliasing |
| CNumTraits | Holds information about the various numeric (i.e. scalar) types allowed by Eigen |
| COuterStride | Convenience specialization of Stride to specify only an outer stride See class Map for some examples |
| CParametrizedLine | A parametrized line |
| CPardisoLDLT | A sparse direct Cholesky (LDLT) factorization and solver based on the PARDISO library |
| CPardisoLLT | A sparse direct Cholesky (LLT) factorization and solver based on the PARDISO library |
| CPardisoLU | A sparse direct LU factorization and solver based on the PARDISO library |
| CPartialPivLU | LU decomposition of a matrix with partial pivoting, and related features |
| CPartialReduxExpr | Generic expression of a partially reduxed matrix |
| CPastixLDLT | A sparse direct supernodal Cholesky (LLT) factorization and solver based on the PaStiX library |
| CPastixLLT | A sparse direct supernodal Cholesky (LLT) factorization and solver based on the PaStiX library |
| CPastixLU | Interface to the PaStix solver |
| CPermutationBase | Base class for permutations |
| CPermutationMatrix | Permutation matrix |
| CPermutationWrapper | Class to view a vector of integers as a permutation matrix |
| CPlainObjectBase | Dense storage base class for matrices and arrays |
| CProductReturnType | Helper class to get the correct and optimized returned type of operator* |
| CQuaternion | The quaternion class used to represent 3D orientations and rotations |
| CQuaternionBase | Base class for quaternion expressions |
| CRealSchur | Performs a real Schur decomposition of a square matrix |
| CReplicate | Expression of the multiple replication of a matrix or vector |
| CReverse | Expression of the reverse of a vector or matrix |
| CRotation2D | Represents a rotation/orientation in a 2 dimensional space |
| CRotationBase | Common base class for compact rotation representations |
| CSelect | Expression of a coefficient wise version of the C++ ternary operator ?: |
| CSelfAdjointEigenSolver | Computes eigenvalues and eigenvectors of selfadjoint matrices |
| CSelfAdjointView | Expression of a selfadjoint matrix from a triangular part of a dense matrix |
| CSimplicialCholesky | |
| ►CSimplicialCholeskyBase | A direct sparse Cholesky factorizations |
| Ckeep_diag | |
| CSimplicialLDLT | A direct sparse LDLT Cholesky factorizations without square root |
| CSimplicialLLT | A direct sparse LLT Cholesky factorizations |
| CSparseMatrix | A versatible sparse matrix representation |
| CSparseMatrixBase | Base class of any sparse matrices or sparse expressions |
| CSparseSelfAdjointView | Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix |
| CSparseVector | Sparse vector class |
| CStride | Holds strides information for Map |
| CSuperILU | A sparse direct incomplete LU factorization and solver based on the SuperLU library |
| CSuperLU | A sparse direct LU factorization and solver based on the SuperLU library |
| CSuperLUBase | The base class for the direct and incomplete LU factorization of SuperLU |
| CTransform | Represents an homogeneous transformation in a N dimensional space |
| CTranslation | Represents a translation transformation |
| CTranspose | Expression of the transpose of a matrix |
| CTranspositions | Represents a sequence of transpositions (row/column interchange) |
| CTriangularView | Base class for triangular part in a matrix |
| CTridiagonalization | Tridiagonal decomposition of a selfadjoint matrix |
| CTriplet | A small structure to hold a non zero as a triplet (i,j,value) |
| CUmfPackLU | A sparse LU factorization and solver based on UmfPack |
| CVectorBlock | Expression of a fixed-size or dynamic-size sub-vector |
| CVectorwiseOp | Pseudo expression providing partial reduction operations |
| CWithFormat | Pseudo expression providing matrix output with given format |
| CProduct | Expression of the product of two arbitrary matrices or vectors |
| CScaling | Represents a generic uniform scaling transformation |
