Introduction to Scientific Computing II From Gaussian Elimination to Multigrid – A Recapitulation Dr. Miriam Mehl.

Slides:



Advertisements
Similar presentations
CSCI-455/552 Introduction to High Performance Computing Lecture 25.
Advertisements

1 Iterative Solvers for Linear Systems of Equations Presented by: Kaveh Rahnema Supervisor: Dr. Stefan Zimmer
1 Numerical Solvers for BVPs By Dong Xu State Key Lab of CAD&CG, ZJU.
CS 290H 7 November Introduction to multigrid methods
CSCI-455/552 Introduction to High Performance Computing Lecture 26.
Linear Systems of Equations
Influence of (pointwise) Gauss-Seidel relaxation on the error Poisson equation, uniform grid Error of initial guess Error after 5 relaxation Error after.
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.
Monica Garika Chandana Guduru. METHODS TO SOLVE LINEAR SYSTEMS Direct methods Gaussian elimination method LU method for factorization Simplex method of.
Iterative Methods for Solving Linear Systems of Equations ( part of the course given for the 2 nd grade at BGU, ME )
Numerical Methods for Partial Differential Equations
Numerical Methods Due to the increasing complexities encountered in the development of modern technology, analytical solutions usually are not available.
Computer Engineering Majors Authors: Autar Kaw
1 Numerical Integration of Partial Differential Equations (PDEs)
Time integration methods for the Heat Equation Solution u for t= Tobias Köppl TUM.
9/7/ Gauss-Siedel Method Chemical Engineering Majors Authors: Autar Kaw Transforming.
Scientific Computing Lab Organization Dr. Miriam Mehl Institut für Informatik Scientific Computing in Computer Science.
Scientific Computing Partial Differential Equations Poisson Equation.
10/17/ Gauss-Siedel Method Industrial Engineering Majors Authors: Autar Kaw
Applied Numerical Method for Engineers and Scientists
1 Computational Methods II (Elliptic) Dr. Farzad Ismail School of Aerospace and Mechanical Engineering Universiti Sains Malaysia Nibong Tebal Pulau.
Administrivia: May 20, 2013 Course project progress reports due Wednesday. Reading in Multigrid Tutorial: Chapters 3-4: Multigrid cycles and implementation.
Lecture 7 - Systems of Equations CVEN 302 June 17, 2002.
Elliptic PDEs and the Finite Difference Method
Solving an elliptic PDE using finite differences Numerical Methods for PDEs Spring 2007 Jim E. Jones.
MECN 3500 Inter - Bayamon Lecture 9 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
Linear Systems – Iterative methods
Introduction to Scientific Computing II Overview Michael Bader.
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl Institut für Informatik Scientific Computing In Computer Science.
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl.
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
Discretization for PDEs Chunfang Chen,Danny Thorne Adam Zornes, Deng Li CS 521 Feb., 9,2006.
MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA
Elliptic PDEs and Solvers
Scientific Computing Lab Outlook / State of Research Dr. Miriam Mehl Institut für Informatik Scientific Computing in Computer Science.
Scientific Computing Lab Organization Dr. Miriam Mehl Institut für Informatik Scientific Computing in Computer Science.
3/6/ Gauss-Siedel Method Major: All Engineering Majors Author: دکتر ابوالفضل رنجبر نوعی
Linear System expensive p=[0,0.2,0.4,0.45,0.5,0.55,0.6,0.8,1]; t=[1:8; 2:9]; e=[1,9]; n = length(p); % number of nodes m = size(t,2); % number of elements.
The Application of the Multigrid Method in a Nonhydrostatic Atmospheric Model Shu-hua Chen MMM/NCAR.
University of Colorado
Computational Fluid Dynamics Lecture II Numerical Methods and Criteria for CFD Dr. Ugur GUVEN Professor of Aerospace Engineering.
S5.40. Module Structure 30% practical tests / 70% written exam 3h lectures / week (except reading week) 3 x 2h of computer labs (solving problems practicing.
Scientific Computing Lab
Numerical Analysis Lecture12.
Scientific Computing Lab
Introduction to Multigrid Method
Introduction to Scientific Computing II
Pressure Poisson Equation
Scientific Computing Lab
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Numerical Analysis Lecture13.
Numerical Linear Algebra
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Home assignment #3 (1) (Total 3 problems) Due: 12 November 2018
Presentation transcript:

Introduction to Scientific Computing II From Gaussian Elimination to Multigrid – A Recapitulation Dr. Miriam Mehl

Tasks – SLE ???

Tasks – Molecular Dynamics

Prerequisites discretisation of PDEs linear algebra Gaussian elimination basics on iterative solvers Jacobi, Gauss-Seidel, SOR, MG matlab

Organization lecture (90 min/week) –theory –methods –simple examples tutorials (45 min/week) –more examples –make your own experiences

What Determines the Grading? written exam at the end of the semester no weighting of tutorials !!!! solving tutorials is essential !!!! -for understanding and remembering subjects -for your success in the exam

Materials slides (short, only headwords) exercise sheets  make your own lecture notes!  find your own solutions!  solutions presented in the tutorials

Rules for questions ask or fix a date per Dr. Miriam Mehl: Martin Buchholz:

Introduction to Scientific Computing II From Gaussian Elimination to Multigrid – A Recapitulation Dr. Miriam Mehl

What’s the Problem to be Solved? Finite Elements Finite Differences (Finite Volumes) Scientific Computing I Numerical Programming II Systems of linear equations Application Scenario Modelling Scientific Computing I Partial Differential Equations LU, Richardson, Jacobi, Gauss-Seidel, SOR, MG Scientific Computing I, Scientific Computing Lab, Numerical Programming I More on this!!!

two-dimensional Poisson equation  heat equation  diffusion  membranes  … Example Equation v v v v v v v v v v v v v v v grid + finite differences

Typical SLE sparse band structure

Example

Gaussian Elimination (LU)

Gaussian Elimination – Costs 2D: O(N 4 ) 3D: O(N 7 )

Gaussian Elimination – Costs 2D hallo hruntime (HLRB2, 62 TFlop/s) sec sec sec min 16 sec min 55 sec h 02 min 40 sec d 8 h 37 min 15 sec

Gaussian Elimination – Costs 3D hallo hruntime (HLRB2, 62 TFlop/s) min 44 sec h 05 min 24 sec d 19 h 21 min 17 sec a 313 d 21 h 54 min 22 sec

Iterative Solvers – Principle series of approximations  costs per iteration?  convergence?  stopping criterion?

Relaxation Methods problem: order an amount of peas on a straight line (corresponds to solving u xx =0)

Relaxation Methods – Gauss-Seidel sequentially place peas on the line between two neighbours

Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours Relaxation Methods – Gauss-Seidel

sequentially place peas on the line between two neighbours we get a smooth curve instead of a straight line  global error is locally (almost) invisible Relaxation Methods – Gauss-Seidel

Relaxation Methods problem: order an amount of peas on a straight line (corresponds to solving u xx =0)

Relaxation Methods – Jacobi place peas on the line between two neighbours in parallel

Relaxation Methods – Jacobi place peas on the line between two neighbours in parallel

Relaxation Methods – Jacobi place peas on the line between two neighbours in parallel

Relaxation Methods – Jacobi place peas on the line between two neighbours in parallel we get a high plus a low frequency oscillation  these fequencies are locally (almost) invisible

Relaxation Methods problem: order an amount of peas on a straight line (corresponds to solving u xx =0)

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR

sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours

Relaxation Methods – SOR sequentially correct location of peas a little more than to the line between two neighbours better than GS and J, but still not optimal

Relaxation Methods problem: order an amount of peas on a straight line (corresponds to solving u xx =0)

Relaxation Methods – Hierarchical place peas on the line between two neighbours in parallel, but in a hierarchical way from coarse to smooth

Relaxation Methods – Hierarchical place peas on the line between two neighbours in parallel, but in a hierarchical way from coarse to smooth

Relaxation Methods – Hierarchical place peas on the line between two neighbours in parallel, but in a hierarchical way from coarse to smooth

Relaxation Methods – Hierarchical place peas on the line between two neighbours in parallel, but in a hierarchical way from coarse to smooth exact solution in one step  unfortunately only in 1D, 2D and 3D: multigrid