Lines Matching refs:Matrix
23 * \brief Standard Cholesky decomposition (LL^T) of a matrix and associated features
25 * \param MatrixType the type of the matrix of which we are computing the LL^T Cholesky decomposition
30 * matrix A such that A = LL^* = U^*U, where L is lower triangular.
89 LLT(const MatrixType& matrix)
90 : m_matrix(matrix.rows(), matrix.cols()),
93 compute(matrix);
96 /** \returns a view of the upper triangular matrix U */
103 /** \returns a view of the lower triangular matrix L */
112 * Since this LLT class assumes anyway that the matrix A is invertible, the solution
126 && "LLT::solve(): invalid number of rows of the right hand side matrix b");
144 LLT& compute(const MatrixType& matrix);
146 /** \returns the LLT decomposition matrix
162 * \c NumericalIssue if the matrix.appears to be negative.
199 typedef Matrix<Scalar,Dynamic,1> TempVectorType;
304 // partition the matrix:
375 /** Computes / recomputes the Cholesky decomposition A = LL^* = U^*U of \a matrix
437 * \param bAndX represents both the right-hand side matrix b and result x.
441 * This version avoids a copy when the right hand side matrix b is not
456 /** \returns the matrix represented by the decomposition,
