Lines Matching refs:colPtr
127 …inline void updateList(const IdxType& colPtr, IdxType& rowIdx, SclType& vals, const Index& col, co…
150 Map<IndexType> colPtr( m_L.outerIndexPtr(), n+1); // Pointer to the beginning of each row in factorize()
167 for (int k = colPtr[j]; k < colPtr[j+1]; k++) in factorize()
169 mindiag = (min)(vals[colPtr[j]], mindiag); in factorize()
175 vals[colPtr[j]] += m_shift; in factorize()
181 Scalar diag = vals[colPtr[j]]; // It is assumed that only the lower part is stored in factorize()
184 for (int i = colPtr[j] + 1; i < colPtr[j+1]; i++) in factorize()
195 for (int i = jk; i < colPtr[*k+1]; i++) in factorize()
199 updateList(colPtr,rowIdx,vals, *k, jk, firstElt, listCol); in factorize()
210 vals[colPtr[j]] = rdiag; in factorize()
216 vals[colPtr[i]] -= curCol(i) * curCol(i); in factorize()
220 int p = colPtr[j+1] - colPtr[j] - 1 ; in factorize()
224 for (int i = colPtr[j]+1; i < colPtr[j+1]; i++) in factorize()
231 Index jk = colPtr(j)+1; in factorize()
232 updateList(colPtr,rowIdx,vals,j,jk,firstElt,listCol); in factorize()
241 inline void IncompleteCholesky<Scalar,_UpLo, OrderingType>::updateList(const IdxType& colPtr, IdxTy… in updateList() argument
243 if (jk < colPtr(col+1) ) in updateList()
245 Index p = colPtr(col+1) - jk; in updateList()