Home
last modified time | relevance | path

Searched refs:m_perm (Results 1 – 4 of 4) sorted by relevance

/external/eigen/unsupported/Eigen/src/IterativeSolvers/
DIncompleteCholesky.h77 ord(mat.template selfadjointView<UpLo>(), m_perm); in analyzePattern()
95 if (m_perm.rows() == b.rows()) in _solve()
96 x = m_perm.inverse() * b; in _solve()
102 if (m_perm.rows() == b.rows()) in _solve()
103 x = m_perm * x; in _solve()
123 PermutationType m_perm; variable
141 if (m_perm.rows() == mat.rows() ) // To detect the null permutation in factorize()
142 m_L.template selfadjointView<Lower>() = mat.template selfadjointView<_UpLo>().twistedBy(m_perm); in factorize()
/external/eigen/Eigen/src/PardisoSupport/
DPardisoSupport.h214 …internal::pardiso_run_selector<Index>::run(m_pt, 1, 1, m_type, -1, m_size, 0, 0, 0, m_perm.data(),…
277 mutable IntColVectorType m_perm;
292 m_perm.setZero(m_size);
298 … m_perm.data(), 0, m_iparm.data(), m_msglvl, NULL, NULL);
315 m_perm.setZero(m_size);
321 … m_perm.data(), 0, m_iparm.data(), m_msglvl, NULL, NULL);
341 … m_perm.data(), 0, m_iparm.data(), m_msglvl, NULL, NULL);
385 m_perm.data(), nrhs, m_iparm.data(), m_msglvl,
/external/eigen/Eigen/src/PaStiXSupport/
DPaStiXSupport.h255 m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data());
269 mutable Matrix<Index,Dynamic,1> m_perm; // Permutation vector
337 m_perm.resize(m_size);
343 mat.valuePtr(), m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data());
368 mat.valuePtr(), m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data());
402 … m_perm.data(), m_invp.data(), &x(0, i), rhs, m_iparm.data(), m_dparm.data());
/external/eigen/Eigen/src/SparseCore/
DSparseSelfAdjointView.h479 : m_matrix(mat), m_perm(perm)
490 internal::permute_symm_to_fullsymm<UpLo>(m_matrix,tmp,m_perm.indices().data());
496 internal::permute_symm_to_symm<UpLo,DestUpLo>(m_matrix,dest.matrix(),m_perm.indices().data());
501 const Perm& m_perm;