Lines Matching refs:vals
127 inline void updateList(const IdxType& colPtr, IdxType& rowIdx, SclType& vals, const Index& col, const Index& jk, IndexType& firstElt, VectorList& listCol);
148 Map<ScalarType> vals(m_L.valuePtr(), nnz); //values
151 IndexType firstElt(n-1); // for each j, points to the next entry in vals that will be used in the factorization
165 Scalar mindiag = vals[0];
168 vals[k] /= (m_scal(j) * m_scal(rowIdx[k]));
169 mindiag = (min)(vals[colPtr[j]], mindiag);
175 vals[colPtr[j]] += m_shift;
181 Scalar diag = vals[colPtr[j]]; // It is assumed that only the lower part is stored
186 curCol(rowIdx[i]) = vals[i];
197 curCol(rowIdx[i]) -= vals[i] * vals[jk] ;
199 updateList(colPtr,rowIdx,vals, *k, jk, firstElt, listCol);
210 vals[colPtr[j]] = rdiag;
216 vals[colPtr[i]] -= curCol(i) * curCol(i);
226 vals[i] = curCol(cpt);
232 updateList(colPtr,rowIdx,vals,j,jk,firstElt,listCol);
241 inline void IncompleteCholesky<Scalar,_UpLo, OrderingType>::updateList(const IdxType& colPtr, IdxType& rowIdx, SclType& vals, const Index& col, const Index& jk, IndexType& firstElt, VectorList& listCol)
253 std::swap(vals(jk),vals(minpos));