/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
IncompleteCholesky.h | 77 ord(mat.template selfadjointView<UpLo>(), m_perm); 95 if (m_perm.rows() == b.rows()) 96 x = m_perm.inverse() * b; 102 if (m_perm.rows() == b.rows()) 103 x = m_perm * x; 123 PermutationType m_perm; member in class:Eigen::IncompleteCholesky 141 if (m_perm.rows() == mat.rows() ) // To detect the null permutation 142 m_L.template selfadjointView<Lower>() = mat.template selfadjointView<_UpLo>().twistedBy(m_perm);
|
/external/eigen/Eigen/src/PardisoSupport/ |
PardisoSupport.h | 214 internal::pardiso_run_selector<Index>::run(m_pt, 1, 1, m_type, -1, m_size, 0, 0, 0, m_perm.data(), 0, 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/ |
PaStiXSupport.h | 255 m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data()); 269 mutable Matrix<Index,Dynamic,1> m_perm; // Permutation vector member in class:Eigen::PastixBase 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/ |
SparseSelfAdjointView.h | 479 : m_matrix(mat), m_perm(perm) 488 // internal::permute_symm_to_fullsymm<UpLo>(m_matrix,_dest,m_perm.indices().data()); 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; member in class:Eigen::SparseSymmetricPermutationProduct
|