Iterative Methods Good for sparse matrices Jacobi Iteration

Slides:



Advertisements
Similar presentations
Numerical Solution of Linear Equations
Advertisements

Linear System Remark: Remark: Remark: Example: Solve:
CSCI-455/552 Introduction to High Performance Computing Lecture 25.
Solving Equations = 4x – 5(6x – 10) -132 = 4x – 30x = -26x = -26x 7 = x.
Numerical Algorithms Matrix multiplication
Special Matrices and Gauss-Siedel
1 Systems of Linear Equations Iterative Methods. 2 B. Iterative Methods 1.Jacobi method and Gauss Seidel 2.Relaxation method for iterative methods.
1 Systems of Linear Equations Iterative Methods. 2 B. Direct Methods 1.Jacobi method and Gauss Seidel 2.Relaxation method for iterative methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 20 Solution of Linear System of Equations - Iterative Methods.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 19 Solution of Linear System of Equations - Iterative Methods.
Special Matrices and Gauss-Siedel
ECIV 520 Structural Analysis II Review of Matrix Algebra.
Iterative Methods for Solving Linear Systems of Equations ( part of the course given for the 2 nd grade at BGU, ME )
ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 111.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 11.
Lecture 7 - Systems of Equations CVEN 302 June 17, 2002.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3- Chapter 12 Iterative Methods.
Linear Systems – Iterative methods
Lecture 21 MA471 Fall 03. Recall Jacobi Smoothing We recall that the relaxed Jacobi scheme: Smooths out the highest frequency modes fastest.
Introduction to Scientific Computing II
Part 3 Chapter 12 Iterative Methods
Solving Scalar Linear Systems A Little Theory For Jacobi Iteration
Linear Systems Numerical Methods. 2 Jacobi Iterative Method Choose an initial guess (i.e. all zeros) and Iterate until the equality is satisfied. No guarantee.
Special Matrices Banded matrices Solutions to problems that depend on their neighbours eg 1D T i = f(T i-1,T i+1 ) 2D T i,j = f(T i-1,j,T i+1,j,T i,j -1,T.
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.
1 Gauss-Seidel Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis Applied Numerical Method for Engineers Chapter 11.
Iterative Solution Methods
TYPES OF SOLUTIONS SOLVING EQUATIONS
Chapter: 3c System of Linear Equations
Part 3 Chapter 12 Iterative Methods
TYPES OF SOLUTIONS SOLVING EQUATIONS
Solving Systems of Linear Equations: Iterative Methods
بسم الله الرحمن الرحيم.
Solving Linear Systems Ax=b
Gauss-Siedel Method.
Numerical Analysis Lecture12.
Scientific Computing Lab
A Comparison of some Iterative Methods in Scientific Computing
Warm Up 3x + 5y = 25 4x + 7y = 34 Find the value of x and y so that both equations are true.
CSE 245: Computer Aided Circuit Simulation and Verification
Autar Kaw Benjamin Rigsby
Numerical Analysis Lecture 45.
Scientific Computing Lab
CSE 245: Computer Aided Circuit Simulation and Verification
Matrix Methods Summary
Solving Systems of non-linear Equations
Stencil Quiz questions
Matrix Solutions to Linear Systems
Introduction to Scientific Computing II
Numerical Analysis Lecture14.
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Stencil Quiz questions
Applied Numerical Methods
Numerical Analysis Lecture13.
Linear Systems Numerical Methods.
Numerical Linear Algebra
Systems of Equations Solve by Graphing.
Introduction to Scientific Computing II
Numerical Methods on Partial Differential Equation
Engineering Analysis ENG 3420 Fall 2009
ITERATIVE METHODS Prepared by, Dr. L. Benedict Michael Raj
Chapter 11 Chapter 11.
Solving a System of Linear Equations
Numerical Analysis Lecture11.
Linear Algebra Lecture 16.
Home assignment #3 (1) (Total 3 problems) Due: 12 November 2018
Ax = b Methods for Solution of the System of Equations:
Ax = b Methods for Solution of the System of Equations (ReCap):
Presentation transcript:

Iterative Methods Good for sparse matrices Jacobi Iteration Gauss-Seidel Iteration

Iterative Method Concept Given a system of linear equation Direct solution for x; 𝑎 11 𝑥 1  𝑎 12 𝑥 2 ⋯ 𝑎 1n 𝑥 𝑛 = 𝑏 1 ⋮ 𝑎 𝑛1 𝑥 1  𝑎 𝑛2 𝑥 2 ⋯ 𝑎 𝑛𝑛 𝑥 𝑛 = 𝑏 𝑛 𝑥 1 = 1 𝑎 11 𝑏 1 − 𝑎 12 𝑥 2 −⋯ 𝑎 1n 𝑥 𝑛 ⋮ 𝑥 𝑛 = 1 𝑎 𝑛𝑛 𝑏 𝑛 − 𝑎 𝑛1 𝑥 1 −⋯ 𝑎 𝑛,𝑛−1 𝑥 𝑛−1

Compact form Iteration 𝑥 𝑖 = 1 𝑎 𝑖𝑖 𝑏 𝑖 − 𝑗=1,𝑗≠𝑖 𝑛 𝑎 𝑖𝑗 𝑥 𝑗 ;𝑖=1,2,⋯𝑛 Iteration 𝑥 𝑖 2 = 1 𝑎 𝑖𝑖 𝑏 𝑖 − 𝑗=1,𝑗≠𝑖 𝑛 𝑎 𝑖𝑗 𝑥 𝑗 1 ;𝑖=1,2,⋯𝑛

Solve Iteratively Start with initial guess for x's, simplest is xi=0 Iterate using new values comparing error with previous values Convergence when ∣  𝑎,𝑖 ∣= ∣ 𝑥 𝑖 𝑗 − 𝑥 𝑖 𝑗−1 𝑥 𝑖 𝑗 ∣ 100%  𝑠

Jacobi Iteration Gauss-Seidel Iteration All x's for each iteration unmodified during iteration Gauss-Seidel Iteration x's modified during iteration as new values of x's are calculated

Convergence Gauss-Seidel may not converge Diagonally dominant (guaranteed convergence) Relaxation for improved convergence New value of x is modified by a weighted average Weighting factor = relaxation factor = λ