(New page: == The Gram-Schmidt Algorithm == ---- In the simplest review, the Gram-Schmidt Algorithm is shown in the following pattern for vectors '''u''' and '''v'''. : <math> \begin{align} \mathbf...) |
|||
Line 16: | Line 16: | ||
where | where | ||
:<math>\mathrm{proj}_{\mathbf{u}}\,(\mathbf{v}) = {\langle \mathbf{v}, \mathbf{u}\rangle\over\langle \mathbf{u}, \mathbf{u}\rangle}\mathbf{u} </math>. | :<math>\mathrm{proj}_{\mathbf{u}}\,(\mathbf{v}) = {\langle \mathbf{v}, \mathbf{u}\rangle\over\langle \mathbf{u}, \mathbf{u}\rangle}\mathbf{u} </math>. | ||
+ | |||
+ | |||
+ | Ryan Jason Tedjasukmana | ||
+ | ---- | ||
+ | [[Inner_Products_MA265F10Walther|Back to Inner Product Spaces and Orthogonal Complements]] | ||
+ | |||
+ | [[2010_Fall_MA_265_Walther|Back to MA265 Fall 2010 Prof Walther]] | ||
+ | |||
+ | [[MA265|Back to MA265]] | ||
+ | |||
+ | |||
+ | [[Category:MA265Fall2010Walther]] | ||
+ | [[Category:MA265]] |
Revision as of 15:29, 6 December 2010
The Gram-Schmidt Algorithm
In the simplest review, the Gram-Schmidt Algorithm is shown in the following pattern for vectors u and v.
- $ \begin{align} \mathbf{u}_1 & = \mathbf{v}_1, \\ \mathbf{u}_2 & = \mathbf{v}_2-\mathrm{proj}_{\mathbf{u}_1}\,(\mathbf{v}_2), \\ \mathbf{u}_3 & = \mathbf{v}_3-\mathrm{proj}_{\mathbf{u}_1}\,(\mathbf{v}_3)-\mathrm{proj}_{\mathbf{u}_2}\,(\mathbf{v}_3), \\ & {}\ \ \vdots \\ \mathbf{u}_k & = \mathbf{v}_k-\sum_{j=1}^{k-1}\mathrm{proj}_{\mathbf{u}_j}\,(\mathbf{v}_k), \end{align} $
where
- $ \mathrm{proj}_{\mathbf{u}}\,(\mathbf{v}) = {\langle \mathbf{v}, \mathbf{u}\rangle\over\langle \mathbf{u}, \mathbf{u}\rangle}\mathbf{u} $.
Ryan Jason Tedjasukmana
Back to Inner Product Spaces and Orthogonal Complements