Rounding errors in solving block Hessenberg systems
U. von Matt, G. W. Stewart · Mathematics of Computation · 1996
A rounding error analysis is presented for a divide-and-conquer algorithm 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 matrices and for M-matrices.