Home
last modified time | relevance | path

Searched refs:rhsCols (Results 1 – 5 of 5) sorted by relevance

/external/eigen/Eigen/src/misc/
DSparseSolve.h55 int rhsCols = m_rhs.cols();
57 Eigen::Matrix<DestScalar,Dynamic,Dynamic> tmp(size,rhsCols);
58 Eigen::Matrix<DestScalar,Dynamic,Dynamic> tmpX(size,rhsCols);
59 for(int k=0; k<rhsCols; k+=NbColsAtOnce)
61 int actualCols = std::min<int>(rhsCols-k, NbColsAtOnce);
/external/eigen/test/
Dsparse_solver.h201 int rhsCols = internal::random<int>(1,16); in check_sparse_spd_solving() local
202 double density = (std::max)(8./(size*rhsCols), 0.1); in check_sparse_spd_solving()
203 SpMat B(size,rhsCols); in check_sparse_spd_solving()
205 DenseMatrix dB(size,rhsCols); in check_sparse_spd_solving()
288 int rhsCols = internal::random<int>(1,16); in check_sparse_square_solving() local
297 DenseMatrix dB(size,rhsCols); in check_sparse_square_solving()
298 SpMat B(size,rhsCols); in check_sparse_square_solving()
299 double density = (std::max)(8./(size*rhsCols), 0.1); in check_sparse_square_solving()
/external/eigen/Eigen/src/IterativeLinearSolvers/
DIterativeSolverBase.h202 int rhsCols = b.cols(); in _solve_sparse() local
206 for(int k=0; k<rhsCols; ++k) in _solve_sparse()
/external/eigen/Eigen/src/SuperLUSupport/
DSuperLUSupport.h645 const int rhsCols = b.cols();
653 m_sluFerr.resize(rhsCols);
654 m_sluBerr.resize(rhsCols);
956 const int rhsCols = b.cols();
963 m_sluFerr.resize(rhsCols);
964 m_sluBerr.resize(rhsCols);
/external/eigen/Eigen/src/UmfPackSupport/
DUmfPackSupport.h423 const int rhsCols = b.cols();
429 for (int j=0; j<rhsCols; ++j)