Searched refs:m_etree (Results 1 – 2 of 2) sorted by relevance
| /external/eigen/Eigen/src/SparseLU/ |
| D | SparseLU.h | 380 IndexVector m_etree; // Column elimination tree variable
444 internal::coletree(m_mat, m_etree,firstRowElt); in analyzePattern()
450 internal::treePostorder(StorageIndex(m_mat.cols()), m_etree, post); in analyzePattern()
456 for (Index i = 0; i < m; ++i) iwork(post(i)) = post(m_etree(i)); in analyzePattern()
457 m_etree = iwork; in analyzePattern()
573 Base::heap_relax_snode(n, m_etree, m_perfv.relax, marker, relax_end); in factorize()
575 Base::relax_snode(n, m_etree, m_perfv.relax, marker, relax_end); in factorize()
|
| /external/eigen/Eigen/src/SparseQR/ |
| D | SparseQR.h | 288 IndexVector m_etree; // Column elimination tree
327 internal::coletree(matCpy, m_etree, m_firstRowElt, m_outputPerm_c.indices().data());
368 internal::coletree(m_pmat, m_etree, m_firstRowElt, m_outputPerm_c.indices().data());
446 for (; mark(st) != col; st = m_etree(st))
489 if(m_etree(Ridx(i)) == nonzeroCol)
568 internal::coletree(m_pmat, m_etree, m_firstRowElt, m_pivotperm.indices().data());
|