Week 1
Week 1
The numbers are called the coefficients of the linear system. there are m equations and n unknown variables
there are thefore coefficients.
The main problem with a linear system is to solve it.
The solution of a linear equation
It is easy to see that the two lines are parallel and do not intersect, so that this system of two linear equations has no solution.
The solution of a linear equation
It is easy to see that the two lines are not parallel and intersect, so that this system of two linear equations has exactly one solution.
The solution of a linear equation
It is easy to see that the two lines overlap completely, so that this system of two linear equations has infinitely many solutions.
The solution of a linear equation
This is solution set. Notice that a solution to a system may be more than one.
The linear system
So (1,2,-4) is a solution to the system So (1, −1, 2) is not a solution to the system
Linear vs Nonlinear System
The conditions of the linear system:
Linear equation
Linear system
Linear equation
is a column vector
Coeffient matrix, Output vector and
Augmented matrix
As a reverse
Example
We can write linear system as below equations. We can also write it this way.
Coeffient matrix, Output vector and
Augmented matrix
There are three basic operations to solve a linear system. These are called elemantary operations.
These operations do not alter the solution set.
The mail goal of this operations is to obtain triangular matrix form and back substitution to solve linear system.
Solving Linear Systems
The set of points that satisfy the linear system is the intersection of the two lines
determined by the equations of the system. The solution for this system is .
The two lines intersect at the point
Row Echelon Form
There are 3 rules for row echelon form;
[ ] [ ] [ ]
1 0 2 3 1 0 2 3 1 0 2 3
0 2 3 4 0 1 0 0 0 1 0 0
0 1 2 3 0 1 2 3 0 0 1 3
0 1 1 2 0 1 1 2 0 0 0 1
[ ] [ ] [ ]
1 0 2 3 1 0 2 3
1 0 2 3
0 1 3 4 0 1 0 0
0 1 2 2
0 0 0 0 0 0 1 3
0 1 0 2 0 0 0 1
0 0 1 2
Example
[ ]
2 −1 3 4
1 2 −1 5 Find the row echelon form of this matrix.
3 1 2 6
Should be 1.
[ ] [ ]
2 −1 3 4 𝑅1 ↔ 𝑅2 1 2 −1 5
1 2 −1 5 2 −1 3 4
3 1 2 6 3 1 2 6
[ ]
−2 𝑅 1+ 𝑅2 → 𝑅 2
[ ]
1 2 −1 5
1 2 −1 5
0 −5 5 −6
2 −1 3 4
3 1 2 6
−3 𝑅1 + 𝑅3 → 𝑅3 0 −5 5 −9
Should be 0.
Example - continued
[ ] [ ]
1 2 −1 5 1 1 2 −1 5
0 −5 5 −6 − 𝑅2 → 𝑅 2 6
5 0 1 −1
0 −5 5 −9 5
0 −5 5 −9
[ ] [ ]
1 2 −1 5 5 𝑅2+ 𝑅3→ 𝑅3 1 2 −1 5
6
0 1 −1 6
5 0 1 −1
5
0 −5 5 −9
0 0 0 −3
[ ] [ ]
1 2 −1 5 1 2 −1 5
6 1 6
0 1 −1 − 𝑅 → 𝑅3 0 1 −1
5 3 3 5
0 0 0 −3 0 0 0 1
Reduced Row Echelon Form
There are 4 rules for row echelon form;
1. The left-most non-zero entry of any non-zero row has value. These are called the pivot entries.
2. All zero rows are grouped together at the bottom of the array.
3. The pivot entry of a non-zero row occurring lower in the array is to the right of the pivot entry
of a non-zero row occurring higher in the array.
4. Each column containing a pivot entry has 0’s everywhere else in the column
Reduced Row Echelon Form
[ ]
1 2 2 0
0 0 1 0 This matrix is in row echelon form but not in reduced row echelon form.
0 0 0 1
[ ]
1 2 0 0
0 0 1 0
0 0 0 1
Example
[ ]
1 2 −1 3
2 4 1 5 Find the reduced row echelon form of this matrix.
−3 −6 2 1
[ ]
1 2 −1 3
[ ]
1 2 −1 3 0 0 3 −1
2 4 1 5 −2 𝑅 1+ 𝑅2 → 𝑅 2 0 0 − 1 10
−3 −6 2 1
−3 𝑅1 + 𝑅3 → 𝑅3
[ ]
1 2 −1 3
[ ]
1 2 −1 3 1
1 0 0 1 −
0 0 3 −1 𝑅 → 𝑅2 3
0 0 − 1 10 3 2 0 0 −1 10
[ ]
8
1 2 0
[ ]
3
1 2 −1 3 𝑅1 + 𝑅 2 → 𝑅1 1
1 0 0 1 −
0 0 1 − 3
3 𝑅 2+ 𝑅3 → 𝑅 3
29
0 0 −1 10 0 0 0
3
Example - continued
[ ] [ ]
8 8
1 2 0 1 2 0
3 3 3
𝑅 → 𝑅3
1 29 3 0 0 1 −
1
0 0 1 − 3
3
29 0 0 0 1
0 0 0
3