HomeSort by relevance Sort by last modified time
    Searched refs:m_etree (Results 1 - 2 of 2) sorted by null

  /external/eigen/Eigen/src/SparseLU/
SparseLU.h 380 IndexVector m_etree; // Column elimination tree member in class:Eigen::SparseLU
444 internal::coletree(m_mat, m_etree,firstRowElt);
450 internal::treePostorder(StorageIndex(m_mat.cols()), m_etree, post); local
456 for (Index i = 0; i < m; ++i) iwork(post(i)) = post(m_etree(i));
457 m_etree = iwork;
573 Base::heap_relax_snode(n, m_etree, m_perfv.relax, marker, relax_end);
575 Base::relax_snode(n, m_etree, m_perfv.relax, marker, relax_end);
  /external/eigen/Eigen/src/SparseQR/
SparseQR.h 288 IndexVector m_etree; // Column elimination tree member in class:Eigen::SparseQR
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());

Completed in 65 milliseconds