Home | History | Annotate | Download | only in IterativeLinearSolvers

Lines Matching refs:Index

90     Index rows() const { return m_L.rows(); }
93 Index cols() const { return m_L.cols(); }
187 inline void updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol);
216 Index n = m_L.cols();
217 Index nnz = m_L.nonZeros();
233 for (Index j = 0; j < n; j++)
234 for (Index k = colPtr[j]; k < colPtr[j+1]; k++)
243 for (Index j = 0; j < n; ++j)
253 for (Index j = 0; j < n; j++)
255 for (Index k = colPtr[j]; k < colPtr[j+1]; k++)
274 for (Index j = 0; j < n; j++)
278 Index j=0;
285 for (Index i = colPtr[j] + 1; i < colPtr[j+1]; i++)
298 Index jk = firstElt(*k); // First element to use in the column
303 for (Index i = jk; i < colPtr[*k+1]; i++)
333 for(Index i=0; i<n; ++i)
341 for (Index k = 0; k<col_nnz; ++k)
343 Index i = col_irow[k];
351 Index p = colPtr[j+1] - colPtr[j] - 1 ;
356 Index cpt = 0;
357 for (Index i = colPtr[j]+1; i < colPtr[j+1]; i++)
365 // Get the first smallest row index and put it after the diagonal element
366 Index jk = colPtr(j)+1;
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)
383 Index p = colPtr(col+1) - jk;
384 Index minpos;
393 firstElt(col) = internal::convert_index<StorageIndex,Index>(jk);
394 listCol[rowIdx(jk)].push_back(internal::convert_index<StorageIndex,Index>(col));