Function pivotScore

kernel/linear_algebra/linearAlgebra.cc:50–59

* The returned score is based on the implementation of 'nSize' for * numbers (, see numbers.h): nSize(n) provides a measure for the * complexity of n. Thus, less complex pivot elements will be * preferred, and get therefore a smaller pivot score. Consequently, * we simply return the value of nSize. * An exception to this rule are the ground fields R, long R, and * long C: In these, the resul

 * the negative of nSize will be returned.
 **/
int pivotScore(number n, const ring r)
{
  int s = n_Size(n, r->cf);
  if (rField_is_long_C(r) ||
      rField_is_long_R(r) ||
      rField_is_R(r))
    return -s;
  else
    return s;
}

/**
 * This code computes a score for each non-zero matrix entry in