Show simple item record

The Triangular Matrices of Gaussian Elimination and Related Decompositions

dc.contributor.authorStewart, G. W.en_US
dc.date.accessioned2004-05-31T22:34:44Z
dc.date.available2004-05-31T22:34:44Z
dc.date.created1995-10en_US
dc.date.issued1998-10-15en_US
dc.identifier.urihttp://hdl.handle.net/1903/759
dc.description.abstractIt has become a commonplace that triangular systems are solved to higher accuracy than their condition would warrant. This observation is not true in general, and counterexamples are easy to construct. However, it is often true of the triangular matrices from pivoted LU or QR decompositions. It is shown that this fact is closely connected with the rank-revealing character of these decompositions. (Also cross-referenced as UMIACS-TR-95-91)en_US
dc.format.extent132156 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3533en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-95-91en_US
dc.titleThe Triangular Matrices of Gaussian Elimination and Related Decompositionsen_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