ABS mthods are direct iteration methods for solving linear systems where the i-th iterate satisfies the first i equations, and therefore a system on m equations is solved in at most m ABS steps. In this paper, using a new rank two update of the Abaffian matrix, we introduce a class of ABS-type methods for solving full row rank linear equations, where the i-th iterate solves the first 2i equations. So, termination is achieved in at most ⌊(m + 1)/2⌋ steps. We also show how to decrease the dimension of the Abaffian matrix by choosing appropriate parameters.