Rounding Errors in Solving Block Hessenberg Systems

dc.contributor.authorMatt, Urs vonen_US
dc.contributor.authorStewart, G. W.en_US
dc.date.accessioned2004-05-31T22:27:51Z
dc.date.available2004-05-31T22:27:51Z
dc.date.created1994-09en_US
dc.date.issued1998-10-15en_US
dc.description.abstractA 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)en_US
dc.format.extent283425 bytes
dc.format.mimetypeapplication/postscript
dc.identifier.urihttp://hdl.handle.net/1903/661
dc.language.isoen_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3345en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-94-105en_US
dc.titleRounding Errors in Solving Block Hessenberg Systemsen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
CS-TR-3345.ps
Size:
276.78 KB
Format:
Postscript Files
Loading...
Thumbnail Image
Name:
CS-TR-3345.pdf
Size:
263.61 KB
Format:
Adobe Portable Document Format
Description:
Auto-generated copy of CS-TR-3345.ps