Block methods for the solution of linear interval equations

Feasibility results are generalized for the interval arithmetic versions of Gaussian elimination and of total-step, single-step, and symmetric single-step methods to block methods. It is shown that block Gaussian elimination is always feasible for H-matrices and for a new class of interval matrices. Convergence results for the block iterative methods are given and the quality of the enclosure and the speed of convergence are compared with respect to the fineness of the partition into blocks of the given matrix.