|
|
|
|
Gram-Schmidt orthogonalization
|
(Algorithm)
|
|
|
Any set of linearly independent vectors
can be converted into a set of orthogonal vectors
by the Gram-Schmidt process. In three dimensions, determines a line; the vectors and determine a plane. The vector is the unit vector in the direction . The (unit) vector lies in the plane of , and is normal to (on the same side as . The (unit) vector is normal to the plane of , on the same side as , etc.
In general, first set , and then each is made orthogonal to the preceding
by subtraction of the projections of in the directions of
:
The vectors span the same subspace as the . The vectors
are orthonormal. This leads to the following theorem:
Theorem.
Any
matrix with linearly independent columns can be factorized into a product, . The columns of are orthonormal and is upper triangular and invertible.
This “classical” Gram-Schmidt method is often numerically unstable, see [Golub89] for a “modified” Gram-Schmidt method.
References
- Golub89
- Gene H. Golub and Charles F. van Loan: Matrix Computations, 2nd edn., The John Hopkins University Press, 1989.
|
"Gram-Schmidt orthogonalization" is owned by akrowne.
|
|
(view preamble)
Cross-references: unstable, Gram-Schmidt, invertible, upper triangular, product, columns, matrix, orthonormal, subspace, span, projections, subtraction, orthogonal, side, normal, unit, unit vector, plane, line, dimensions, orthogonal vectors, vectors, linearly independent
There are 4 references to this entry.
This is version 5 of Gram-Schmidt orthogonalization, born on 2002-01-04, modified 2007-02-14.
Object id is 1216, canonical name is GramSchmidtOrthogonalization.
Accessed 60128 times total.
Classification:
| AMS MSC: | 65F25 (Numerical analysis :: Numerical linear algebra :: Orthogonalization) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|