Home
last modified time | relevance | path

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

/external/eigen/Eigen/src/IterativeLinearSolvers/
DIncompleteLUT.h281 Index sizeu = 1; // number of nonzero elements in the upper part of the current row in factorize() local
307 Index jpos = ii + sizeu; in factorize()
311 ++sizeu; in factorize()
371 newpos = ii + sizeu; in factorize()
372 sizeu++; in factorize()
373 eigen_internal_assert(sizeu<=n); in factorize()
397 for(Index k = 0; k <sizeu; k++) jr(ju(ii+k)) = -1; in factorize()
422 for(Index k = 1; k < sizeu; k++) in factorize()
431 sizeu = len + 1; // +1 to take into account the diagonal element in factorize()
432 len = (std::min)(sizeu, nnzU); in factorize()
[all …]