Rounding Errors in Solving Block Hessenberg Systems

Loading...
Thumbnail Image

Files

CS-TR-3345.ps (276.78 KB)
No. of downloads: 233
CS-TR-3345.pdf (263.61 KB)
No. of downloads: 774

Publication or External Link

Date

1998-10-15

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)

Notes

Rights