Home
last modified time | relevance | path

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

/external/eigen/Eigen/src/IterativeLinearSolvers/
DIncompleteCholesky.h122 if(pinv.size()>0) m_perm = pinv.inverse(); in analyzePattern()
123 else m_perm.resize(0); in analyzePattern()
158 if (m_perm.rows() == b.rows()) x = m_perm * b; in _solve_impl()
164 if (m_perm.rows() == b.rows()) in _solve_impl()
165 x = m_perm.inverse() * x; in _solve_impl()
175 const PermutationType& permutationP() const { eigen_assert("m_analysisIsOk"); return m_perm; } in permutationP()
184 PermutationType m_perm; variable
204 if (m_perm.rows() == mat.rows() ) // To detect the null permutation in factorize()
208 tmp = mat.template selfadjointView<_UpLo>().twistedBy(m_perm); in factorize()
/external/eigen/Eigen/src/PardisoSupport/
DPardisoSupport.h186 …un(m_pt, 1, 1, m_type, -1, internal::convert_index<StorageIndex>(m_size),0, 0, 0, m_perm.data(), 0,
253 mutable IntColVectorType m_perm;
265 m_perm.setZero(m_size);
271 … m_perm.data(), 0, m_iparm.data(), m_msglvl, NULL, NULL);
286 m_perm.setZero(m_size);
292 … m_perm.data(), 0, m_iparm.data(), m_msglvl, NULL, NULL);
312 … m_perm.data(), 0, m_iparm.data(), m_msglvl, NULL, NULL);
359 … m_perm.data(), internal::convert_index<StorageIndex>(nrhs), m_iparm.data(), m_msglvl,
/external/eigen/Eigen/src/PaStiXSupport/
DPaStiXSupport.h236 m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data());
249 mutable Matrix<StorageIndex,Dynamic,1> m_perm; // Permutation vector
316 m_perm.resize(m_size);
322 mat.valuePtr(), m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data());
347 mat.valuePtr(), m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data());
381 … m_perm.data(), m_invp.data(), &x(0, i), rhs, m_iparm.data(), m_dparm.data());
/external/eigen/Eigen/src/SparseCore/
DSparseSelfAdjointView.h614 : m_matrix(mat), m_perm(perm)
621 const Perm& perm() const { return m_perm; }
625 const Perm& m_perm;