Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland 20742 ; Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland 20742
Abstract:
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.