Searched refs:m_etree (Results 1 – 2 of 2) sorted by relevance
| /external/eigen/Eigen/src/SparseLU/ |
| D | SparseLU.h | 340 IndexVector m_etree; // Column elimination tree variable
402 internal::coletree(m_mat, m_etree,firstRowElt); in analyzePattern()
408 internal::treePostorder(m_mat.cols(), m_etree, post); in analyzePattern()
414 for (Index i = 0; i < m; ++i) iwork(post(i)) = post(m_etree(i)); in analyzePattern()
415 m_etree = iwork; in analyzePattern()
529 Base::heap_relax_snode(n, m_etree, m_perfv.relax, marker, relax_end); in factorize()
531 Base::relax_snode(n, m_etree, m_perfv.relax, marker, relax_end); in factorize()
|
| /external/eigen/Eigen/src/SparseQR/ |
| D | SparseQR.h | 262 IndexVector m_etree; // Column elimination tree
299 internal::coletree(mat, m_etree, m_firstRowElt, m_outputPerm_c.indices().data());
393 for (; mark(st) != col; st = m_etree(st))
436 if(m_etree(Ridx(i)) == nonzeroCol)
516 internal::coletree(m_pmat, m_etree, m_firstRowElt, m_pivotperm.indices().data());
|