The Gram-Schmidt Algorithm and Its Variations

Simple item page
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.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.identifier.urihttp://hdl.handle.net/1903/3036
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

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
g.ps
Size:
216.69 KB
Format:
Postscript Files
Download
Thumbnail Image
Name:
g.pdf
Size:
219.78 KB
Format:
Adobe Portable Document Format
Description:
Auto-generated copy of g.ps
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.81 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Technical Reports from UMIACS
Technical Reports of the Computer Science Department