Home | History | Annotate | Download | only in IterativeLinearSolvers

Lines Matching refs:ju

251   VectorXi ju(n);   // column position of the values in u -- maximum size  is n
261 ju.fill(0);
280 ju(ii) = ii;
292 ju(sizel) = k;
305 ju(jpos) = k;
328 // we must select first the smallest column index among ju(jj:sizel)
330 int minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment
332 if (minrow != ju(jj))
335 int j = ju(jj);
336 swap(ju(jj), ju(k));
378 ju(newpos) = j;
387 ju(len) = minrow;
394 for(int k = 0; k <sizeu; k++) jr(ju(ii+k)) = -1;
402 typename VectorXi::SegmentReturnType jul(ju.segment(0, sizel));
408 m_lu.insertBackByOuterInnerUnordered(ii,ju(k)) = u(k);
425 ju(ii + len) = ju(ii + k);
431 typename VectorXi::SegmentReturnType juu(ju.segment(ii+1, sizeu-1));
436 m_lu.insertBackByOuterInnerUnordered(ii,ju(k)) = u(k);