PETE 603 Lecture Session #28 Tuesday, 7/27/10. 28.1 Direct/Iterative Methods Iterative methods (systems of linear equations) –Computer time increases.

Slides:



Advertisements
Similar presentations
Numerical Solution of Linear Equations
Advertisements

Example 1 Matrix Solution of Linear Systems Chapter 7.2 Use matrix row operations to solve the system of equations  2009 PBLPathways.
Solving Equations = 4x – 5(6x – 10) -132 = 4x – 30x = -26x = -26x 7 = x.
CSCI-455/552 Introduction to High Performance Computing Lecture 26.
Numerical Algorithms ITCS 4/5145 Parallel Computing UNC-Charlotte, B. Wilkinson, 2009.
Linear Systems of Equations
Iterative Methods and QR Factorization Lecture 5 Alessandra Nardi Thanks to Prof. Jacob White, Suvranu De, Deepak Ramaswamy, Michal Rewienski, and Karen.
Lesson 8 Gauss Jordan Elimination
The Simplex Algorithm An Algorithm for solving Linear Programming Problems.
Numerical Algorithms • Matrix multiplication
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.
Systems of Non-Linear Equations
Island Recharge Problem
Thomas algorithm to solve tridiagonal matrices
Monica Garika Chandana Guduru. METHODS TO SOLVE LINEAR SYSTEMS Direct methods Gaussian elimination method LU method for factorization Simplex method of.
Partial differential equations Function depends on two or more independent variables This is a very simple one - there are many more complicated ones.
Iterative Methods for Solving Linear Systems of Equations ( part of the course given for the 2 nd grade at BGU, ME )
PETE 603 Lecture Session #29 Thursday, 7/29/ Iterative Solution Methods Older methods, such as PSOR, and LSOR require user supplied iteration.
7.3 Solving Systems of Equations in Three Variables
Solving System of Linear Equations. 1. Diagonal Form of a System of Equations 2. Elementary Row Operations 3. Elementary Row Operation 1 4. Elementary.
Matrices Write and Augmented Matrix of a system of Linear Equations Write the system from the augmented matrix Solve Systems of Linear Equations using.
Section 8.3 – Systems of Linear Equations - Determinants Using Determinants to Solve Systems of Equations A determinant is a value that is obtained from.
Section 8.1/8.2 Matrix Solutions to Linear Systems Inconsistent and Dependent Systems.
Computer Engineering Majors Authors: Autar Kaw
ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)
Spring 2013 Solving a System of Linear Equations Matrix inverse Simultaneous equations Cramer’s rule Second-order Conditions Lecture 7.
Lecture Objectives Review SIMPLE CFD Algorithm SIMPLE Semi-Implicit Method for Pressure-Linked Equations Define Residual and Relaxation.
Finite Mathematics Dr. Saeid Moloudzadeh Using Matrices to Solve Systems of Equations 1 Contents Algebra Review Functions and Linear Models.
1.1.2 INTRODUCTION TO SYSTEMS OF LINEAR EQUATIONS Chapter 1: Systems of Linear Equations and Matrices SWBAT: Redefine algebraic operations as Elementary.
Iterative Methods for Solving Linear Systems Leo Magallon & Morgan Ulloa.
10/17/ Gauss-Siedel Method Industrial Engineering Majors Authors: Autar Kaw
Linear Systems Iterative Solutions CSE 541 Roger Crawfis.
10/26/ Gauss-Siedel Method Civil Engineering Majors Authors: Autar Kaw Transforming.
Lecture Objectives: Explicit vs. Implicit Residual, Stability, Relaxation Simple algorithm.
Lecture 7 - Systems of Equations CVEN 302 June 17, 2002.
Elliptic PDEs and the Finite Difference Method
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 3- Chapter 12 Iterative Methods.
Lecture Objectives Review Define Residual and Relaxation SIMPLE CFD Algorithm SIMPLE Semi-Implicit Method for Pressure-Linked Equations.
Linear Systems – Iterative methods
Introduction to Scientific Computing II Overview Michael Bader.
8.2 Operations With Matrices
3.6 Solving Systems Using Matrices You can use a matrix to represent and solve a system of equations without writing the variables. A matrix is a rectangular.
Island Recharge Problem
Solving Linear Systems by Substitution
Computers in Civil Engineering 53:081 Spring 2003 Lecture #8 Roots of Equations: Systems of Equations.
Lecture Objectives Meshing Unsteady State CFD.
3/6/ Gauss-Siedel Method Major: All Engineering Majors Author: دکتر ابوالفضل رنجبر نوعی
1 Image Search What is a multiplication table? How can you read it? 2 Web Search/Thinkin g When you’re using a multiplication table, what would.
CSCI-455/552 Introduction to High Performance Computing Lecture 15.
Implicit approximation can be solved using: Point iteration (G/S, SOR) Direct (matrix) solution Combination of matrix soln and iteration (used in MODFLOW)
Do Now: Perform the indicated operation. 1.). Algebra II Elements 11.1: Matrix Operations HW: HW: p.590 (16-36 even, 37, 44, 46)
Programming assignment # 3 Numerical Methods for PDEs Spring 2007 Jim E. Jones.
Lecture 9 Numerical Analysis. Solution of Linear System of Equations Chapter 3.
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00.
Systems of Linear Equations: Matrices
Numerical Analysis Lecture12.
We will be looking for a solution to the system of linear differential equations with constant coefficients.
Linear Algebra Lecture 4.
CHAPTER 9: GAUSSIAN ELIMINATION.
Find 4 A + 2 B if {image} and {image} Select the correct answer.
Unit 3: Matrices
8.1 Matrices and System of Linear Equations
Elementary Row Operations Gaussian Elimination Method
Linear Algebra Lecture 3.
Numerical Analysis Lecture13.
Linear Algebra Lecture 6.
Engineering Analysis ENG 3420 Fall 2009
Solving a System of Linear Equations
Multiply by 5/40 and sum with 2nd row
Presentation transcript:

PETE 603 Lecture Session #28 Tuesday, 7/27/10

28.1 Direct/Iterative Methods Iterative methods (systems of linear equations) –Computer time increases more linearly with the number of unknowns –Convergence criteria must be considered CPU Time Number of Unknowns Direct Iterative

28.2 Gauss-Seidel Iteration

28.3 Gauss-Seidel Iteration

28.4 Gauss-Seidel Iteration

28.5 Gauss-Seidel Iteration

28.6 Gauss-Seidel Iteration

28.7 Gauss-Seidel Iteration

28.8 Gauss-Seidel Iteration

28.9 Gauss-Seidel Iteration

28.10 Gauss-Seidel Iteration Application to Reservoir Simulation: Consider this system and the 2-D finite difference equation Ap = r We can write the equation for Block 5 and for a general block

28.11 Gauss-Seidel Iteration Rearrangement gives: Point Successive Overrelaxation (PSOR)

28.12 LSOR Iteration Again, consider this system and the 2-D finite difference equation Ap = r Now write all of the equations for the 2nd column (first column unknowns already updated):

28.13 Gauss-Seidel Iteration These can be written Use the latest iteration for the East and West pressures, and solve using the Thomas Algorithm This is Line Successive Overrelaxation (LSOR)

28.14 Gauss-Seidel Iteration Now, consider this system and the 3-D finite difference equation Ap = r Now, the equations for each layer or slice of rows or columns can be written, and at each iteration, a 2-D matrix equation must be solved. This is Block Successive Overrelaxation (BSOR) Top Bottom