Home | History | Annotate | Download | only in SparseCholesky

Lines Matching defs:compute

89       derived().compute(matrix);
158 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()");
194 void compute(const MatrixType& matrix)
364 SimplicialLLT& compute(const MatrixType& matrix)
366 Base::template compute<false>(matrix);
461 SimplicialLDLT& compute(const MatrixType& matrix)
463 Base::template compute<true>(matrix);
523 compute(matrix);
553 SimplicialCholesky& compute(const MatrixType& matrix)
556 Base::template compute<true>(matrix);
558 Base::template compute<false>(matrix);
591 eigen_assert(Base::m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()");
655 // Note that ordering methods compute the inverse permutation