Show simple item record

Determining Rank in the Presence of Error

dc.contributor.authorStewart, G. W.en_US
dc.date.accessioned2004-05-31T22:22:33Z
dc.date.available2004-05-31T22:22:33Z
dc.date.created1992-10en_US
dc.date.issued1998-10-15en_US
dc.identifier.urihttp://hdl.handle.net/1903/573
dc.description.abstractThe problem of determining rank in the presence of error occurs in a number of applications. The usual approach is to compute a rank-revealing decomposition and make a decision about the rank by examining the small elements of the decomposition. In this paper we look at three commonly use decompositions: the singular value decomposition, the pivoted QR decomposition, and the URV decomposition. (Also cross-referenced as UMIACS-TR-92-108)en_US
dc.format.extent174629 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-2972en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-92-108en_US
dc.titleDetermining Rank in the Presence of Erroren_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