SOLVING ELLIPTIC PDES

Similar documents
Computation Fluid Dynamics

Finite Elements. Colin Cotter. January 15, Colin Cotter FEM

A very short introduction to the Finite Element Method

Introduction to PDEs and Numerical Methods: Exam 1

AMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends

Motivation: Sparse matrices and numerical PDE's

Numerical Methods for Partial Differential Equations CAAM 452. Spring 2005

Finite Difference Methods (FDMs) 1

Introduction to PDEs and Numerical Methods Tutorial 5. Finite difference methods equilibrium equation and iterative solvers

Review Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester

Numerical Analysis of Differential Equations Numerical Solution of Elliptic Boundary Value

Scientific Computing: An Introductory Survey

A simple FEM solver and its data parallelism

Code: 101MAT4 101MT4B. Today s topics Finite-difference method in 2D. Poisson equation Wave equation

Finite Difference Method for PDE. Y V S S Sanyasiraju Professor, Department of Mathematics IIT Madras, Chennai 36

Explicit Jump Immersed Interface Method: Documentation for 2D Poisson Code

Monte Carlo Method for Finding the Solution of Dirichlet Partial Differential Equations

Boundary value problems on triangular domains and MKSOR methods

Scientific Computing I

Numerical Solution I

Lehrstuhl Informatik V. Lehrstuhl Informatik V. 1. solve weak form of PDE to reduce regularity properties. Lehrstuhl Informatik V

Boundary regularity of solutions of degenerate elliptic equations without boundary conditions

AMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends

Finite Difference Methods for Boundary Value Problems

Algorithms for Scientific Computing

Introduction to Computational Fluid Dynamics

Introduction to PDEs and Numerical Methods Lecture 7. Solving linear systems

Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials

Finite Difference Methods (FDMs) 2

Nonparametric density estimation for elliptic problems with random perturbations

Numerical Solutions to PDE s

Numerical solution of the 2-D Poisson equation on an irregular domain with Robin boundary conditions

A Hybrid Method for the Wave Equation. beilina

1. Fast Iterative Solvers of SLE

Module 7: The Laplace Equation

INTRODUCTION TO PDEs

Generating Equidistributed Meshes in 2D via Domain Decomposition

Sparse Linear Systems. Iterative Methods for Sparse Linear Systems. Motivation for Studying Sparse Linear Systems. Partial Differential Equations

Basic Aspects of Discretization

Module 3: BASICS OF CFD. Part A: Finite Difference Methods

Numerical Analysis and Methods for PDE I

Numerical Solution Techniques in Mechanical and Aerospace Engineering

Part I. Discrete Models. Part I: Discrete Models. Scientific Computing I. Motivation: Heat Transfer. A Wiremesh Model (2) A Wiremesh Model

9. Iterative Methods for Large Linear Systems

Lecture Introduction

Solving a non-linear partial differential equation for the simulation of tumour oxygenation

M.Sc. in Meteorology. Numerical Weather Prediction

Block-Structured Adaptive Mesh Refinement

BETI for acoustic and electromagnetic scattering

Inexact Algorithms in Function Space and Adaptivity

ME Computational Fluid Mechanics Lecture 5

1 Discretizing BVP with Finite Element Methods.

Index. higher order methods, 52 nonlinear, 36 with variable coefficients, 34 Burgers equation, 234 BVP, see boundary value problems

Solving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners

Altered Jacobian Newton Iterative Method for Nonlinear Elliptic Problems

Linear Algebra and Dirac Notation, Pt. 1

Linear Systems of Equations. ChEn 2450

Partial Differential Equations

Numerical Algorithms for Visual Computing II 2010/11 Example Solutions for Assignment 6

Lecture 8: Boundary Integral Equations

Lecture Notes for LG s Diff. Analysis

Partial Differential Equations II

Multigrid Methods and their application in CFD

Multi-Factor Finite Differences

Lecture 18 Classical Iterative Methods

UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH

Computational Fluid Dynamics

Optimal Interface Conditions for an Arbitrary Decomposition into Subdomains

Introduction to Mathematical Modelling: Ordinary Differential Equations and Heat Equations

Lecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.

Partial Differential Equations

Aspects of Multigrid

Numerical Solutions to Partial Differential Equations

Table of Contents. II. PDE classification II.1. Motivation and Examples. II.2. Classification. II.3. Well-posedness according to Hadamard

From Direct to Iterative Substructuring: some Parallel Experiences in 2 and 3D

HIGH ACCURACY NUMERICAL METHODS FOR THE SOLUTION OF NON-LINEAR BOUNDARY VALUE PROBLEMS

Compact Local Stencils Employed With Integrated RBFs For Fourth-Order Differential Problems

ADI iterations for. general elliptic problems. John Strain Mathematics Department UC Berkeley July 2013

Poisson Equation in 2D

6. Multigrid & Krylov Methods. June 1, 2010

FEM Convergence for PDEs with Point Sources in 2-D and 3-D

1 Comparison of Kansa s method versus Method of Fundamental Solution (MFS) and Dual Reciprocity Method of Fundamental Solution (MFS- DRM)

Solving PDEs with Multigrid Methods p.1

Multigrid absolute value preconditioning

Practical in Numerical Astronomy, SS 2012 LECTURE 9

Lecture Notes on Numerical Methods for Partial Differential Equations

Equations Introduction

Gradient Descent and Implementation Solving the Euler-Lagrange Equations in Practice

Butcher tableau Can summarize an s + 1 stage Runge Kutta method using a triangular grid of coefficients

Finite Elements. Colin Cotter. February 22, Colin Cotter FEM

OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative methods ffl Krylov subspace methods ffl Preconditioning techniques: Iterative methods ILU

ADDITIVE SCHWARZ FOR SCHUR COMPLEMENT 305 the parallel implementation of both preconditioners on distributed memory platforms, and compare their perfo

Chapter 6. Finite Element Method. Literature: (tiny selection from an enormous number of publications)

Weighted Residual Methods

Reconstructing inclusions from Electrostatic Data

SOE3213/4: CFD Lecture 3

Consider the following example of a linear system:

Capacitance Matrix Method

On the efficient exploitation of sparsity

Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials

Transcription:

university-logo SOLVING ELLIPTIC PDES School of Mathematics Semester 1 2008

OUTLINE 1 REVIEW 2 POISSON S EQUATION Equation and Boundary Conditions Solving the Model Problem 3 THE LINEAR ALGEBRA PROBLEM Expressing the problem as a matrix equation The Linear System 4 SUMMARY

university-logo DIFFERENCING We need to know that a scheme is stable for it to be convergent Use stencils to generate difference formula for derivatives Change the centering of the approximation: to increase stability or the order of the scheme See notes for more differencing formulas

POISSON S EQUATION Equation and Boundary Conditions Solving the Model Problem A prototype elliptic pde is Poisson s equation given by 2 φ x 2 + 2 φ = f (x, y), y2 where f (x, y) is a known/given function The equation has to be solved in a domain D

DOMAIN OF THE PROBLEM Equation and Boundary Conditions Solving the Model Problem Boundary conditions are given on the boundary D of D. y dd D x

BOUNDARY CONDITIONS Equation and Boundary Conditions Solving the Model Problem These can be of three types: Dirichlet φ = g(x, y) on D. = g(x, y) on D. ( ) Robin/Mixed B = 0 on D. Neumann φ n φ, φ n Robin boundary conditions involve a linear combination of φ and its normal derivative on the boundary. Mixed boundary conditions involve different conditions for one part of the boundary, and another type for other parts of the boundary.

THE MODEL PROBLEM Equation and Boundary Conditions Solving the Model Problem Consider the problem 2 φ x 2 + 2 φ = f (x, y), 0 x, y 1 y2 with boundary conditions φ = 0 on D. Here the domain D is the square region 0 < x < 1 and 0 < y < 1.

DISCRETISING THE PROBLEM Equation and Boundary Conditions Solving the Model Problem Construct a finite difference mesh with points (x i, y j ), where x i = i x, for i = 0, 1,...,N, and y j = j y, for j = 0, 1,...M. Here x = 1/N, and y = 1/M are the step sizes in the x and y directions.

DISCRETISING THE PROBLEM Equation and Boundary Conditions Solving the Model Problem Next replace the derivatives in Poisson equation by the discrete approximations to get: w i+1,j 2w i,j + w i 1,j x 2 + w i,j+1 2w i,j + w i,j 1 y 2 = f i,j, for 1 i N 1, and 1 j M 1. At the boundary we have the equations w i,j = 0, if i = 0, N and 0 j M w i,j = 0, if j = 1, M and 0 i N The result is a system of (N 1) (M 1) equations with (N 1) (M 1) unknowns, The unknowns are w i,j in the region D. university-logo

THE SOLUTION AS A VECTOR Expressing the problem as a matrix equation The Linear System Let us write the solution w i,j as w i = (w i,1, w i,2,...,w i,m 1 ) T and also the right hand side of the equation as f i = (f i,1, f i,2,...,f i,m 1 ) T Then we can use this notation to write the problem in matrix form.

THE MATRIX EQUATION Expressing the problem as a matrix equation The Linear System B I I B I I B I I B w 1 w 2 w 3 w N 1 = x 2 f 1 f 2 f 3 f N 1

Expressing the problem as a matrix equation The Linear System In the above I is the (M 1) (M 1) identity matrix The matrix B is given by B = b c a b c a b c...... where a = c = β 2, and b = 2(1 + β 2 ) β = x y a b

THE LINEAR SYSTEM Expressing the problem as a matrix equation The Linear System Then let us write the linear system as Aw = f We observe that the matrix A is very sparse. The matrix A is very large.

SOLVING THE LINEAR SYSTEM Expressing the problem as a matrix equation The Linear System In the next lecture we look into how to solve the problem. Methods can generally be split into: Direct Methods: Expensive, requiring large storage. Iterative Methods: Method of choice in most cases.

university-logo We have shown how to discretise a model elliptic problem. The discretised equations can be expressed as the matrix equation. Aw = f Help us think about methods in an abstract way. The matrix form will allow us to analyse the stability and convergence of schemes.