Professional Documents
Culture Documents
LAB 1 - Direct Elimination Methods PDF
LAB 1 - Direct Elimination Methods PDF
CE 28
Analytical & Computational Institute of Civil Engineering
Methods in CE III
Introduction
Solutions to Systems of
Linear Equations
Thomas Algorithm
LAB 3
Cramer’s Rule
Matrix Inverse
Solution vector
▪ These row operations will not affect the solution to the system of
linear equations
𝑎𝑖,𝑘 𝑎𝑖,𝑘
𝑎𝑖,𝑗 = 𝑎𝑖,𝑗 − ∗ 𝑎𝑘,𝑗 𝑏𝑖 = 𝑏𝑖 − ∗ 𝑏𝑘
𝑎𝑘,𝑘 𝑎𝑘,𝑘
𝒊 refers to the row whose 𝒋 refers to the 𝒌 refers to the row you are
elements you are eliminating elements in a row using to eliminate other rows
𝑖 = 𝑘 + 1, 𝑘 + 2, … , 𝑛 𝑗 = 1, 2, … , 𝑛 𝑘 = 1, 2, … , 𝑛 − 1
𝑏𝑛
𝑥𝑛 =
𝑎𝑛,𝑛
𝑏𝑖 − σ𝑛𝑗=𝑖+1 𝑎𝑖,𝑗 𝑥𝑗
𝑥𝑖 =
𝑎𝑖,𝑖
𝑖 = 𝑛 − 1, 𝑛 − 2, … , 1
Gauss-Jordan Method
▪ Variation of Gauss Elimination method in which the elements
above the major diagonal are eliminated as well.
➢ No more need for back substitution.
▪ The number of multiplications and divisions for Gauss-Jordan
elimination is approximately 50% larger than for Gauss
elimination.
➢ Gauss elimination is preferred.
Gauss-Jordan Method
Gauss-Jordan Method
Gauss-Jordan Method
Gauss-Jordan Method
Gauss-Jordan Method
Row 1 1 0 0 3
Row 2 0 1 0 −2.5
Row 3 0 0 1 7
SOLUTION!!