Show simple item record

The Gram-Schmidt Algorithm and Its Variations

dc.contributor.authorStewart, G. W.
dc.date.accessioned2006-01-13T21:08:09Z
dc.date.available2006-01-13T21:08:09Z
dc.date.issued2006-01-13T21:08:09Z
dc.identifier.urihttp://hdl.handle.net/1903/3036
dc.description.abstractThe Gram--Schmidt algorithm is a widely used method for orthogonalizing a sequence of vectors. It comes in two forms: classical Gram--Schmidt and modified Gram--Schmidt, each of whose operations can be ordered in different ways. This expository paper gives a systematic treatment of this confusing variety of algorithms. It also treats the numerical issue of loss of orthogonality and reorthogonalization as well as the implementation of column pivoting.en
dc.format.extent221888 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen
dc.relation.ispartofseriesUM Computer Science Departmenten
dc.relation.ispartofseriesCS-TR-4642en
dc.relation.ispartofseriesUMIACSen
dc.relation.ispartofseriesUMIACS-TR-2004-84en
dc.titleThe Gram-Schmidt Algorithm and Its Variationsen
dc.typeTechnical Reporten


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record