HomeSort by relevance Sort by last modified time
    Searched refs:nonZeros (Results 26 - 41 of 41) sorted by null

12

  /external/eigen/test/
sparse_solvers.cpp 65 MappedSparseMatrix<Scalar> mm2(rows, cols, cm2.nonZeros(), cm2.outerIndexPtr(), cm2.innerIndexPtr(), cm2.valuePtr());
  /external/eigen/Eigen/src/PaStiXSupport/
PaStiXSupport.h 96 for(i = 0; i < mat.nonZeros(); ++i)
111 for(i = 0; i < mat.nonZeros(); ++i)
  /external/eigen/Eigen/src/SparseQR/
SparseQR.h 309 m_R.reserve(2*mat.nonZeros()); //FIXME Get a more accurate estimation through symbolic factorization with the etree
310 m_Q.reserve(2*mat.nonZeros());
411 // Get the nonzeros indexes of the current column of R
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
IncompleteCholesky.h 147 Index nnz = m_L.nonZeros();
  /external/eigen/unsupported/Eigen/src/SparseExtra/
DynamicSparseMatrix.h 29 * decrease as the number of nonzeros per inner-vector increase. In practice, we observed very good performance
30 * till about 100 nonzeros/vector, and the performance remains relatively good till 500 nonzeros/vectors.
120 Index nonZeros() const
188 /** Suppress all nonzeros which are smaller than \a reference under the tolerence \a epsilon */
MarketIO.h 236 out << mat.rows() << " " << mat.cols() << " " << mat.nonZeros() << "\n";
  /external/eigen/Eigen/src/CholmodSupport/
CholmodSupport.h 55 res.nzmax = mat.nonZeros();
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 267 Index fill_in = static_cast<Index> (amat.nonZeros()*m_fillfactor)/n+1;
  /external/eigen/Eigen/src/SparseCore/
TriangularSolver.h 220 res.reserve(other.nonZeros());
225 tempVector.init(.99/*float(other.col(col).nonZeros())/float(other.rows())*/);
280 // std::cout << "tempVector.nonZeros() == " << int(count) << " / " << (other.rows()) << "\n";
SparseMatrix.h 24 * space inbetween the nonzeros of two successive colmuns (resp. rows) such that insertion of new non-zero
246 inline Index nonZeros() const
489 /** Suppresses all nonzeros which are \b much \b smaller \b than \a reference under the tolerence \a epsilon */
495 /** Turns the matrix into compressed format, and suppresses all nonzeros which do not satisfy the predicate \a keep.
750 for (Index i=0; i<m.nonZeros(); ++i)
    [all...]
  /external/eigen/bench/spbench/
spbenchsolver.h 505 statbuf << " <ENTRIES> " << it.matrix().nonZeros() << "</ENTRIES>\n";
  /external/eigen/Eigen/src/SuperLUSupport/
SuperLUSupport.h 186 res.storage.nnz = mat.nonZeros();
245 res.storage.nnz = mat.nonZeros();
  /external/eigen/Eigen/src/Core/
DenseBase.h 185 inline Index nonZeros() const { return size(); }
  /external/eigen/Eigen/src/OrderingMethods/
Amd.h 104 Index cnz = C.nonZeros();
  /external/eigen/Eigen/src/SparseLU/
SparseLU.h 348 Index m_nnzL, m_nnzU; // Nonzeros in L and U factors
492 Index nnz = m_mat.nonZeros();
640 // Count the number of nonzeros in factors
  /external/eigen/unsupported/Eigen/src/Skyline/
SkylineMatrix.h 383 inline Index nonZeros() const {

Completed in 194 milliseconds

12