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

  /external/eigen/unsupported/Eigen/src/SparseExtra/
MatrixMarketIterator.h 79 if (m_matIsLoaded) return m_mat;
82 if ( !loadMarket(m_mat, matrix_file))
85 return m_mat;
92 B = m_mat;
93 m_mat = B.template selfadjointView<Lower>();
95 return m_mat;
111 m_rhs.resize(m_mat.cols());
118 m_refX.resize(m_mat.cols());
120 m_rhs = m_mat * m_refX;
143 m_refX.resize(m_mat.cols())
216 MatrixType m_mat; \/\/ Current matrix member in class:Eigen::MatrixMarketIterator
    [all...]
  /external/eigen/Eigen/src/SparseLU/
SparseLU.h 120 inline Index rows() const { return m_mat.rows(); }
121 inline Index cols() const { return m_mat.cols(); }
335 NCMatrix m_mat; // The input (permuted ) matrix member in class:Eigen::SparseLU
381 m_mat = mat;
383 m_mat.uncompress(); //NOTE: The effect of this command is only to create the InnerNonzeros pointers. FIXME : This vector is filled but not subsequently used.
390 for(Index i = 0; i <= mat.cols(); i++) outerIndexPtr_t[i] = m_mat.outerIndexPtr()[i];
395 m_mat.outerIndexPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i];
396 m_mat.innerNonZeroPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i+1] - outerIndexPtr[i];
402 internal::coletree(m_mat, m_etree,firstRowElt);
408 internal::treePostorder(m_mat.cols(), m_etree, post);
    [all...]

Completed in 241 milliseconds