Linear Transformation / Coordinate Vector Question

Gotejjeken
Messages
27
Reaction score
0

Homework Statement


The following vectors form an ordered basis E = [v1, v2] of the subspace V = span(v1,v2):

v1 = (1,2,1)^T , v2 = (3,2,1)^T.

The vector v = (24,-8,-4)^T belongs to the subspace V. Find its coordinates (c1,c2)^T = [v]E relative to the ordered basis E = [v1,v2].

Homework Equations



None.

The Attempt at a Solution



I am not quite sure how to approach this problem. I wanted to calculate the inverse of:

1 3
2 2
1 1

and then multiply v = (24, -8, -4)^T by the inverse to get the coordinate vector relative to E, however I have no idea if that is the right approach. I feel I'm missing something...
 
Physics news on Phys.org
Gotejjeken said:

Homework Statement


The following vectors form an ordered basis E = [v1, v2] of the subspace V = span(v1,v2):

v1 = (1,2,1)^T , v2 = (3,2,1)^T.

The vector v = (24,-8,-4)^T belongs to the subspace V. Find its coordinates (c1,c2)^T = [v]E relative to the ordered basis E = [v1,v2].

Homework Equations



None.

The Attempt at a Solution



I am not quite sure how to approach this problem. I wanted to calculate the inverse of:

1 3
2 2
1 1
The only matrices that have inverses are square matrices. The one you show above is 3 x 2, so isn't square.
Gotejjeken said:
and then multiply v = (24, -8, -4)^T by the inverse to get the coordinate vector relative to E, however I have no idea if that is the right approach. I feel I'm missing something...

Solve the equation below for the constants c1 and c2.
(24, -8, -4)^T = c1*(1,2,1)^T + c2*(3,2,1)^T
 
Oh, wow. Thank you, it seems I was over-complicating things...the wording of that problem had my brain in knots.
 
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...
Back
Top