The Gram-Schmidt Algorithm and Its Variations

Loading...
Thumbnail Image

Files

g.ps (216.69 KB)
No. of downloads: 479
g.pdf (219.78 KB)
No. of downloads: 513

Publication or External Link

Date

2006-01-13T21:08:09Z

Advisor

Citation

DRUM DOI

Abstract

The 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.

Notes

Rights