private IntIntPair totalPivotSearch(int k){
  double max=0;
  int i, j, pivotRow=k, pivotCol=k;
  double absValue;
  for (i=k; i < coeff.length; i++) {
    for (j=k; j < coeff[0].length; j++) {
      absValue=Math.abs(coeff[row[i]][col[j]]);
      if (max < absValue) {
        max=absValue;
        pivotRow=i;
        pivotCol=j;
      }
    }
  }
  return new IntIntPair(pivotRow,pivotCol);
}

private IntIntPair totalPivotSearch ( int k ) { double max = 0 ; int i , j , pivotRow = k , pivotCol = k ; double absValue ; for ( i = k ; i < coeff . length ; i ++ ) { for ( j = k ; j < coeff [ 0 ] . length ; j ++ ) { absValue = Math . abs ( coeff [ row [ i ] ] [ col [ j ] ] ) ; if ( max < absValue ) { max = absValue ; pivotRow = i ; pivotCol = j ; } } } return new IntIntPair ( pivotRow , pivotCol ) ; }
method for total pivot search , searches for x , y in { k , . . . n } , so that | a_xy | > | a_ij |
