Home
last modified time | relevance | path

Searched refs:m_mat (Results 1 – 2 of 2) sorted by relevance

/external/eigen/unsupported/Eigen/src/SparseExtra/
DMatrixMarketIterator.h79 if (m_matIsLoaded) return m_mat; in matrix()
82 if ( !loadMarket(m_mat, matrix_file)) in matrix()
85 return m_mat; in matrix()
92 B = m_mat; in matrix()
93 m_mat = B.template selfadjointView<Lower>(); in matrix()
95 return m_mat; in matrix()
111 m_rhs.resize(m_mat.cols()); in rhs()
118 m_refX.resize(m_mat.cols()); in rhs()
120 m_rhs = m_mat * m_refX; in rhs()
143 m_refX.resize(m_mat.cols()); in refX()
[all …]
/external/eigen/Eigen/src/SparseLU/
DSparseLU.h120 inline Index rows() const { return m_mat.rows(); } in rows()
121 inline Index cols() const { return m_mat.cols(); } in cols()
379 NCMatrix m_mat; // The input (permuted ) matrix variable
425 m_mat = mat; in analyzePattern()
427m_mat.uncompress(); //NOTE: The effect of this command is only to create the InnerNonzeros pointer… in analyzePattern()
434 for(Index i = 0; i <= mat.cols(); i++) outerIndexPtr_t[i] = m_mat.outerIndexPtr()[i]; in analyzePattern()
439 m_mat.outerIndexPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i]; in analyzePattern()
440 m_mat.innerNonZeroPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i+1] - outerIndexPtr[i]; in analyzePattern()
446 internal::coletree(m_mat, m_etree,firstRowElt); in analyzePattern()
452 internal::treePostorder(m_mat.cols(), m_etree, post); in analyzePattern()
[all …]