Lines Matching full:matrix
23 * \tparam _MatrixType The type of the sparse matrix. It should be a symmetric
24 * matrix. It is advised to give a row-oriented sparse matrix
25 * \tparam _UpLo The triangular part of the matrix to reference.
38 typedef Matrix<Scalar,Dynamic,1> ScalarType;
39 typedef Matrix<Index,Dynamic, 1> IndexType;
44 IncompleteCholesky(const MatrixType& matrix) : m_shift(1),m_factorizationIsOk(false)
46 compute(matrix);
57 * \c NumericalIssue if the matrix appears to be negative.
85 void compute (const MatrixType& matrix)
87 analyzePattern(matrix);
88 factorize(matrix);
112 && "IncompleteLLT::solve(): invalid number of rows of the right hand side matrix b");
117 ScalarType m_scal; // The vector for scaling the matrix
138 // Dropping strategies : Keep only the p largest elements per column, where p is the number of elements in the column of the original matrix. Other strategies will be added
164 // Scale and compute the shift for the matrix
173 // Apply the shift to the diagonal elements of the matrix
222 // Insert the largest p elements in the matrix
