complex gauss-jordan elimination algorithm
|dw:1349997304976:dw|
when I tried to adjust it by normal GJ algorithm i got stuck at 1 1 -1 | 0 0 0 0 | 0 0 0 0 | 0
The answer is x(1)= -s + t x(2) = s x(3) = t
hmm i'm getting that too, but idk what you mean by *complex* GJ elimination
I don't know where the t and s came from in the book's solution
oh i see 1 1 -1 0 means x(1) + x(2) - x(3) = 0 So if x(3) and x(2) are your free variables, then x(2) = s x(3) = t
Plug them into x(1) + x(2) - x(3) = 0 and solve for x(1) x(1) + x(2) - x(3) = 0 x(1) + s - t = 0 x(1) = -s + t
I don't understand what you mean by this So if x(3) and x(2) are your free variables, then x(2) = s x(3) = t
free variables are just variables so if x(2) is a free variable, then x(2) = s This basically says "x(2) is some unknown number 's'"
and it's allowed to be "free" to be whatever it wants
That makes sense. i feel like this solution is cheating. :/ But I guess I can't get an exact value so this is the only way to write it. Thanks for your help once more
well that's as close as we get to writing all of the possible solutions (there are infinitely many of them)
Thats true. I didn't include it in the post but it does say to find all solutions
Join our real-time social learning platform and learn together with your friends!