Lines Matching full:matrix
29 * \brief Robust Cholesky decomposition of a matrix with pivoting
31 * \param MatrixType the type of the matrix of which to compute the LDL^T Cholesky decomposition
36 * matrix \f$ A \f$ such that \f$ A = P^TLDL^*P \f$, where P is a permutation matrix, L
37 * is lower triangular with a unit diagonal and D is a diagonal matrix.
55 Options = MatrixType::Options & ~RowMajorBit, // these are the options for the TmpMatrixType, we need a ColMajor matrix here!
63 typedef Matrix<Scalar, RowsAtCompileTime, 1, Options, MaxRowsAtCompileTime, 1> TmpMatrixType;
98 * This calculates the decomposition for the input \a matrix.
101 LDLT(const MatrixType& matrix)
102 : m_matrix(matrix.rows(), matrix.cols()),
103 m_transpositions(matrix.rows()),
104 m_temporary(matrix.rows()),
108 compute(matrix);
119 /** \returns a view of the upper triangular matrix U */
126 /** \returns a view of the lower triangular matrix L */
133 /** \returns the permutation matrix P as a transposition sequence.
141 /** \returns the coefficients of the diagonal matrix D */
148 /** \returns true if the matrix is positive (semidefinite) */
162 /** \returns true if the matrix is negative (semidefinite) */
177 * \f$ L^* y_4 = y_3 \f$ and \f$ P x = y_4 \f$ in succession. If the matrix \f$ A \f$ is singular, then
190 && "LDLT::solve(): invalid number of rows of the right hand side matrix b");
206 LDLT& compute(const MatrixType& matrix);
211 /** \returns the internal LDLT decomposition matrix
229 * \c NumericalIssue if the matrix.appears to be negative.
303 // partition the matrix:
345 // original matrix is not of full rank.
432 /** Compute / recompute the LDLT decomposition A = L D L^* = U^* D U of \a matrix
536 * \param bAndX represents both the right-hand side matrix b and result x.
540 * This version avoids a copy when the right hand side matrix b is not
557 /** \returns the matrix represented by the decomposition,
