Lines Matching defs:pivot
248 // find pivot
249 int pivot = i;
255 pivot = j;
265 if (pivot != i) {
266 swap(indices[i], indices[pivot]);
267 swap(b[i], b[pivot]);
269 pivot = indices[i];
274 double q = -a[index][i] / a[pivot][i];
277 a[index][k] += a[pivot][k] * q;
313 // find next pivot
314 int pivot = i;
321 pivot = j;
335 if (pivot != i)
336 swap(indices[i], indices[pivot]);
337 pivot = indices[i];
339 independent[pivot] = true;
344 double q = -a[index][column] / a[pivot][column];
347 a[index][k] += a[pivot][k] * q;