3 Attachment(s)

LinearAlgebra- Gram-Schmidt Algorithm and linear combinations

Hey guys, I have a problem relating to the Gram-Schmidt algorithm and expressing a vector as a linear combination of other vectors.

Attachment 30937

Here is my attempt at doing the question.

Attachment 30938A

Attachment 30939B

So I would like to know if I have done this correctly, and if not, how do I go about solving this question?

Help would be much appreciated.

Re: LinearAlgebra- Gram-Schmidt Algorithm and linear combinations

At the end, you have (1, 0, 1), (0, 2, 0), and (-1, 0, 1) as orthogonal vectors and then divide the vectors by , 2, and to get unit vectors. That is correct even with this non-standard inner product. The last part asks you to write (2, 1, -1) as a linear combination of these basis vectors. That means you want to find numbers, a, b, and c, such that .

You could do this by solving the three equations , ,

But because this is an "orthonormal basis" there is a simpler way: take the dot product of [tex](\frac{1}{\sqrt{2}}, 0, \frac{1}{\sqrt{2}}) with both sides of the equation. That will give

Take the dot product of (0, 1, 0) with both sides of the equation. That will give

Finally, take the dot product of with both side of the equation to get .