Lines Matching refs:jk
187 inline void updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol);
298 Index jk = firstElt(*k); // First element to use in the column
299 eigen_internal_assert(rowIdx[jk]==j);
300 Scalar v_j_jk = numext::conj(vals[jk]);
302 jk += 1;
303 for (Index i = jk; i < colPtr[*k+1]; i++)
316 updateList(colPtr,rowIdx,vals, *k, jk, firstElt, listCol);
366 Index jk = colPtr(j)+1;
367 updateList(colPtr,rowIdx,vals,j,jk,firstElt,listCol);
379 inline void IncompleteCholesky<Scalar,_UpLo, OrderingType>::updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol)
381 if (jk < colPtr(col+1) )
383 Index p = colPtr(col+1) - jk;
385 rowIdx.segment(jk,p).minCoeff(&minpos);
386 minpos += jk;
387 if (rowIdx(minpos) != rowIdx(jk))
390 std::swap(rowIdx(jk),rowIdx(minpos));
391 std::swap(vals(jk),vals(minpos));
393 firstElt(col) = internal::convert_index<StorageIndex,Index>(jk);
394 listCol[rowIdx(jk)].push_back(internal::convert_index<StorageIndex,Index>(col));
