MINI RESEARCH

“ PERSAMAAN LINIER MENURUT GAUSS JHORDAN “

DOSEN PEMBIMBING :

Drs. ABDUL HAKIM, S, M.Si

DISUSUN OLEH :

AULIA RAMADHANI

NURHAYATI

PHYSICS DEPARTMENT

FACULTY OF MATHEMATIC AND SCIENCE

MEDAN STATE UNIVERSITY

 2018

PREFACE

By mentioning the name of Allah SWT, the Most Gracious, the Most Merciful, We offer
worship and praise for His presence, who has bestowed His mercy, guidance and blessings on us,
so that we can complete the mini research.

We have arranged this mini research to the fullest and get help from various parties so
that it can facilitate the making of this paper. For this reason, we express our gratitude to all
those who helped us in completing our mini research.

Apart from all that, we are fully aware that there are still shortcomings both in terms of
sentence structure and grammar. Therefore with open arms we accept all suggestions and
criticisms from readers so that we can improve this paper.

Finally, we hope that this scientific paper on mini research can provide benefits and
inspiration to readers.

Authors
 TABLE OF CONTENT

PREFACE

TABLE OF CONTENT

CHAPTER I INTRODUCTION

CHAPTER II THEORITICAL REVIEW

CHAPTER III DISCUSSION

CHAPTER IV CLOSING
 CHAPTER 1

INTRODUCTION

A. Background

In the environment of our lives, especially in the present, whatever we need can be obtained
very easily. For example, we need food, drinks, or other needs, we can get it easily, quickly, and
at a fairly affordable price. And one alternative offered is to have a mini market. In a mini market
we can directly choose the item and the price of the item has been printed. And here we will
discuss linear equations according to Gauss Jhordan by using variables from numbers or prices
of goods that we will buy at the same minimarket but in different locations.

B. Problem formulation
1. What is a linear equation according to Gauss Jhordan?
2. What is the shape and resolution of linear equations according to Gauss Jhordan?
3. How is the application of linear equations according to Gauss Jhordan?

C. Purpose
1. Knowing the line equations according to Jhordan Gauss.Mengetahui dan memahami
bentuk dan penyelesaian persamaan linier menurut Gauss Jhordan.
2. Knowing and understanding the form of application of linear equations according to
Jhordan Gauss.
 CHAPTER II

THEORITICAL REVIEW

Linear Algebra begins with studying the system of linear equations. The first step
determines the next step in general where the equations and variables change and not only need
to be the same. In other solutions to the general system of equations, first can be by calculating
the knowledge of the elimination algorithm.. We are interested in solving a system of linear
algebraic equations in a systematic manner, preferably in a way that can be easily coded for a
machine. The best general choice is the Gauss-Jordan procedure which, with certain
modifications that must be used to take into account problems arising from specific difficulties in
numerical analysis, can be described very easily. Together with a couple of examples and a
couple of exercises that you can do by following the given examples, it is easily mastered. The
idea is to start with a system of equations and, by carrying out certain operations on the system,
reduce it to an equivalent system whose solution is easily found. This method can be used to
solve systems of linear equations involving two or more variables. However, the system must be
changed to an augmented matrix. This method can also be used to find the inverse of a 2x2
matrix or larger matrices, 3x3, 4x4 etc. In linear algebra, Gauss-Jordan elimination is a version
of Gauss elimination. In the Gauus-Jordan elimination method we make zero elements below or
above the main diagonal of a matrix. The result is an reduced matrix in the form of a unit
diagonal matrix (All elements in the main diagonal are 1, the other elements are zero).

The characteristics of Gauss Jordan method

1. If a line is not all zeros, then the first number that is not zero is 1 (1 main)

2. The zero row is located at the bottom

3. 1 main the next row is on the main 1 row above

4. Under 1 main must be zero

There are three different operations known as Elementary Row Operations used when solving
or reducing a matrix, using Gauss-Jordan elimination method.
1. Interchanging two rows.

2. Add one row to another row, or multiply one row first and then adding it to another.

3. Multiplying a row by any constant greater than zero.

Identity Matrix-is the final result obtained when a matrix is reduced. This matrix consists of
ones in the diagonal starting with the first number.

The Gauss-Jordan elimination is the development of Gauss elimination which results are
even simpler. The trick is to continue line operations from Gauss elimination to produce an
echelon-row matrix. This can also be used as one method of solving linear equations using a
matrix.
1 0 0
(0 1 0)
0 0 1
This method is used to find the inverse of a matrix.

The general procedure for this Gauss-Jordan elimination method is

1. Change the system of linear equations that you want to calculate as an augmentation matrix.

2. Perform elementary row operations on the augmentation matrix (A | b) to change the matrix A
becomes in the form of a reduced echelon line

The technique used in the Gauss-Jordan elimination method is the same as the Gauss
elimination method which is using Elementary Line Operations. Only the settlement calculation
is directly obtained from the value in the last column of each row.

- One clear way to calculate inversion is to use the Gauss-Jordan method. To do this, the
coefficient matrix is expanded with a unitary matrix.
- Then the Gauss Jordan method is applied to reduce the coefficient matrix to a unitary
matrix.
- When finished, the right hand side of the expanded matrix will contain inversion.
- Steps for Gauss-Jordan elimination:
- - Specify the leftmost non-zero column
- - If the topmost element of the leftmost zero non-column obtained in step 1 is 0,
exchange the top row with another row
- - If the current top element in the column obtained in 1 or 2 is a, multiply the first line by
1 / a to get 1 main.
- - Add the appropriate multiples from the top row to the lines below so that all the
elements below the main one are 0. Ignore the top row in the matrix and start again with
steps 1-4 done in the remaining submatrix. Continue this method until the entire matrix is
in the form of a row echelon.
- - Starting from the last non-zero row and working upwards, add the corresponding
multiples of the row to the rows above to get zero above the main 1.
 CHAPTER III

DISCUSSION

CHAPTER IV

CLOSING

A. Conclusion
Linear Algebra begins with studying the system of linear equations. The first step
determines the next step in general where the equations and variables change and not
only need to be the same. In other solutions to the general system of equations, first
can be by calculating the knowledge of the elimination algorithm. System linear
equation is a collection of linear equations that have the same variables.
Gauss elimination is a method for operating values in a matrix so that it becomes a
simpler matrix. The Gauss-Jordan elimination method is less efficient at completing
an SPL, but is more efficient than Gauss elimination if we want to resolve SPL with
the same coefficient matrix. The Motede is named after the Gauss-Jordan Elimination
in honor of Carl Friedrich Gauss and Whilhelm Jordan.
 REFERENCES

Howard Anton. 1987. Aljabar Linear Elementer.Jakarta: Erlangga.

Bill Jacob. 1990. Linear Aljebra. New York: Freeman and Company