Home
last modified time | relevance | path

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

/external/eigen/Eigen/src/IterativeLinearSolvers/
DIncompleteCholesky.h187 …inline void updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const…
220 Map<VectorIx> colPtr( m_L.outerIndexPtr(), n+1); // Pointer to the beginning of each row in factorize()
234 for (Index k = colPtr[j]; k < colPtr[j+1]; k++) in factorize()
255 for (Index k = colPtr[j]; k < colPtr[j+1]; k++) in factorize()
257 …eigen_internal_assert(rowIdx[colPtr[j]]==j && "IncompleteCholesky: only the lower triangular part … in factorize()
258 mindiag = numext::mini(numext::real(vals[colPtr[j]]), mindiag); in factorize()
275 vals[colPtr[j]] += shift; in factorize()
283 Scalar diag = vals[colPtr[j]]; // It is assumed that only the lower part is stored in factorize()
285 for (Index i = colPtr[j] + 1; i < colPtr[j+1]; i++) in factorize()
303 for (Index i = jk; i < colPtr[*k+1]; i++) in factorize()
[all …]
/external/eigen/Eigen/src/Core/
DVisitor.h244 DenseBase<Derived>::maxCoeff(IndexType* rowPtr, IndexType* colPtr) const
249 if (colPtr) *colPtr = maxVisitor.col;