@article {17736,
	title = {The Gram-Schmidt Algorithm and Its Variations},
	volume = {UMIACS-TR-2004-84},
	year = {2006},
	month = {2006/01/13/},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {The Gram--Schmidt algorithm is a widely used method fororthogonalizing 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.
},
	keywords = {Technical Report},
	url = {http://drum.lib.umd.edu/handle/1903/3036},
	author = {Stewart, G.W.}
}
