HomeSort by relevance Sort by last modified time
    Searched refs:analyzePattern (Results 1 - 14 of 14) sorted by null

  /external/eigen/Eigen/src/IterativeLinearSolvers/
BasicPreconditioners.h 59 DiagonalPreconditioner& analyzePattern(const MatType& )
145 LeastSquareDiagonalPreconditioner& analyzePattern(const MatType& )
210 IdentityPreconditioner& analyzePattern(const MatrixType& ) { return *this; }
IterativeSolverBase.h 193 * Currently, this function mostly calls analyzePattern on the preconditioner. In the future
197 Derived& analyzePattern(const EigenBase<MatrixDerived>& A)
200 m_preconditioner.analyzePattern(matrix());
219 eigen_assert(m_analysisIsOk && "You must first call analyzePattern()");
IncompleteLUT.h 149 void analyzePattern(const MatrixType& amat);
162 analyzePattern(amat);
223 void IncompleteLUT<Scalar,StorageIndex>::analyzePattern(const _MatrixType& amat)
269 eigen_assert(m_analysisIsOk && "You must first call analyzePattern()");
IncompleteCholesky.h 75 * You must call compute() or the pair analyzePattern()/factorize() to make it valid.
99 * or a call to compute() or analyzePattern().
117 void analyzePattern(const MatrixType& mat)
132 * The method analyzePattern() or compute() must have been called beforehand
135 * \sa compute(), analyzePattern()
142 * It is a shortcut for a sequential call to the analyzePattern() and factorize() methods.
144 * \sa analyzePattern(), factorize()
149 analyzePattern(mat);
199 eigen_assert(m_analysisIsOk && "analyzePattern() should be called first");
203 // Apply the fill-reducing permutation computed in analyzePattern()
    [all...]
  /external/eigen/Eigen/src/PaStiXSupport/
PaStiXSupport.h 167 * \sa analyzePattern() factorize()
185 * \sa analyzePattern() factorize()
224 void analyzePattern(ColSpMatrix& mat);
299 analyzePattern(mat);
307 void PastixBase<Derived>::analyzePattern(ColSpMatrix& mat)
434 * \sa analyzePattern() factorize()
448 void analyzePattern(const MatrixType& matrix)
453 Base::analyzePattern(temp);
459 * \sa analyzePattern()
545 * \sa analyzePattern() factorize(
    [all...]
  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 230 void analyzePattern(const MatrixType& a, bool doLDLT)
376 void analyzePattern(const MatrixType& a)
378 Base::analyzePattern(a, false);
385 * \sa analyzePattern()
473 void analyzePattern(const MatrixType& a)
475 Base::analyzePattern(a, true);
482 * \sa analyzePattern()
568 void analyzePattern(const MatrixType& a)
570 Base::analyzePattern(a, m_LDLT);
577 * \sa analyzePattern()
    [all...]
  /external/eigen/bench/spbench/
test_sparseLU.cpp 73 solver.analyzePattern(A);
  /external/eigen/Eigen/src/SuperLUSupport/
SuperLUSupport.h 367 derived().analyzePattern(matrix);
377 void analyzePattern(const MatrixType& /*matrix*/)
524 void analyzePattern(const MatrixType& matrix)
528 Base::analyzePattern(matrix);
535 * \sa analyzePattern()
615 eigen_assert(m_analysisIsOk && "You must first call analyzePattern()");
651 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or analyzePattern()/factorize()");
709 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for extracting factors, you must first call either compute() or analyzePattern()/factorize()");
795 eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for computing the determinant, you must first call either compute() or analyzePattern()/factorize()");
871 void analyzePattern(const MatrixType& matrix
    [all...]
  /external/eigen/Eigen/src/SparseLU/
SparseLU.h 50 * solver.analyzePattern(A);
116 void analyzePattern (const MatrixType& matrix);
127 analyzePattern(matrix);
411 void SparseLU<MatrixType, OrderingType>::analyzePattern(const MatrixType& mat)
499 eigen_assert(m_analysisIsOk && "analyzePattern() should be called first");
507 // Apply the column permutation computed in analyzepattern()
  /external/eigen/Eigen/src/SparseQR/
SparseQR.h 112 * \sa analyzePattern(), factorize()
116 analyzePattern(mat);
119 void analyzePattern(const MatrixType& mat);
307 void SparseQR<MatrixType,OrderingType>::analyzePattern(const MatrixType& mat)
342 * The function SparseQR::analyzePattern(const MatrixType&) must have been called beforehand with
352 eigen_assert(m_analysisIsok && "analyzePattern() should be called before this step");
  /external/eigen/Eigen/src/CholmodSupport/
CholmodSupport.h 234 analyzePattern(matrix);
245 void analyzePattern(const MatrixType& matrix)
265 * \sa analyzePattern()
269 eigen_assert(m_analysisIsOk && "You must first call analyzePattern()");
  /external/eigen/Eigen/src/PardisoSupport/
PardisoSupport.h 166 Derived& analyzePattern(const MatrixType& matrix);
172 * \sa analyzePattern()
280 Derived& PardisoImpl<Derived>::analyzePattern(const MatrixType& a)
304 eigen_assert(m_analysisIsOk && "You must first call analyzePattern()");
  /external/eigen/Eigen/src/UmfPackSupport/
UmfPackSupport.h 258 void analyzePattern(const InputMatrixType& matrix)
305 * \sa analyzePattern(), compute()
310 eigen_assert(m_analysisIsOk && "UmfPackLU: you must first call analyzePattern()");
330 * \sa analyzePattern(), compute()
334 eigen_assert(m_analysisIsOk && "UmfPackLU: you must first call analyzePattern()");
340 * \sa analyzePattern(), compute()
343 eigen_assert(m_analysisIsOk && "UmfPackLU: you must first call analyzePattern()");
  /external/eigen/test/
sparse_solver.h 70 VERIFY(solver.info() == Success && "solving failed when using analyzePattern/factorize API");
76 solver.analyzePattern(A);
78 VERIFY(solver.info() == Success && "factorization failed when using analyzePattern/factorize API");
80 VERIFY(solver.info() == Success && "solving failed when using analyzePattern/factorize API");

Completed in 254 milliseconds