Using Least Squares to find Orthogonal Projection

Click For Summary
The discussion revolves around using least squares to find the orthogonal projection of a vector u onto a subspace spanned by vectors v1, v2, and v3 in R4. The user successfully set up the matrix and computed the least squares solution, obtaining components x1, x2, and x3. However, confusion arises because the solution requires four components, while the user only calculated three. The clarification provided indicates that the projection vector P is a linear combination of the three vectors, which results in a three-dimensional representation within the four-dimensional space. Understanding this distinction resolves the user's confusion regarding the number of components needed for the solution.
ver_mathstats
Messages
258
Reaction score
21
Homework Statement
Use least squares to find the orthogonal projection of u onto the subspace of R4 spanned by the vectors v1, v2, and v3.
Relevant Equations
u = (0,5,4,0) v1 = (6,0,0,1) v2 = (0,1,-1,0) v3 = (1,1,0,-6)
I'm a little confused how to do this homework problem, I can't seem to obtain the correct answer. I took my vectors v1, v2, and v3 and set up a matrix. So I made my matrix:

V = [ (6,0,0,1)T, (0,1,-1,0)T, (1,1,0,-6)T ] and then I had
u = [ (0,5,4,0) T ].

I then went to solve using least squares. So I ended up doing VTV = VTu.

I took that, obtained my augmented matrix:

[ (37,0,0)T, (0,2,1)T, (0,1,38)T, (0,1,5)T ].

I solved it and everything worked fine, I got the answers: x1 = 0, x2 = 11/25, x3 = 3/25.

I noticed to that I could use QR factorization of V then solve QTu and the least squares solution would be x' satisfies Rx = QTu, we can then obtain our answer, but again this solution only has three components, why is the solution asking for four?

However, the solution requires four components. I am unsure of where I am going wrong with this problem, any help would be appreciated.
 
Physics news on Phys.org
ver_mathstats said:
Homework Statement:: Use least squares to find the orthogonal projection of u onto the subspace of R4 spanned by the vectors v1, v2, and v3.
Relevant Equations:: u = (0,5,4,0) v1 = (6,0,0,1) v2 = (0,1,-1,0) v3 = (1,1,0,-6)

I'm a little confused how to do this homework problem, I can't seem to obtain the correct answer. I took my vectors v1, v2, and v3 and set up a matrix. So I made my matrix:

V = [ (6,0,0,1)T, (0,1,-1,0)T, (1,1,0,-6)T ] and then I had
u = [ (0,5,4,0) T ].

I then went to solve using least squares. So I ended up doing VTV = VTu.

I took that, obtained my augmented matrix:

[ (37,0,0)T, (0,2,1)T, (0,1,38)T, (0,1,5)T ].

I solved it and everything worked fine, I got the answers: x1 = 0, x2 = 11/25, x3 = 3/25.

I noticed to that I could use QR factorization of V then solve QTu and the least squares solution would be x' satisfies Rx = QTu, we can then obtain our answer, but again this solution only has three components, why is the solution asking for four?

However, the solution requires four components. I am unsure of where I am going wrong with this problem, any help would be appreciated.
You have to find the orthogonal projection of u onto the subspace of R4 spanned by the vectors v1, v2, and v3. x1, x2, x3 you got are the componets of this projection vector P with respect to the basis v1, v2, v3, that is
P= x1 v1 +x2 v2+x3 v3 , a linear combination of three four-dimensional vectors .
 
  • Like
Likes andrewkirk
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
7K
Replies
4
Views
5K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
4
Views
2K