Solving the Formula Without Matrix Inverses: A,B,C & b

  • Thread starter Thread starter Euphz
  • Start date Start date
  • Tags Tags
    Formula Matrix
Euphz
Messages
1
Reaction score
0
If A,B and C are nxn matrice, with B and C nonsingular, and b is an n-vector, how would you implement the formula



x = B-1(2A+I)(C-1+A)b, without computing any matrix inverse?



I made it Bx=(2A+1)C-1(I+CA)b, but don't know how to pull out the C-1 from the middle in order to take the equation without matrices inverse,sigh.. but I don't know if I approached it right because I don't even get the question.

Please help me!
Thank you very much :frown:
 
Last edited by a moderator:
Physics news on Phys.org


The furthest I could come was by working out the parentheses:

CBx = (2CAC-1+2CA2+I+A)b

I hope someone else can get some answer...
 


Euphz said:
If A,B and C are nxn matrice, with B and C nonsingular, and b is an n-vector, how would you implement the formula



x = B-1(2A+I)(C-1+A)b, without computing any matrix inverse?



I made it Bx=(2A+1)C-1(I+CA)b, but don't know how to pull out the C-1 from the middle in order to take the equation without matrices inverse,sigh.. but I don't know if I approached it right because I don't even get the question.

Please help me!
Thank you very much :frown:
What do you mean "implement the formula"? Is the goal to evaluate the right hand side of the original equation to get x?
 
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