Lines Matching refs:row
647 { /* row */
758 { /* row */
767 { /* row */
783 { /* row */
809 { /* row */
1421 int row, swapi, i, i_best = 0, j, j_best = 0, t;
1439 for( row = 0; row < M; row++ )
1444 for( j = row; j < M; j++ )
1446 for( i = row; i < N; i++ )
1461 if( j_best - row )
1467 swapd = A[row * N + t];
1468 A[row * N + t] = A[j_best * N + t];
1472 swapd = B[row];
1473 B[row] = B[j_best];
1477 if( i_best - row )
1484 A[t * N + i_best] = A[t * N + row];
1485 A[t * N + row] = swapd;
1488 swapi = variables[row];
1489 variables[row] = variables[i_best];
1493 for( i = row + 1; i < M; i++ )
1496 ratio = -A[i * N + row] / A[row * N + row];
1497 B[i] += B[row] * ratio;
1499 for( j = N - 1; j >= row; j-- )
1502 A[i * N + j] += A[row * N + j] * ratio;
1507 if( row < M )
1510 for( j = row; j < M; j++ )
1520 M = row; /* decreasing size of the task */
