Lines Matching defs:compute
97 derived().compute(matrix);
123 * \sa compute()
137 * \sa compute()
194 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()");
222 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()");
245 void compute(const MatrixType& matrix)
396 SimplicialLLT& compute(const MatrixType& matrix)
398 Base::template compute<false>(matrix);
490 SimplicialLDLT& compute(const MatrixType& matrix)
492 Base::template compute<true>(matrix);
552 compute(matrix);
582 SimplicialCholesky& compute(const MatrixType& matrix)
585 Base::template compute<true>(matrix);
587 Base::template compute<false>(matrix);
620 eigen_assert(Base::m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()");
677 // Note that amd compute the inverse permutation
768 // compute nonzero pattern of kth row of L, in topological order
790 /* compute numerical values kth row of L (a sparse triangular solve) */
