Lines Matching refs:row
20 * by the average magnitude of all the original elements in the current row.
21 * 2) After the elimination of the row, only the @p fill largest elements in
130 int QuickSplit(VectorV &row, VectorI &ind, int ncut);
135 inline bool operator() (const Index& row, const Index& col, const Scalar&) const
137 return row!=col;
166 * \param fillfactor This is used to compute the number @p fill_in of largest elements to keep on each row.
177 * On output, the vector row is permuted such that its elements satisfy
178 * abs(row(i)) >= abs(row(ncut)) if i<ncut
179 * abs(row(i)) <= abs(row(ncut)) if i>ncut
180 * \param row The vector of values
181 * \param ind The array of index for the elements in @p row
186 int IncompleteLUT<Scalar>::QuickSplit(VectorV &row, VectorI &ind, int ncut)
190 int n = row.size(); /* length of the vector */
200 RealScalar abskey = std::abs(row(mid));
202 if ( std::abs(row(j)) > abskey) {
204 swap(row(mid), row(j));
209 swap(row(mid), row(first));
250 Vector u(n) ; // real values of the row -- maximum size is n --
264 // number of largest elements to keep in each row:
268 // number of largest nonzero elements to keep in the L and the U part of the current row:
276 // 1 - copy the lower and the upper part of the row i of mat in the working vector u
278 int sizeu = 1; // number of nonzero elements in the upper part of the current row
279 int sizel = 0; // number of nonzero elements in the lower part of the current row
285 typename FactorType::InnerIterator j_it(mat, ii); // Iterate through the current row ii
313 // 2 - detect possible zero row
319 // Take the 2-norm of the current row as a relative tolerance
356 // linear combination of the current row ii and the row minrow
391 } // end of the elimination on the row ii
398 // sort the L-part of the row
416 // sort the U-part of the row
