Rounding Errors in Solving Block Hessenberg Systems
Loading...
Files
Publication or External Link
External Link to Data Files
Date
Authors
Advisor
Citation
DRUM DOI
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 backward stable solution. The algorithm is shown to be stable for diagonally dominant matrices and for M-matrices. (Also cross-referenced as UMIACS-TR-94-105)