Home
last modified time | relevance | path

Searched refs:analyzePattern (Results 1 – 16 of 16) sorted by relevance

/external/eigen/Eigen/src/PaStiXSupport/
DPaStiXSupport.h224 void analyzePattern(ColSpMatrix& mat);
299 analyzePattern(mat);
307 void PastixBase<Derived>::analyzePattern(ColSpMatrix& mat)
448 void analyzePattern(const MatrixType& matrix)
453 Base::analyzePattern(temp);
558 void analyzePattern(const MatrixType& matrix)
562 Base::analyzePattern(temp);
642 void analyzePattern(const MatrixType& matrix)
646 Base::analyzePattern(temp);
/external/eigen/Eigen/src/IterativeLinearSolvers/
DBasicPreconditioners.h59 DiagonalPreconditioner& analyzePattern(const MatType& ) in analyzePattern() function
145 LeastSquareDiagonalPreconditioner& analyzePattern(const MatType& ) in analyzePattern() function
210 IdentityPreconditioner& analyzePattern(const MatrixType& ) { return *this; } in analyzePattern() function
DIncompleteLUT.h149 void analyzePattern(const MatrixType& amat);
162 analyzePattern(amat); in compute()
223 void IncompleteLUT<Scalar,StorageIndex>::analyzePattern(const _MatrixType& amat) in analyzePattern() function
DIterativeSolverBase.h197 Derived& analyzePattern(const EigenBase<MatrixDerived>& A) in analyzePattern() function
200 m_preconditioner.analyzePattern(matrix()); in analyzePattern()
DIncompleteCholesky.h111 void analyzePattern(const MatrixType& mat) in analyzePattern() function
143 analyzePattern(mat); in compute()
/external/eigen/Eigen/src/SparseCholesky/
DSimplicialCholesky.h238 void analyzePattern(const MatrixType& a, bool doLDLT)
384 void analyzePattern(const MatrixType& a)
386 Base::analyzePattern(a, false);
481 void analyzePattern(const MatrixType& a)
483 Base::analyzePattern(a, true);
576 void analyzePattern(const MatrixType& a)
578 Base::analyzePattern(a, m_LDLT);
/external/eigen/Eigen/src/SuperLUSupport/
DSuperLUSupport.h367 derived().analyzePattern(matrix);
377 void analyzePattern(const MatrixType& /*matrix*/)
524 void analyzePattern(const MatrixType& matrix)
528 Base::analyzePattern(matrix);
870 void analyzePattern(const MatrixType& matrix)
872 Base::analyzePattern(matrix);
/external/eigen/bench/spbench/
Dtest_sparseLU.cpp73 solver.analyzePattern(A); in main()
/external/eigen/Eigen/src/SparseQR/
DSparseQR.h129 analyzePattern(mat);
132 void analyzePattern(const MatrixType& mat);
320 void SparseQR<MatrixType,OrderingType>::analyzePattern(const MatrixType& mat)
/external/eigen/Eigen/src/PardisoSupport/
DPardisoSupport.h167 Derived& analyzePattern(const MatrixType& matrix);
281 Derived& PardisoImpl<Derived>::analyzePattern(const MatrixType& a)
/external/eigen/Eigen/src/SparseLU/
DSparseLU.h174 void analyzePattern (const MatrixType& matrix);
185 analyzePattern(matrix); in compute()
510 void SparseLU<MatrixType, OrderingType>::analyzePattern(const MatrixType& mat) in analyzePattern() function
/external/eigen/doc/
DSparseLinearSystems.dox129 solver.analyzePattern(A); // for this step the numerical values of A are not used
140 The compute() method is equivalent to calling both analyzePattern() and factorize().
148 …ss of solvers precisely, the compute step is further subdivided into analyzePattern() and factoriz…
150 The goal of analyzePattern() is to reorder the nonzero elements of the matrix, such that the factor…
/external/eigen/Eigen/src/CholmodSupport/
DCholmodSupport.h275 analyzePattern(matrix);
286 void analyzePattern(const MatrixType& matrix)
/external/eigen/Eigen/src/KLUSupport/
DKLUSupport.h163 void analyzePattern(const InputMatrixType& matrix) in analyzePattern() function
/external/eigen/test/
Dsparse_solver.h81 solver.analyzePattern(A); in check_sparse_solving()
205 solver.analyzePattern(A); in check_sparse_solving()
/external/eigen/Eigen/src/UmfPackSupport/
DUmfPackSupport.h394 void analyzePattern(const InputMatrixType& matrix) in analyzePattern() function