Gauss-Jordan Elimination Method Help

In summary, Gauss-Jordan Elimination is a method used to solve systems of equations. It involves using row operations to transform a given matrix into reduced row echelon form. The goal is to obtain a matrix with a diagonal of 1s, with zeros in the rest of the row. This can be done by making the first terms in each row zero and applying it to the rest of the numbers in that row. Finally, by using a Gaussian elimination on the given augmented matrix, the values of the variables can be obtained.
  • #1
heavyarms
11
0
Gauss-Jordan Elimination Method Help!

Hi, I'm having a problem solving the following using the Gauss-Jordan Elimination Method. I am wondering if someone can help me...
2x + 5y - z = -3
x - y + 4z = 20
3x + 2y - z = 3
i.e.
Code:
[ [2   5  -1  -3]
[1  -1   4  20]
[3   2  -1    3]]
I've tried solving it by... R1<-->R2, R2+(-1)R1, R3+(-3)R1, but I'm stuck with...
Code:
[ [1  -1   4    20]
[0   7   9   -43]
[0   5  -13 -57]]
I'm stuck because my textbook says we're not suppose to use fractions to solve it. I know I can do R3+(-5/7)R2, but that'd be using fractions. So I'm wondering if someone can lend me a hand and show me the correct way to complete this question! Thanks!
 
Physics news on Phys.org
  • #2
For your first step of using matrixes,

R1[ 2 5 -1 | -3 ]
R2[ 1 -1 4 | 20 ]
R3[ 3 2 -1 | 3 ]

Second Step:

R1 [ 2 5 -1 | -3 ]
R1-2R2 [ 0 7 -9 | -43 ]
3R1-2R3[ 0 11 -1 | -15 ]

Third Step:

[ 2 5 -1 | -3 ]
[ 0 7 -9 | -43 ]
11R2 - 7R3[ 0 0 -92 | -385 ]
 
  • #3
forevergone said:
[ 2 5 -1 | -3 ]

Do I not have to isolate a 1 in the top left hand corner?
i.e. [ 1 X X | X ] for the top row?

forevergone said:
3R1-2R3 || 11R2 - 7R3

Also isn't it not allowed to changed two rows at a time?
 
Last edited:
  • #4
heavyarms said:
Do I not have to isolate a 1 in the top left hand corner?
i.e. [ 1 X X | X ] for the top row?
Also isn't it not allowed to changed two rows at a time?

No. The way I learned to do Gauss-Jordan Elimination was to leave the 1st row alone. For the second and third row, you make the first terms zero and apply it to the rest of the numbers in that row. In the second step, you make the second number zero from the third row by subtracting it from the second row.
 
  • #5
forevergone said:
No. The way I learned to do Gauss-Jordan Elimination was to leave the 1st row alone. For the second and third row, you make the first terms zero and apply it to the rest of the numbers in that row. In the second step, you make the second number zero from the third row by subtracting it from the second row.

Do whatever is easiest, which is avoid fractions for the most part. Then just switch around the rows at the end. Same thing.
 
  • #6
JasonRox said:
Do whatever is easiest, which is avoid fractions for the most part. Then just switch around the rows at the end. Same thing.

So as long as I obtain an answer, it is still correct no matter the method I use? If this is the case then my textbook is really odd... it states that (1,1) has to be either +/- 1 and that multiplication changes can only occur in one row when adding.
 
  • #7
What is the full question that asks you to do for this set of matrixes?

Usually, matrixes are used to determine the intersection of 2/3 planes.
 
  • #8
forevergone said:
What is the full question that asks you to do for this set of matrixes?

Usually, matrixes are used to determine the intersection of 2/3 planes.

The full question is as follows:

Solve the following system by the Gauss-Jordan elimination method.
2x + 5Y - Z = -3
X - Y + 4Z = 20
3X + 2Y - Z = 3
Indicate the row operation used in each step.
 
  • #9
heavyarms said:
The full question is as follows:
Solve the following system by the Gauss-Jordan elimination method.
2x + 5Y - Z = -3
X - Y + 4Z = 20
3X + 2Y - Z = 3
Indicate the row operation used in each step.

Gauss Jordan elimination is not necessary for obtaining the values of the three variables. Gaussian elimination is quicker, which is only making the triangle of zeros in the bottom left corner of the augmented matrix. If you have a TI-83 calculator, you can find the values of the three variables by pressing 2nd x^-1, and edit matrix A accordingly. You can then quit out of the program, enter matrices again, go to math, rref (reduced row echelon form) and then select matrix A
 
  • #10
Leonardo Sidis said:
Gauss Jordan elimination is not necessary for obtaining the values of the three variables. Gaussian elimination is quicker, which is only making the triangle of zeros in the bottom left corner of the augmented matrix. If you have a TI-83 calculator, you can find the values of the three variables by pressing 2nd x^-1, and edit matrix A accordingly. You can then quit out of the program, enter matrices again, go to math, rref (reduced row echelon form) and then select matrix A

Thank you for your suggestion. I've just tried it on my TI-83 Plus SE and it gave me..
[[1 0 0 3]
[0 1 0 -1]
[0 0 1 4]]
I know that is the correct answer, but the textbook requires me to show all the steps. The problem is I am stuck midway to obtaining the answer. (See the first post in this thread). As such, I'd be very grateful if you can lead me in the right direction. Thanks.
 
  • #11
heavyarms said:
Thank you for your suggestion. I've just tried it on my TI-83 Plus SE and it gave me..
[[1 0 0 3]
[0 1 0 -1]
[0 0 1 4]]
I know that is the correct answer, but the textbook requires me to show all the steps. The problem is I am stuck midway to obtaining the answer. (See the first post in this thread). As such, I'd be very grateful if you can lead me in the right direction. Thanks.

Heavyarms, I'll try to do this at school and find how this works out. Your first row though, I'm not sure why but it should never ever change.
 
  • #12
I threw the matrix in Matlab and got the same results using G-J Elimination:
1 0 0 3
0 1 0 -1
0 0 1 4
 
  • #13
forevergone said:
Heavyarms, I'll try to do this at school and find how this works out. Your first row though, I'm not sure why but it should never ever change.

Thanks! Your help is very much appreciated.

BTW, Merry Christmas! :biggrin:
 
  • #14
Do a rref on your calculator. i am sure gauss wouldn t be mad at your.
 

FAQ: Gauss-Jordan Elimination Method Help

1. What is the Gauss-Jordan elimination method?

The Gauss-Jordan elimination method is a mathematical technique used to solve systems of linear equations. It involves performing a series of operations on a matrix to reduce it to its row echelon form and then to its reduced row echelon form.

2. When is the Gauss-Jordan elimination method used?

The Gauss-Jordan elimination method is typically used when there are multiple equations with multiple variables. It is also useful when solving systems of equations with complex coefficients.

3. What are the steps involved in the Gauss-Jordan elimination method?

The first step is to set up the augmented matrix, where the coefficients and constants of the equations are organized in a matrix form. Then, using row operations such as scaling, swapping, and adding, the matrix is reduced to its row echelon form. Finally, the matrix is reduced to its reduced row echelon form, which represents the solution to the system of equations.

4. What are the benefits of using the Gauss-Jordan elimination method?

The Gauss-Jordan elimination method is a systematic and efficient way to solve systems of linear equations. It allows for a clear and concise representation of the solution and can handle complex systems of equations with ease.

5. Are there any limitations to the Gauss-Jordan elimination method?

While the Gauss-Jordan elimination method is a powerful tool, it can become computationally expensive for larger systems of equations. It also requires careful attention to detail and precision when performing the row operations to avoid errors.

Similar threads

Replies
1
Views
685
Replies
3
Views
1K
Replies
4
Views
8K
Replies
1
Views
1K
Replies
22
Views
3K
Replies
4
Views
954
Replies
11
Views
4K
Replies
2
Views
6K
Back
Top