Given an iterate $x$, computes and sorts the equations of the system by the distance between the iterate and the hyperplane. The longest distance to the hyperplane is then used first in the cycle, while the smallest distance is last in the cycle. Once the cycle is exhausted, a new ordering is determined from the most recent cycle.