Gauss elimination applied to a $4\times 2$ system of equations

1.1k Views Asked by At

I have used Gauss elimination just for a while, and I am still not comfortable, and most of the times I do mistakes and I do not arrive the the right upper triangular matrix.

I have problem which says:

What conditions on all $b$’s must hold (clearly mark your findings), that each of these systems has a solution? Hint. Apply Gauss’ method and see what happens to the right-hand side.

$$x - 2y = b_1 \\ 2x - 9y = b_2 \\ 7x - 3y = b_3 \\ 2x - y = b_4$$

So far, I have just apply the Gaussian elimination method to $3\times 3$ matrices, so, in this case, I would not know how to do it, if it is even possible...

2

There are 2 best solutions below

5
On BEST ANSWER

$$\begin{cases} x - 2y = b_1 \\ 2x - 9y = b_2 \\ 7x - 3y = b_3 \\ 2x - y = b_4\end{cases} \iff \left[\begin{array}{cc|c} 1 & -2 & b_1 \\ 2 & -9 & b_2 \\ 7 & -3 & b_3 \\ 2 & -1 & b_4\end{array}\right] \sim \left[\begin{array}{cc|c} 1 & -2 & b_1 \\ 0 & -5 & b_2-2b_1 \\ 0 & 11 & b_3-7b_1 \\ 0 & 3 & b_4-2b_1\end{array}\right] \sim \left[\begin{array}{cc|c} 1 & 0 & b_1+2(\frac{2b_1-b_2}{5}) \\ 0 & 1 & \frac{2b_1-b_2}{5} \\ 0 & 0 & b_3-7b_1 - 11(\frac{2b_1-b_2}{5}) \\ 0 & 0 & b_4-2b_1 - 3(\frac{2b_1-b_2}{5})\end{array}\right]$$

So what does this tell you? What it tells you is that the conditions on the $b_i$'s are $0=b_3-7b_1 - 11(\frac{2b_1-b_2}{5}) \implies -57b_1+11b_2+5b_3=0$ and $0=b_4-2b_1 - 3(\frac{2b_1-b_2}{5}) \implies -16b_1+3b_2+5b_4=0$. The only way your original equations are consistent is if these two equations in only the $b_i$'s hold.

It might be easier if set up a new matrix for these equations:

$$\left[\begin{array}{cccc|c} -57 & 11 & 5 & 0 & 0 \\ -16 & 3 & 0 & 5 & 0\end{array}\right] \sim \left[\begin{array}{cccc|c} 1 & 0 & 3 & -11 & 0 \\ 0 & 1 & 16 & -57 & 0\end{array}\right]$$

Let $b_4=t$ and $b_3=s$ to get $b_1 = -3s+11t$ and $b_2 = -16s+57t$.

So as long as $\pmatrix{b_1 \\ b_2 \\ b_3 \\ b_4} = s\pmatrix{-3 \\ -16 \\ 1 \\ 0} + t\pmatrix{11 \\ 57 \\ 0 \\1}$ for any $s,t \in \Bbb R$, your system will be consistent.

P.S. I've checked my answer and it is correct. Just to let you know, though: your question asks you to solve this via Gaussian reduction, so that's what I did, BUT, there's a much simpler solution that requires $0$ calculation. Can you figure out what that method is?

0
On

here is another way to look at this complementing Bye-World's solution. you have an over determined system $Ax = b.$ that is you are looking for vectors $b$ in the plane spanned by the first two columns of $A.$ what that requires is $b$ ito be orthogonal to vectors spanned by the first two columns. you can find the orthogonal vectors by row reducing $$\pmatrix{1&2&7&2\\-2&-9&-3&-1} \to \pmatrix{1&2&7&2\\0&-5&11&0} $$ if you set $z = 0, w = 1$ you get $y = 0, x = -2$ and another solution you get by setting $z = 5, w = 0$ you get $y = 11, x = -57.$

so the consistency conditions are $$-2b_1 +b_4 = 0, -57b_1 + 11b_2 + 5b_3 = 0 $$