Show simple item record

On the Solution of Block Hessenberg Systems

dc.contributor.authorStewart, G. W.en_US
dc.date.accessioned2004-05-31T22:22:36Z
dc.date.available2004-05-31T22:22:36Z
dc.date.created1992-10en_US
dc.date.issued1998-10-15en_US
dc.identifier.urihttp://hdl.handle.net/1903/574
dc.description.abstractThis paper describes a divide-and-conquer strategy for solving block Hessenberg systems. For dense matrices the method is a little more efficient than Gaussian elimination; however, because it works almost entirely with the original blocks, it is be much more efficient for sparse matrices or matrices whose blocks can be generated on the fly. For Toeplitz matrices, the algorithm can be combined with the fast Fourier transform to give a new superfast algorithm. (Also cross-referenced as UMIACS-TR-92-109)en_US
dc.format.extent162108 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-2973en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-92-109en_US
dc.titleOn the Solution of Block Hessenberg Systemsen_US
dc.typeTechnical Reporten_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


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record