It is shown that Rump's method for enclosing solutions of linear equat
ions can be reformulated in an interval-free form and that the underly
ing inclusion result can be proved by elementary means without using B
rouwer's fixed-point theorem. A sufficient condition on Rump's ''infla
tion parameter'' epsilon is given under which finite termination occur
s. Also, a more general modified algorithm is studied for which the nu
mber of iterations can be expressed by an explicit formula.