A rounding error analysis is presented for a divide-and-conquer algori
thm to solve linear systems with block Hessenberg matrices. Conditions
are derived under which the algorithm computes a stable solution. The
algorithm is shown to be stable for block diagonally dominant matrice
s and for M-matrices.