private boolean isSolvable(int method) throws NullPointerException {
  if (solved) {
    return solvable;
  }
  if (!reducedRowEchelonForm) {
    reducedRowEchelonForm(method);
  }
  for (int i=rank; i < rhs.length; i++) {
    if (Math.abs(rhs[row[i]]) > DELTA) {
      solvable=false;
      return false;
    }
  }
  solvable=true;
  return true;
}

private boolean isSolvable ( int method ) throws NullPointerException { if ( solved ) { return solvable ; } if ( ! reducedRowEchelonForm ) { reducedRowEchelonForm ( method ) ; } for ( int i = rank ; i < rhs . length ; i ++ ) { if ( Math . abs ( rhs [ row [ i ] ] ) > DELTA ) { solvable = false ; return false ; } } solvable = true ; return true ; }
checks solvability of this linear equation system with the chosen method .
