Exercise 1.3.6. Given the following system of equations:
for what values of would Gaussian elimination break down, either in a fixable way (i.e., via row exchange) or in a non-fixable way?
Answer: One way for elimination to break down temporarily would be for the coefficient of in the first equation to be 0, thereby forcing a row exchange as the very first step in elimination. This corresponds to the case and the following set of equations:
A second way for elimination to fail would be for one equation to be equal to the other equation times some constant c. This would correspond to the equations representing the same line in the u-v plane, with no unique solution (singular system). We now try to find a value of for which this situation would occur.
Note that we can multiply the right-hand side of the first equation by 2 to get the right hand side of the second equation. Multiplying the left-hand side of the first equation by 2 and setting it equal to the left-hand side of the second equation gives us:
So if then we have the following set of equations:
which after elimination produces the single equation
for which no unique solution exists.
Another approach is to assume that and to perform elimination. In order to eliminate the first term of the second equation we multiply the first equation by and subtract it from the second. This gives us
Elimination can fail at this point if the term involving is zero, which would be the case if . Multiplying this equation by on both sides gives us or with solutions and .
We’ve already considered the case . When the original equations become
which after elimination becomes
This system has no solution.
To sum up, there are three values of for which elimination could temporarily or permanently break down:
- When elimination temporarily breaks down and requires a row exchange.
- When elimination permanently breaks down and the system has an infinite number of solutions.
- When elimination permanently breaks down and the system has no solution.
UPDATE: Tried to clarify the explanation of the second way in which elimination could break down, and included a third way elimination could fail based on comments from coruja38.
NOTE: This continues a series of posts containing worked out exercises from the (out of print) book Linear Algebra and Its Applications, Third Edition by Gilbert Strang.
If you find these posts useful I encourage you to also check out the more current Linear Algebra and Its Applications, Fourth Edition, Dr Strang’s introductory textbook Introduction to Linear Algebra, Fourth Edition and the accompanying free online course, and Dr Strang’s other books.
case 1: we get unique solutions u=1/2 and v=1, then how could u say that elimination breaks down ?
Case 2: Can u explain it with an example..?
case 3 : Agreeing that there is no solution , but how could you say that the elimination process get broke down ???
Plz explain … Including conditions at which the elimination process breaks down
In the first case, elimination breaks down temporarily, because we have to do a row exchange before we can do the next step in elimination.
There are only two cases. The second case is where one equation is a multiple of the other equation. My original answer was confusing because I didn’t connect the paragraph where I referenced that possibility with the following paragraph where I tried to find a value of a for which this was the case. I’ve added a new sentence to provide a better transition between the two paragraphs.
I forgot to add: In the second case I say that the elimination process breaks down because elimination would produce the result 0 = 0 for the second equation.
There are 2 values of “a” such that the elimination breakdown in a permanent way. a =2 and a=-2. Note that the breakdown would be permanent if the result of the elimination is the elimination of both terms of the second equation, i.e. (assuming a!=0) if a – (4/a) = 0. Where 4/a is the multiplier. Solving this equation we have the result that if a = +/- 2 the breakdown would be permanent.
Thanks for pointing this out; you are (once again!) correct. I will correct the post to reflect your comment.