Rico Suave's question at Yahoo Answers regarding using the Gauss-Jordan method

  • MHB
  • Thread starter MarkFL
  • Start date
  • Tags
    Method
In summary, we solved the given system of equations using the Jordan Gauss method and found the unique solution to be (x,y,z)=(5,-3,3). We also determined that this system has one unique solution by performing a series of operations on the augmented matrix and observing that it did not result in a row of all zeros or a row with one element equal to zero.
  • #1
MarkFL
Gold Member
MHB
13,288
12
Here is the question:

Solve the system of equation with Jordan Gauss method please?

2x+4y+z=1
x-2y-3z=2
x+y-z=-1

Find x= y= and z=

Also, find if this equation has 1)only one solution, 2)no solution or 3) an infinite number of solutions. please explain how you know the number of solutions for this problem.

Thank you for your help.

I have posted a link there to this thread so the OP can view my work.
 
Mathematics news on Phys.org
  • #2
Hello Rico Suave,

We are given the system of equations:

\(\displaystyle 2x+4y+z=1 \)

\(\displaystyle x-2y-3z=2 \)

\(\displaystyle x+y-z=-1\)

The first thing we want to do is construct the augmented matrix using the coefficients:

\(\displaystyle \left[\begin{array}{ccc|c} 2&4&1&1\\ 1&-2&-3&2\\ 1&1&-1&-1 \end{array} \right]\)

Now, what we want to do is through a series of operations, obtain an augmented matrix of the form:

\(\displaystyle \left[\begin{array}{ccc|c} 1&0&0&x\\ 0&1&0&y\\ 0&0&1&z \end{array} \right]\)

As our first operation, we see that if we divide row 1 by 2, the operation denoted by \(\displaystyle \frac{R_1}{2}\), we will obtain the desired first element of 1 in this row:

\(\displaystyle \left[\begin{array}{ccc|c} 1&2&\frac{1}{2}&\frac{1}{2}\\ 1&-2&-3&2\\ 1&1&-1&-1 \end{array} \right]\)

Next, we observe that if we subtract the first row from the second and third rows, the operations \(\displaystyle R_2-R_1\) and \(\displaystyle R_3-R_1\), we obtain:

\(\displaystyle \left[\begin{array}{ccc|c} 1&2&\frac{1}{2}&\frac{1}{2}\\ 0&-4&-\frac{7}{2}&\frac{3}{2}\\ 0&-1&-\frac{3}{2}&-\frac{3}{2} \end{array} \right]\)

Next, we look at the second element in the second row, and observe that if we divide this row by $-4$, we will get a $1$ there as we desire, so our next operation is \(\displaystyle -\frac{R_2}{4}\):

\(\displaystyle \left[\begin{array}{ccc|c} 1&2&\frac{1}{2}&\frac{1}{2}\\ 0&1&\frac{7}{8}&-\frac{3}{8}\\ 0&-1&-\frac{3}{2}&-\frac{3}{2} \end{array} \right]\)

The next operations are then \(\displaystyle R_1-2R_2\) and \(\displaystyle R_3+R_2\) and we get:

\(\displaystyle \left[\begin{array}{ccc|c} 1&0&-\frac{5}{4}&\frac{5}{4}\\ 0&1&\frac{7}{8}&-\frac{3}{8}\\ 0&0&-\frac{5}{8}&-\frac{15}{8} \end{array} \right]\)

The next operation is \(\displaystyle -\frac{8R_3}{5}\)

\(\displaystyle \left[\begin{array}{ccc|c} 1&0&-\frac{5}{4}&\frac{5}{4}\\ 0&1&\frac{7}{8}&-\frac{3}{8}\\ 0&0&1&3 \end{array} \right]\)

And our final two operations are \(\displaystyle R_1+\frac{5R_3}{4}\) and \(\displaystyle R_2-\frac{7R_3}{8}\) so that we find:

\(\displaystyle \left[\begin{array}{ccc|c} 1&0&0&5\\ 0&1&0&-3\\ 0&0&1&3 \end{array} \right]\)

Thus, we may conclude that the given system of equations has the unique solution:

\(\displaystyle (x,y,z)=(5,-3,3)\)

If this system of equation had no solutions, referred to as an inconsistent system, then we would have, at some point during our series of operations, obtained a row of the form:

\(\displaystyle \left[\begin{array}{ccc|c} 0&0&0&a \end{array} \right]\)

where \(\displaystyle a\ne0\)

This row would be equivalent to the statement \(\displaystyle 0=a\), but this is never true, so it is impossible for there to be a solution.

If this system of equation had an infinite number of solutions, referred to as a dependent system, then we would have obtained a row of the form:

\(\displaystyle \left[\begin{array}{ccc|c} 0&0&0&0 \end{array} \right]\)

This would occur if one row is simply a multiple of another. This row is equivalent to the statement $0=0$ which is always true, and so an infinite number of solutions would be the result.

But, neither of these occurred, because the system we were given is independent, meaning it has one unique solution, which we found.
 

FAQ: Rico Suave's question at Yahoo Answers regarding using the Gauss-Jordan method

What is the Gauss-Jordan method?

The Gauss-Jordan method is a mathematical technique used to solve systems of linear equations. It involves transforming a matrix into reduced row-echelon form, where the solutions to the equations can be easily identified.

How is the Gauss-Jordan method used?

The Gauss-Jordan method is used by first writing the system of linear equations in matrix form. Then, various row operations are performed on the matrix until it is in reduced row-echelon form. The resulting matrix will have the solutions to the equations in the rightmost column.

What are the advantages of using the Gauss-Jordan method?

The Gauss-Jordan method is advantageous because it provides a systematic way to solve systems of linear equations. It also eliminates the need for back substitution, making it faster and more efficient than other methods.

Are there any limitations to the Gauss-Jordan method?

Yes, there are limitations to the Gauss-Jordan method. It can only be used for systems of linear equations and may not work for more complex equations. It also requires careful attention to detail and can be time-consuming for larger matrices.

How is the Gauss-Jordan method different from other methods of solving linear equations?

The Gauss-Jordan method differs from other methods, such as Gaussian elimination, in that it eliminates the need for back substitution. This makes it faster and more efficient. Additionally, the Gauss-Jordan method can be used to find the inverse of a matrix, which is not possible with other methods.

Similar threads

Replies
7
Views
2K
Replies
1
Views
1K
Replies
2
Views
1K
Replies
1
Views
9K
Replies
1
Views
10K
Replies
7
Views
2K
Replies
11
Views
1K
Back
Top