OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:nonZeros
(Results
26 - 42
of
42
) sorted by null
1
2
/external/eigen/Eigen/src/SparseCore/
SparseRef.h
101
::new (static_cast<Base*>(this)) Base(expr.size(), expr.
nonZeros
(), expr.innerIndexPtr(), expr.valuePtr());
103
::new (static_cast<Base*>(this)) Base(expr.rows(), expr.cols(), expr.
nonZeros
(), expr.outerIndexPtr(), expr.innerIndexPtr(), expr.valuePtr(), expr.innerNonZeroPtr());
SparseMatrix.h
24
* space inbetween the
nonzeros
of two successive colmuns (resp. rows) such that insertion of new non-zero
104
using Base::
nonZeros
;
506
/** Suppresses all
nonzeros
which are \b much \b smaller \b than \a reference under the tolerence \a epsilon */
512
/** Turns the matrix into compressed format, and suppresses all
nonzeros
which do not satisfy the predicate \a keep.
794
for (Index i=0; i<m.
nonZeros
(); ++i)
[
all
...]
SparseMap.h
86
/** \copydoc SparseCompressedBase::
nonZeros
*/
87
inline Index
nonZeros
() const { return m_zero_nnz[1]; }
TriangularSolver.h
223
res.reserve(other.
nonZeros
());
228
tempVector.init(.99/*float(other.col(col).
nonZeros
())/float(other.rows())*/);
283
// std::cout << "tempVector.
nonZeros
() == " << int(count) << " / " << (other.rows()) << "\n";
/external/eigen/Eigen/src/SparseQR/
SparseQR.h
334
m_R.reserve(2*mat.
nonZeros
()); //FIXME Get a more accurate estimation through symbolic factorization with the etree
335
m_Q.reserve(2*mat.
nonZeros
());
435
// Get the
nonzeros
indexes of the current column of R
/external/eigen/unsupported/Eigen/src/SparseExtra/
MarketIO.h
237
out << mat.rows() << " " << mat.cols() << " " << mat.
nonZeros
() << "\n";
BlockSparseMatrix.h
431
// Compute the total number of
nonzeros
(including explicit zeros in blocks)
501
reserve(blockPattern.
nonZeros
());
578
// Compute the total number of
nonzeros
592
* \param nonzerosblocks Number of nonzero blocks. The total number of
nonzeros
is
[
all
...]
/external/eigen/Eigen/src/CholmodSupport/
CholmodSupport.h
61
res.nzmax = mat.
nonZeros
();
/external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteCholesky.h
217
Index nnz = m_L.
nonZeros
();
IncompleteLUT.h
279
Index fill_in = (amat.
nonZeros
()*m_fillfactor)/n + 1;
/external/eigen/bench/spbench/
spbenchsolver.h
505
statbuf << " <ENTRIES> " << it.matrix().
nonZeros
() << "</ENTRIES>\n";
/external/eigen/Eigen/src/SuperLUSupport/
SuperLUSupport.h
212
res.storage.nnz = internal::convert_index<int>(mat.
nonZeros
());
271
res.storage.nnz = mat.
nonZeros
();
[
all
...]
/external/eigen/Eigen/src/Core/
DenseBase.h
210
inline Index
nonZeros
() const { return size(); }
/external/eigen/Eigen/src/OrderingMethods/
Amd.h
106
StorageIndex cnz = StorageIndex(C.
nonZeros
());
/external/eigen/Eigen/src/SparseLU/
SparseLU.h
389
Index m_nnzL, m_nnzU; //
Nonzeros
in L and U factors
537
Index nnz = m_mat.
nonZeros
();
689
// Count the number of
nonzeros
in factors
/external/eigen/test/
sparse_solver.h
86
MappedSparseMatrix<Scalar,Mat::Options,StorageIndex> Am(A.rows(), A.cols(), A.
nonZeros
(), const_cast<StorageIndex*>(A.outerIndexPtr()), const_cast<StorageIndex*>(A.innerIndexPtr()), const_cast<Scalar*>(A.valuePtr()));
/external/eigen/unsupported/Eigen/src/Skyline/
SkylineMatrix.h
383
inline Index
nonZeros
() const {
Completed in 487 milliseconds
1
2