Scribd
Upload
81 views1 page

Gram-Schmidt Orthogonalization Guide

The document contains numerical values and instructions for performing Gram-Schmidt orthogonalization to transform three linearly independent but non-orthogonal vectors v1, v2, v3 into a set of mutually orthogonal vectors u1, u2, u3 that span the same space. The process constructs u1 as v1 and successively constructs each uk by setting it equal to vk minus its projections onto the previously constructed uj vectors for j < k.

Uploaded by

prithvijitm
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
81 views1 page

Gram-Schmidt Orthogonalization Guide

The document contains numerical values and instructions for performing Gram-Schmidt orthogonalization to transform three linearly independent but non-orthogonal vectors v1, v2, v3 into a set of mutually orthogonal vectors u1, u2, u3 that span the same space. The process constructs u1 as v1 and successively constructs each uk by setting it equal to vk minus its projections onto the previously constructed uj vectors for j < k.

Uploaded by

prithvijitm
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

0.

1
1. 24.3;24.4;23.8 2. 27.2;27.5; 3. 34.7 4. 37.4

HW3 (due on Sept.25th)

A useful algorithm for orthogonalization Gram-Schmidt orthogonalization. Suppose you found v1 ; v2 and v3 ; three linearly independent vectors but they are not orthogonal. How to get three mutually orthogonal vectors that span the same space as your original three vectors? Construct orthogonal u1 ; u2 and u3 (that span the same space as v1 ; v2 ; v3 as follows: u1 u2 u3 = v1 ; = v2 = v3 u1 u1 u1 u1 u1 u1 v2 u1 v3 u1 u2 v3 u2 u2

u2

In general for n -vectors we have u1 uk = v1 ; = vk X uj uj vk ; 8k = 2::n uj

uj

j =1::k 1

You might also like