Home
last modified time | relevance | path

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

/external/eigen/Eigen/src/PaStiXSupport/
DPaStiXSupport.h243 void analyzePattern(ColSpMatrix& mat);
319 analyzePattern(mat);
328 void PastixBase<Derived>::analyzePattern(ColSpMatrix& mat)
467 void analyzePattern(const MatrixType& matrix)
472 Base::analyzePattern(temp);
575 void analyzePattern(const MatrixType& matrix)
579 Base::analyzePattern(temp);
656 void analyzePattern(const MatrixType& matrix)
660 Base::analyzePattern(temp);
/external/eigen/Eigen/src/SparseCholesky/
DSimplicialCholesky.h208 void analyzePattern(const MatrixType& a, bool doLDLT) in analyzePattern() function
352 void analyzePattern(const MatrixType& a)
354 Base::analyzePattern(a, false);
447 void analyzePattern(const MatrixType& a)
449 Base::analyzePattern(a, true);
542 void analyzePattern(const MatrixType& a)
544 Base::analyzePattern(a, m_LDLT);
/external/eigen/Eigen/src/IterativeLinearSolvers/
DBasicPreconditioners.h55 DiagonalPreconditioner& analyzePattern(const MatType& ) in analyzePattern() function
135 IdentityPreconditioner& analyzePattern(const MatrixType& ) { return *this; }
DIterativeSolverBase.h65 Derived& analyzePattern(const MatrixType& A) in analyzePattern() function
67 m_preconditioner.analyzePattern(A); in analyzePattern()
DIncompleteLUT.h138 void analyzePattern(const MatrixType& amat);
151 analyzePattern(amat); in compute()
222 void IncompleteLUT<Scalar>::analyzePattern(const _MatrixType& amat) in analyzePattern() function
/external/eigen/Eigen/src/SuperLUSupport/
DSuperLUSupport.h335 derived().analyzePattern(matrix);
371 void analyzePattern(const MatrixType& /*matrix*/)
513 void analyzePattern(const MatrixType& matrix)
517 Base::analyzePattern(matrix);
850 void analyzePattern(const MatrixType& matrix)
852 Base::analyzePattern(matrix);
/external/eigen/bench/spbench/
Dtest_sparseLU.cpp73 solver.analyzePattern(A); in main()
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
DIncompleteCholesky.h74 void analyzePattern(const MatrixType& mat) in analyzePattern() function
87 analyzePattern(matrix); in compute()
/external/eigen/Eigen/src/SparseLU/
DSparseLU.h104 void analyzePattern (const MatrixType& matrix);
115 analyzePattern(matrix); in compute()
415 void SparseLU<MatrixType, OrderingType>::analyzePattern(const MatrixType& mat) in analyzePattern() function
/external/eigen/Eigen/src/SparseQR/
DSparseQR.h100 analyzePattern(mat);
103 void analyzePattern(const MatrixType& mat);
282 void SparseQR<MatrixType,OrderingType>::analyzePattern(const MatrixType& mat)
/external/eigen/Eigen/src/CholmodSupport/
DCholmodSupport.h214 analyzePattern(matrix); in compute()
253 void analyzePattern(const MatrixType& matrix) in analyzePattern() function
/external/eigen/Eigen/src/PardisoSupport/
DPardisoSupport.h157 Derived& analyzePattern(const MatrixType& matrix);
308 Derived& PardisoImpl<Derived>::analyzePattern(const MatrixType& a)
/external/eigen/doc/
DSparseLinearSystems.dox91 solver.analyzePattern(A); // for this step the numerical values of A are not used
102 The compute() method is equivalent to calling both analyzePattern() and factorize().
108 …ss of solvers precisely, the compute step is further subdivided into analyzePattern() and factoriz…
110 The goal of analyzePattern() is to reorder the nonzero elements of the matrix, such that the factor…
/external/ceres-solver/internal/ceres/
Dsparse_normal_cholesky_solver.cc188 simplicial_ldlt_->analyzePattern(AtA); in SolveImplUsingEigen()
Dschur_complement_solver.cc487 simplicial_ldlt_->analyzePattern(eigen_lhs); in SolveReducedLinearSystemUsingEigen()
/external/eigen/Eigen/src/UmfPackSupport/
DUmfPackSupport.h248 void analyzePattern(const InputMatrixType& matrix)
/external/eigen/test/
Dsparse_solver.h42 solver.analyzePattern(A); in check_sparse_solving()