Professional Documents
Culture Documents
908 Open Ended Activity Report
908 Open Ended Activity Report
Islamabad
Mathematics IV (LAB)
Assignment No. 03
Submitted by:
Talal Azfar
908-FET/BSME/F20(A)
Submitted To:
Engr. Muhammad Naeem Khan
Department Of Mechanical
Engineering IIUI
Sr No. Content Page
No.
01 Introduction 01
02 Jacobi Method 01
Introduction:
Numerical Methods Are Particularly Useful While Solving The Intensive Polynomial For Their
Roots.
These Are The Following Numerical Methods To Find Roots Of An Equation:
1. Jacobi Method
2. Gauss Seidel Method
3. Gauss Elimination Method
Each Of The Above-Mentioned Methods Is Discussed At Length In The Subsequent Sections With
Their Drawbacks And Advantages
Jacobi Method:
Jacobi Iterative Method Is An Algorithm For Determining The Solutions Of A Diagonally
Dominant System Of Linear Equations. Each Diagonal Element Is Solved For, And An
Approximate Value Is Plugged In. The Process Is Then Iterated Until It Converges.
Formula:
Solution:
MATLAB Files Attached:
Gauss Seidel Method:
Gauss–Seidel Method: Gauss–Seidel Method, Also Known As The Liebman Method Or The
Method Of Successive Displacement, Is An Iterative Method Used To Solve A Linear System
Of Equations
Formula:
Example:
Solution:
MATLAB Files Attached:
Gauss Elimination Method:
Named After Carl Friedrich Gauss, Gauss Elimination Method Is A Popular Technique Of Linear
Algebra For Solving System Of Linear Equations. As The Manipulation Process Of The Method Is
Based On Various Row Operations Of Augmented Matrix, It Is Also Known As Row Reduction
Method.
Solution:
MATLAB Files Attached:
Hand Written Solution: