Algorithms for Scientific Computing
|
|
- Alaina Payne
- 6 years ago
- Views:
Transcription
1 Algorithms for Scientific Computing Finite Element Methods Michael Bader Technical University of Munich Summer 2016
2 Part I Looking Back: Discrete Models for Heat Transfer and the Poisson Equation Modelling of Heat Transfer objective: compute the temperature distribution of some object under certain prerequisites: temperature T at object boundaries given heat sources material parameters k,... observation from physical experiments: q k δt (heat flow proportional to temperature differences) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
3 A Finite Volume Model object: a rectangular metal plate (again) model as a collection of small connected rectangular cells h y h x examine the heat flow across the cell edges Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
4 Heat Flow Across the Cell Boundaries Heat flow across a given edge is proportional to temperature difference (T 1 T 0 ) between the adjacent cells length h of the edge e.g.: heat flow across the left edge: q (left) ij = k x ( Tij T i 1,j ) hy k x depends on material heat flow across all edges determines change of heat energy: q ij = k x ( Tij T i 1,j ) hy + k x ( Tij T i+1,j ) hy + k y ( Tij T i,j 1 ) hx + k y ( Tij T i,j+1 ) hx equilibrium with source term F ij = f ij h x h y (f ij heat flow per area) requires q ij + F ij = 0: f ij h x h y = k x h y ( 2Tij T i 1,j T i+1,j ) k y h x ( 2Tij T i,j 1 T i,j+1 ) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
5 Discrete and Continuous Model system of equations derived from the discrete model: f ij = k x h x ( 2Tij T i 1,j T i+1,j ) k y h y ( 2Tij T i,j 1 T i,j+1 ) result: average temperature in each cell corresponds to partial differential equation (PDE): ( 2 ) T (x, y) k x T (x, y) y 2 = f (x, y) wanted: approximate T (x, y) as a function! solution possible using coefficients and basis functions? Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
6 Part II Outlook: Finite Element Methods For Model Problem: 2D Poisson equation: 2 T (x, y) x T (x, y) y 2 = f (x, y) first, however, we consider the 1D case: with u(0) = u(1) = 0. u (x) = f (x) for x (0, 1) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
7 Finite Elements Main Idea we consider the residual of the (1D) PDE: u (x) = f (x) u (x) f (x) = 0 represent the functions u and f in our favorite form: ( ) uj φ j (x) fj φ j (x) = 0 however: we will usually not find u j that solve this equation exactly (as solution u can not be represented as u j φ j (x)) remedy? find best approximation, given by orthogonality: ( w(x), uj φ j (x)) fj φ j (x) = 0 for all w(x) remember that < g, f >= g f dx Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
8 Finite Elements Main Ingredients 1. compute a function as numerical solution; search in a function space W h : u h = j u j ϕ j (x), span{ϕ 1,..., ϕ J } = W h 2. solve weak form of PDE to reduce regularity properties u = f v u dx = vf dx 3. choose basis functions with local support, e.g.: ϕ j (x i ) = δ ij (such as the hat functions) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
9 Choose Test and Ansatz Space search for solution functions u h of the form u h = j u j ϕ j (x) the basis ( shape, ansatz ) functions ϕ j (x) build a vector space (or function space) W h span{ϕ 1,..., ϕ J } = W h the best solution u h in this function space is wanted Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
10 Example: Nodal Basis 1 h (x x i 1) x i 1 < x < x i 1 ϕ i (x) := h (x i+1 x) x i < x < x i+1 0 otherwise 1 0,8 0,6 0,4 0, ,2 0,4 0,6 0,8 x Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
11 Or Better A Hierarchical Basis? Φ 1,1. x 1,1 Φ 2,1 Φ 2,3. x 2,1 x 2,3 Φ 3,1 Φ 3,3 Φ 3,5 Φ 3,7. x 3,1 x 3,3 x 3,5 x 3,7 Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
12 Weak Forms and Weak Solutions consider a PDE Lu = f (e.g. Lu = u) transformation to the weak form: v, Lu = vlu dx = vf dx = f, v v V V a certain class of functions real solution u also solves the weak form (but additional, approximate solutions accepted... ) motivation for weak form: we cannot test Lu(x) = f (x) for all x (0, 1) on a computer (infinitely many x) frequent choice V = W h, so check whether Lu and f have the same behaviour w.r.t. scalar product approximate solution û might not solve PDE: Lû f thus: additional functions need to be acceptable as solution orthogonality idea Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
13 Weak Form of the Poisson Equation 1D Poisson equation with Dirichlet conditions: u (x) = f (x) in Ω = (0, 1), u(0) = u(1) = 0 weak form: v(x)u (x) dx = v(x)f (x) dx Ω Ω integration by parts: Ω v(x)u (x) dx = v(x) u (x) choose functions v such that v(0) = v(1) = 0: v (x) u (x) dx = v(x)f (x) dx Ω Ω 1 0 v + v (x) u (x) dx Ω v Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
14 Weak Form of the Poisson Equation 2D/3D Poisson equation with Dirichlet conditions: weak form: apply Green s formula: v u dω = Ω u = f in Ω, u = 0 on δω v u dω = vf dω Ω Ω Ω v v u dω v u ds Ω choose functions v such that v = 0 on Ω: v u dω = vf dω Ω Ω v Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
15 Weak Form of the Poisson Equation Summary Poisson equation with Dirichlet conditions: u = f in Ω, u = 0 on δω transformed into weak form: v u dω = vf dω Ω Ω v weaker requirements for a solution u: twice differentiabale first derivative integrable remember use of nodal basis: availability of first vs. second derivative! Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
16 Choose Test and Ansatz Space search for solutions u h in a function space W h : u h = j u j ϕ j (x) where span{ϕ j } = W h ( ansatz space ) insert into weak solution ( ) vl u j ϕ j (x) dx = j vf dx v V Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
17 Choose Test and Ansatz Space (2) choose a basis {ψ i } of the test space V then: if all basis functions ψ i satisfy ( ) ψ i L u j ϕ j (x) dx = then all v V satisfy the equation j ψ i f dx ψ i leads to system of equations for unknowns u j (one equation per test basis function ψ i ) V is often chosen to be identical to W h (Ritz-Galerkin method) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
18 Discretisation Finite Elements L linear system of linear equations ( ) ψ i Lϕ j (x) dx u j = j } {{ } =:A ij ψ i f dx ψ i aim: make system of equations easy to solve! thus, make matrix A sparse most A ij = 0 approach: local basis functions on a discretisation grid consider hat functions, e.g.: ψ j, ϕ j zero everywhere, except in grid cells adjacent to grid point x j then A ij = 0, if ψ i and ϕ j don t overlap Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
19 Example Problem: Poisson 1D in 1D: u (x) = f (x) on Ω = (0, 1), hom. Dirichlet boundary cond.: u(0) = u(1) = 0 weak form: 1 v (x) u (x) dx = v(x)f (x) dx computational grid: x i = ih, (for i = 1,..., n 1); mesh size h = 1/n V = W : piecewise linear functions (on intervals [x i, x i+1 ]) v Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
20 Nodal Basis 1 h (x x i 1) x i 1 < x < x i 1 ϕ i (x) := h (x i+1 x) x i < x < x i+1 0 otherwise 1 0,8 0,6 0,4 0, ,2 0,4 0,6 0,8 x 1 Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
21 Nodal Basis System of Equations stiffness matrix: 1 h right hand sides (assume f (x) = α R): ϕ i (x)f (x) dx = ϕ i (x)α dx = αh system of equations very similar to finite differences Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
22 Hierarchical Basis 1 0,8 0,6 0,4 0, ,2 0,4 0,6 0,8 1 x leads to diagonal stiffness matrix! (for 1D Poisson) solution function identical to that with nodal basis (same function space) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
23 Part III Finite Element Methods Basis Functions for 2D Hierarchical Basis in 2D Quadtrees and Hierarchical Bases Quadtrees to Represent Objects Hierarchical Basis vs. Quadtree Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
24 2D Hierarchical Basis Tensor Product define 2D basis functions via tensor product: φ i,j (x, y) := φ i (x) φ j (y) remember multi-index for 2D hierarchical basis: φ l, k (x 1, x 2 ) := φ l1,l 2,k 1,k 2 (x 1, x 2 ) := φ l1,k 1 (x 1 ) φ l2,k 2 (x 2 ) illustrate via support of the basis functions: Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
25 Illustrate via Location of Hat Functions l 1 =1 l 1 =2 l 1 =3 l 1 l 2 =1 l 2 =2 l 2 =3 l 2 Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
26 Adding Adaptivity: Quadtrees Quadtrees to Represent Objects: start with an initial square (covering the entire domain) recursive substructuring into four subsquares adaptive refinement? Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
27 Quadtrees for Adaptive Simulations Adaptively Refined Meshes for Finite Elements: refine, unless squares entirely within or outside domain also: refine, if solution not exact enough! question: can we build a hierarchical basis on such a quadtree? Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
28 Hierarchical Basis vs. Quadtree Use hierarchical basis as in 2D sparse grids? stretched tensor basis functions do not match quadtree cells use basis functions with square domain (cover 4 siblings to solve) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
29 Hierarchical Basis for Quadtrees Switch to hierarchical multilevel basis: hierarchical concept (again): skip basis functions that exist on previous level! Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
30 Illustrate via Location of Hat Functions l 1 =1 l 1 =2 l 1 =3 l 1 l 2 =1 l 2 =2 l 2 =3 l 2 Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
31 Quadtree-Compatible Hierarchical Basis Basis Functions Similar to tensor-product basis: Level-wise hierarchical increments l 1 =1 l 1 =2 l 1 =3 l 1 W l := span{φ l, i } i Î l l 2 =1 Only use diagonal levels: l := {l,..., l} Omit grid points for which all indices are even: Î l := { i : 1 i < 2 n, any i j odd} l 2 =2 l 2 =3 l 2 Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
32 Part IV Finite Element Methods Towards Implementation FEM and Hierarchical Basis Transform Hierarchical Basis Transformation FEM and Hierarchical Basis Transform Element Stiffness Matrices Workflow Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
33 Project: 2D Adaptive Hierarchical Basis Consider: 2D Poisson problem FEM with quadtree-compatible hierarchical basis adaptive quadtree-based hierarchical basis Discuss (again): how to compute the stiffness matrix? what do you need to compute, if you add a hierarchical basis function? how do you know when to add a basis function? Idea: move from node-oriented to element-oriented approach Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
34 Recall: Hierarchical Basis Transformation 1 1 0,8 0,8 0,6 0,4 0,2 0,6 0,4 0, ,2 0,4 0,6 0,8 x ,2 0,4 0,6 0,8 x 1 represent wider hat function φ 1,1 (x) via basis functions φ 2,j (x) φ 1,1 (x) = 1 2 φ 2,1(x) + φ 2,2 (x) φ 2,3(x) consider vector of hierarchical/nodal basis functions and write transformation as matrix-vector product: ψ 2,1 (x) φ 2,1 (x) φ 2,1 (x) ψ 2,2 (x) := φ 1,1 (x) = φ 2 2,2 (x) ψ 2,3 (x) φ 2,3 (x) φ 2,3 (x) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
35 Recall: Hierarchical Basis Transformation (2) hierarchical basis transformation: ψ n,i (x) = j H i,j φ n,j (x) written as matrix-vector product: ψ n = H n φn H can be written as a sequence of level-wise transforms: H n = H (n 1) n H (n 2) n... H (2) n H (1) n where each transform has a shape similar to H (1) = Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
36 b j = i H i,j a i = i Recall: Hierarchical Coordinate Transformation consider function f (x) i a i ψ n,i (x) represented via hier. basis wanted: corresponding representation in nodal basis b j φ n,j (x) = a i ψ n,i (x) f (x) j i with ψ n,i (x) = H i,j φ n,j (x) we obtain j b j φ n,j (x) = j i compare coordinates and get a i H i,j φ n,j (x) = j j a i H i,j φ n,j (x) i ( H T ) j,i a i written in vector notation: b = H T a Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
37 FEM and Hierarchical Basis Transform FEM discretisation with hierarchical test and shape functions: ( ) ψ i (x)l u j ψ j (x) dx = ψ i (x)f (x) dx ψ i j leads to respective stiffness matrix A HB ( ) ψ i (x)l u j ψ j (x) dx = j j i,j : u j ψ i (x)lψ j (x) dx = j u j A HB i,j vs. stiffness matrix with nodal basis as shape functions: ( ) ψ i (x)l v j φ j (x) dx = v j ψ i (x)lφ j (x) dx = j j j v j A i,j note that (A HB u) i = j u ja HB i,j = j v ja i,j = (A v) i and v = H T u Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
38 FEM and Hierarchical Basis Transform (2) status: FEM with hierarchical test and nodal shape functions ( ) ψ i (x)l v j φ j (x) dx = ψ i (x)f (x) dx j represent test functions via nodal basis: ( ) H i,k φ k (x)l v j φ j (x) dx = H i,k φ k (x)f (x) dx k ( ) H i,k φ k (x)l v j φ j (x) dx = k j k j k H i,k leads to new system of equations: HA NB v = H b NB φ k (x)f (x) dx where A NB and b NB stem from nodal-basis FEM discretisation! with v = H T u we obtain H A NB H T u = H b as system of equations, thus: A HB = H A NB H T ( Galerkin coarsening) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
39 Element Stiffness Matrices domain Ω splitted into finite elements Ω (k) : Ω = Ω (1) Ω (2) Ω (n) observation: basis functions are defined element-wise use: b a f (x)dx = c a f (x)dx + b c f (x)dx element-wise evaluation of the integrals: v u dx = Ω k Ω vf dx = i v u dx Ω (k) vf dx Ω (i) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
40 Element Stiffness Matrices (2) leads to local stiffness matrices for each element: Ω (k) φ i φ j dx }{{} =:A (k) ij and respective element systems: A (k) x = b (k) accumulate to obtain global system: A (k) x = k k }{{} =:A b (k) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
41 Element Stiffness Matrices (3) Some comments on notation: assume: 1D problem, n elements (i.e. intervals) in each element only two basis functions are non-zero! hence, almost all A (k) ij are zero: A (k) ij = φ i φ j dx Ω (k) only 2 2 elements of A (k) are non-zero therefore convention to omit zero columns/rows leaves only unknowns that are in Ω (k) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
42 Typical workflow 1. choose elements: quadratic or cubic cells triangles (structured, unstructured) tetrahedra, etc. 2. set up basis functions for each element Ω (k) ; for example, at all nodes x i Ω (k) ϕ i (x i ) = 1 ϕ i (x j ) = 0 for all j i 3. for element stiffness matrix, compute all A (k) ij = ϕ i Lϕ j dω Ω (k) 4. accumulate global stiffness matrix Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
43 Example: 1D Poisson Ω = [0, 1] splitted into Ω (k) = [x k 1, x k ] nodal basis; leads to element stiffness matrix: ( ) A (k) 1 1 = 1 1 consider only two elements: A (1) + A (2) = in stencil notation: [ 1 1 ] + [ 1 1 ] [ ] Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
44 Project: Adaptive Hierarchical Basis Consider: 1D Poisson problem FEM with hierarchical basis however: not all basis functions used on each grid adaptive hierarchical basis Discuss: how to compute the stiffness matrix? what do you need to compute, if you add a hierarchical basis function? how do you know when to add a basis function? Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
45 Example: 2D Poisson u = f on domain Ω = [0, 1] 2 splitted into Ω (i,j) = [x i 1, x i ] [x j 1, x j ] bilinear basis functions pagoda functions ϕ ij (x, y) = ϕ i (x)ϕ j (y) Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
46 Example: 2D Poisson (2) leads to element stiffness matrix: A (k) = accumulation leads to 9-point stencil Michael Bader Algorithms for Scientific Computing Finite Element Methods Summer
Scientific Computing I
Scientific Computing I Module 8: An Introduction to Finite Element Methods Tobias Neckel Winter 2013/2014 Module 8: An Introduction to Finite Element Methods, Winter 2013/2014 1 Part I: Introduction to
More informationLehrstuhl Informatik V. Lehrstuhl Informatik V. 1. solve weak form of PDE to reduce regularity properties. Lehrstuhl Informatik V
Part I: Introduction to Finite Element Methods Scientific Computing I Module 8: An Introduction to Finite Element Methods Tobias Necel Winter 4/5 The Model Problem FEM Main Ingredients Wea Forms and Wea
More informationAlgorithms for Scientific Computing
Algorithms for Scientific Computing Hierarchical Methods and Sparse Grids d-dimensional Hierarchical Basis Michael Bader Technical University of Munich Summer 208 Intermezzo/ Big Picture : Archimedes Quadrature
More information1 Discretizing BVP with Finite Element Methods.
1 Discretizing BVP with Finite Element Methods In this section, we will discuss a process for solving boundary value problems numerically, the Finite Element Method (FEM) We note that such method is a
More informationNumerical methods for PDEs FEM convergence, error estimates, piecewise polynomials
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials Dr. Noemi Friedman Contents of the course Fundamentals
More informationA Hybrid Method for the Wave Equation. beilina
A Hybrid Method for the Wave Equation http://www.math.unibas.ch/ beilina 1 The mathematical model The model problem is the wave equation 2 u t 2 = (a 2 u) + f, x Ω R 3, t > 0, (1) u(x, 0) = 0, x Ω, (2)
More informationNumerical methods for PDEs FEM convergence, error estimates, piecewise polynomials
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials Dr. Noemi Friedman Contents of the course Fundamentals
More informationA very short introduction to the Finite Element Method
A very short introduction to the Finite Element Method Till Mathis Wagner Technical University of Munich JASS 2004, St Petersburg May 4, 2004 1 Introduction This is a short introduction to the finite element
More informationPart I. Discrete Models. Part I: Discrete Models. Scientific Computing I. Motivation: Heat Transfer. A Wiremesh Model (2) A Wiremesh Model
Part I: iscrete Models Scientific Computing I Module 5: Heat Transfer iscrete and Continuous Models Tobias Neckel Winter 04/05 Motivation: Heat Transfer Wiremesh Model A Finite Volume Model Time ependent
More informationThe Finite Element Method for the Wave Equation
The Finite Element Method for the Wave Equation 1 The Wave Equation We consider the scalar wave equation modelling acoustic wave propagation in a bounded domain 3, with boundary Γ : 1 2 u c(x) 2 u 0, in
More informationChapter 1: The Finite Element Method
Chapter 1: The Finite Element Method Michael Hanke Read: Strang, p 428 436 A Model Problem Mathematical Models, Analysis and Simulation, Part Applications: u = fx), < x < 1 u) = u1) = D) axial deformation
More informationFinite Element Methods
Solving Operator Equations Via Minimization We start with several definitions. Definition. Let V be an inner product space. A linear operator L: D V V is said to be positive definite if v, Lv > for every
More informationA brief introduction to finite element methods
CHAPTER A brief introduction to finite element methods 1. Two-point boundary value problem and the variational formulation 1.1. The model problem. Consider the two-point boundary value problem: Given a
More informationAMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends
AMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends Lecture 3: Finite Elements in 2-D Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Finite Element Methods 1 / 18 Outline 1 Boundary
More informationNumerical Solution I
Numerical Solution I Stationary Flow R. Kornhuber (FU Berlin) Summerschool Modelling of mass and energy transport in porous media with practical applications October 8-12, 2018 Schedule Classical Solutions
More informationFINITE ELEMENT METHOD: APPROXIMATE SOLUTIONS
FINITE ELEMENT METHOD: APPROXIMATE SOLUTIONS I Introduction: Most engineering problems which are expressed in a differential form can only be solved in an approximate manner due to their complexity. The
More informationMultilevel stochastic collocations with dimensionality reduction
Multilevel stochastic collocations with dimensionality reduction Ionut Farcas TUM, Chair of Scientific Computing in Computer Science (I5) 27.01.2017 Outline 1 Motivation 2 Theoretical background Uncertainty
More informationAlgorithms for Scientific Computing
Algorithms for Scientific Computing Parallelization using Space-Filling Curves Michael Bader Technical University of Munich Summer 2016 Parallelisation using Space-filling Curves Problem setting: mesh
More informationCIV-E1060 Engineering Computation and Simulation Examination, December 12, 2017 / Niiranen
CIV-E16 Engineering Computation and Simulation Examination, December 12, 217 / Niiranen This examination consists of 3 problems rated by the standard scale 1...6. Problem 1 Let us consider a long and tall
More information[2] (a) Develop and describe the piecewise linear Galerkin finite element approximation of,
269 C, Vese Practice problems [1] Write the differential equation u + u = f(x, y), (x, y) Ω u = 1 (x, y) Ω 1 n + u = x (x, y) Ω 2, Ω = {(x, y) x 2 + y 2 < 1}, Ω 1 = {(x, y) x 2 + y 2 = 1, x 0}, Ω 2 = {(x,
More informationChapter 6. Finite Element Method. Literature: (tiny selection from an enormous number of publications)
Chapter 6 Finite Element Method Literature: (tiny selection from an enormous number of publications) K.J. Bathe, Finite Element procedures, 2nd edition, Pearson 2014 (1043 pages, comprehensive). Available
More informationWRT in 2D: Poisson Example
WRT in 2D: Poisson Example Consider 2 u f on [, L x [, L y with u. WRT: For all v X N, find u X N a(v, u) such that v u dv v f dv. Follows from strong form plus integration by parts: ( ) 2 u v + 2 u dx
More informationSimple Examples on Rectangular Domains
84 Chapter 5 Simple Examples on Rectangular Domains In this chapter we consider simple elliptic boundary value problems in rectangular domains in R 2 or R 3 ; our prototype example is the Poisson equation
More informationAdaptive Finite Element Methods Lecture Notes Winter Term 2017/18. R. Verfürth. Fakultät für Mathematik, Ruhr-Universität Bochum
Adaptive Finite Element Methods Lecture Notes Winter Term 2017/18 R. Verfürth Fakultät für Mathematik, Ruhr-Universität Bochum Contents Chapter I. Introduction 7 I.1. Motivation 7 I.2. Sobolev and finite
More informationIntroduction to Finite Element Method
Introduction to Finite Element Method Dr. Rakesh K Kapania Aerospace and Ocean Engineering Department Virginia Polytechnic Institute and State University, Blacksburg, VA AOE 524, Vehicle Structures Summer,
More informationMultigrid finite element methods on semi-structured triangular grids
XXI Congreso de Ecuaciones Diferenciales y Aplicaciones XI Congreso de Matemática Aplicada Ciudad Real, -5 septiembre 009 (pp. 8) Multigrid finite element methods on semi-structured triangular grids F.J.
More informationSOLVING ELLIPTIC PDES
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
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More informationFinite Elements. Colin Cotter. February 22, Colin Cotter FEM
Finite Elements February 22, 2019 In the previous sections, we introduced the concept of finite element spaces, which contain certain functions defined on a domain. Finite element spaces are examples of
More informationScientific Computing: Numerical Integration
Scientific Computing: Numerical Integration Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Fall 2015 Nov 5th, 2015 A. Donev (Courant Institute) Lecture
More informationIntroduction to PDEs and Numerical Methods Lecture 7. Solving linear systems
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Introduction to PDEs and Numerical Methods Lecture 7. Solving linear systems Dr. Noemi Friedman, 09.2.205. Reminder: Instationary heat
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Numerical Methods for Partial Differential Equations Finite Difference Methods
More informationPDEs, part 1: Introduction and elliptic PDEs
PDEs, part 1: Introduction and elliptic PDEs Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2013 Partial di erential equations The solution depends on several variables,
More informationOptimal multilevel preconditioning of strongly anisotropic problems.part II: non-conforming FEM. p. 1/36
Optimal multilevel preconditioning of strongly anisotropic problems. Part II: non-conforming FEM. Svetozar Margenov margenov@parallel.bas.bg Institute for Parallel Processing, Bulgarian Academy of Sciences,
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Variational Problems of the Dirichlet BVP of the Poisson Equation 1 For the homogeneous
More informationLecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.
Lecture 9 Approximations of Laplace s Equation, Finite Element Method Mathématiques appliquées (MATH54-1) B. Dewals, C. Geuzaine V1.2 23/11/218 1 Learning objectives of this lecture Apply the finite difference
More informationParallel Discontinuous Galerkin Method
Parallel Discontinuous Galerkin Method Yin Ki, NG The Chinese University of Hong Kong Aug 5, 2015 Mentors: Dr. Ohannes Karakashian, Dr. Kwai Wong Overview Project Goal Implement parallelization on Discontinuous
More informationIntroduction. J.M. Burgers Center Graduate Course CFD I January Least-Squares Spectral Element Methods
Introduction In this workshop we will introduce you to the least-squares spectral element method. As you can see from the lecture notes, this method is a combination of the weak formulation derived from
More informationNumerical Methods for Partial Differential Equations
Numerical Methods for Partial Differential Equations Eric de Sturler University of Illinois at Urbana-Champaign Read section 8. to see where equations of type (au x ) x = f show up and their (exact) solution
More information1. Let a(x) > 0, and assume that u and u h are the solutions of the Dirichlet problem:
Mathematics Chalmers & GU TMA37/MMG800: Partial Differential Equations, 011 08 4; kl 8.30-13.30. Telephone: Ida Säfström: 0703-088304 Calculators, formula notes and other subject related material are not
More informationFinite Elements. Colin Cotter. January 15, Colin Cotter FEM
Finite Elements January 15, 2018 Why Can solve PDEs on complicated domains. Have flexibility to increase order of accuracy and match the numerics to the physics. has an elegant mathematical formulation
More informationA simple FEM solver and its data parallelism
A simple FEM solver and its data parallelism Gundolf Haase Institute for Mathematics and Scientific Computing University of Graz, Austria Chile, Jan. 2015 Partial differential equation Considered Problem
More informationChapter 3 Conforming Finite Element Methods 3.1 Foundations Ritz-Galerkin Method
Chapter 3 Conforming Finite Element Methods 3.1 Foundations 3.1.1 Ritz-Galerkin Method Let V be a Hilbert space, a(, ) : V V lr a bounded, V-elliptic bilinear form and l : V lr a bounded linear functional.
More informationGeneral elastic beam with an elastic foundation
General elastic beam with an elastic foundation Figure 1 shows a beam-column on an elastic foundation. The beam is connected to a continuous series of foundation springs. The other end of the foundation
More informationAlgebraic flux correction and its application to convection-dominated flow. Matthias Möller
Algebraic flux correction and its application to convection-dominated flow Matthias Möller matthias.moeller@math.uni-dortmund.de Institute of Applied Mathematics (LS III) University of Dortmund, Germany
More informationXingye Yue. Soochow University, Suzhou, China.
Relations between the multiscale methods p. 1/30 Relationships beteween multiscale methods for elliptic homogenization problems Xingye Yue Soochow University, Suzhou, China xyyue@suda.edu.cn Relations
More informationA note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations
A note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations S. Hussain, F. Schieweck, S. Turek Abstract In this note, we extend our recent work for
More informationContents. Prologue Introduction. Classical Approximation... 19
Contents Prologue........................................................................ 15 1 Introduction. Classical Approximation.................................. 19 1.1 Introduction................................................................
More informationSuboptimal feedback control of PDEs by solving Hamilton-Jacobi Bellman equations on sparse grids
Suboptimal feedback control of PDEs by solving Hamilton-Jacobi Bellman equations on sparse grids Jochen Garcke joint work with Axel Kröner, INRIA Saclay and CMAP, Ecole Polytechnique Ilja Kalmykov, Universität
More informationNumerical Analysis Comprehensive Exam Questions
Numerical Analysis Comprehensive Exam Questions 1. Let f(x) = (x α) m g(x) where m is an integer and g(x) C (R), g(α). Write down the Newton s method for finding the root α of f(x), and study the order
More informationAxioms of Adaptivity (AoA) in Lecture 3 (sufficient for optimal convergence rates)
Axioms of Adaptivity (AoA) in Lecture 3 (sufficient for optimal convergence rates) Carsten Carstensen Humboldt-Universität zu Berlin 2018 International Graduate Summer School on Frontiers of Applied and
More informationA Fast Fourier transform based direct solver for the Helmholtz problem. AANMPDE 2017 Palaiochora, Crete, Oct 2, 2017
A Fast Fourier transform based direct solver for the Helmholtz problem Jari Toivanen Monika Wolfmayr AANMPDE 2017 Palaiochora, Crete, Oct 2, 2017 Content 1 Model problem 2 Discretization 3 Fast solver
More informationIterative Methods for Linear Systems
Iterative Methods for Linear Systems 1. Introduction: Direct solvers versus iterative solvers In many applications we have to solve a linear system Ax = b with A R n n and b R n given. If n is large the
More informationEfficient Algorithms for Solving the Black-Scholes Equation on Dimensionally Adaptive Sparse Grids
FAKULTÄT FÜR INFORMATIK DER TECHNISCHEN UNIVERSITÄT MÜNCHEN Bachelorarbeit in Informatik Efficient Algorithms for Solving the Black-Scholes Equation on Dimensionally Adaptive Sparse Grids Matthias Fischer
More informationBoundary Value Problems and Iterative Methods for Linear Systems
Boundary Value Problems and Iterative Methods for Linear Systems 1. Equilibrium Problems 1.1. Abstract setting We want to find a displacement u V. Here V is a complete vector space with a norm v V. In
More informationThe Spectral-Element Method: Introduction
The Spectral-Element Method: Introduction Heiner Igel Department of Earth and Environmental Sciences Ludwig-Maximilians-University Munich Computational Seismology 1 / 59 Outline 1 Introduction 2 Lagrange
More informationConservation Laws & Applications
Rocky Mountain Mathematics Consortium Summer School Conservation Laws & Applications Lecture V: Discontinuous Galerkin Methods James A. Rossmanith Department of Mathematics University of Wisconsin Madison
More informationUsing MATLAB and. Abaqus. Finite Element Analysis. Introduction to. Amar Khennane. Taylor & Francis Croup. Taylor & Francis Croup,
Introduction to Finite Element Analysis Using MATLAB and Abaqus Amar Khennane Taylor & Francis Croup Boca Raton London New York CRC Press is an imprint of the Taylor & Francis Croup, an informa business
More informationQuintic beam closed form matrices (revised 2/21, 2/23/12) General elastic beam with an elastic foundation
General elastic beam with an elastic foundation Figure 1 shows a beam-column on an elastic foundation. The beam is connected to a continuous series of foundation springs. The other end of the foundation
More informationFEniCS Course. Lecture 0: Introduction to FEM. Contributors Anders Logg, Kent-Andre Mardal
FEniCS Course Lecture 0: Introduction to FEM Contributors Anders Logg, Kent-Andre Mardal 1 / 46 What is FEM? The finite element method is a framework and a recipe for discretization of mathematical problems
More informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
More informationOverlapping Schwarz preconditioners for Fekete spectral elements
Overlapping Schwarz preconditioners for Fekete spectral elements R. Pasquetti 1, L. F. Pavarino 2, F. Rapetti 1, and E. Zampieri 2 1 Laboratoire J.-A. Dieudonné, CNRS & Université de Nice et Sophia-Antipolis,
More informationHigher-Order Compact Finite Element Method
Higher-Order Compact Finite Element Method Major Qualifying Project Advisor: Professor Marcus Sarkis Amorn Chokchaisiripakdee Worcester Polytechnic Institute Abstract The Finite Element Method (FEM) is
More informationSolution of Non-Homogeneous Dirichlet Problems with FEM
Master Thesis Solution of Non-Homogeneous Dirichlet Problems with FEM Francesco Züger Institut für Mathematik Written under the supervision of Prof. Dr. Stefan Sauter and Dr. Alexander Veit August 27,
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Discretization of Boundary Conditions Discretization of Boundary Conditions On
More informationFast Sparse Spectral Methods for Higher Dimensional PDEs
Fast Sparse Spectral Methods for Higher Dimensional PDEs Jie Shen Purdue University Collaborators: Li-Lian Wang, Haijun Yu and Alexander Alekseenko Research supported by AFOSR and NSF ICERM workshop, June
More informationNumerical Methods for Partial Differential Equations
Numerical Methods for Partial Differential Equations Steffen Börm Compiled July 12, 2018, 12:01 All rights reserved. Contents 1. Introduction 5 2. Finite difference methods 7 2.1. Potential equation.............................
More informationMultilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses
Multilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses P. Boyanova 1, I. Georgiev 34, S. Margenov, L. Zikatanov 5 1 Uppsala University, Box 337, 751 05 Uppsala,
More informationFinite-Elements Method 2
Finite-Elements Method 2 January 29, 2014 2 From Applied Numerical Analysis Gerald-Wheatley (2004), Chapter 9. Finite-Elements Method 3 Introduction Finite-element methods (FEM) are based on some mathematical
More informationApplied/Numerical Analysis Qualifying Exam
Applied/Numerical Analysis Qualifying Exam August 9, 212 Cover Sheet Applied Analysis Part Policy on misprints: The qualifying exam committee tries to proofread exams as carefully as possible. Nevertheless,
More information2. The Schrödinger equation for one-particle problems. 5. Atoms and the periodic table of chemical elements
1 Historical introduction The Schrödinger equation for one-particle problems 3 Mathematical tools for quantum chemistry 4 The postulates of quantum mechanics 5 Atoms and the periodic table of chemical
More informationCOMPUTATIONAL MODELING OF SHAPE MEMORY MATERIALS
COMPUTATIONAL MODELING OF SHAPE MEMORY MATERIALS Jan Valdman Institute of Information Theory and Automation, Czech Academy of Sciences (Prague) based on joint works with Martin Kružík and Miroslav Frost
More informationDo Finite Volume Methods Need a Mesh?
Do Finite Volume Methods Need a Mesh? Michael Junk Fachbereich Mathematik, Universität Kaiserslautern, 67663 Kaiserslautern, Germany Abstract. In this article, finite volume discretizations of hyperbolic
More information1. Fast Iterative Solvers of SLE
1. Fast Iterative Solvers of crucial drawback of solvers discussed so far: they become slower if we discretize more accurate! now: look for possible remedies relaxation: explicit application of the multigrid
More informationWeighted Residual Methods
Weighted Residual Methods Introductory Course on Multiphysics Modelling TOMASZ G. ZIELIŃSKI bluebox.ippt.pan.pl/ tzielins/ Institute of Fundamental Technological Research of the Polish Academy of Sciences
More informationWeighted Residual Methods
Weighted Residual Methods Introductory Course on Multiphysics Modelling TOMASZ G. ZIELIŃSKI bluebox.ippt.pan.pl/ tzielins/ Table of Contents Problem definition. oundary-value Problem..................
More informationQuestion 9: PDEs Given the function f(x, y), consider the problem: = f(x, y) 2 y2 for 0 < x < 1 and 0 < x < 1. x 2 u. u(x, 0) = u(x, 1) = 0 for 0 x 1
Question 9: PDEs Given the function f(x, y), consider the problem: 2 u x 2 u = f(x, y) 2 y2 for 0 < x < 1 and 0 < x < 1 u(x, 0) = u(x, 1) = 0 for 0 x 1 u(0, y) = u(1, y) = 0 for 0 y 1. a. Discuss how you
More informationAn Introduction to Algebraic Multigrid (AMG) Algorithms Derrick Cerwinsky and Craig C. Douglas 1/84
An Introduction to Algebraic Multigrid (AMG) Algorithms Derrick Cerwinsky and Craig C. Douglas 1/84 Introduction Almost all numerical methods for solving PDEs will at some point be reduced to solving A
More informationThe Discontinuous Galerkin Finite Element Method
The Discontinuous Galerkin Finite Element Method Michael A. Saum msaum@math.utk.edu Department of Mathematics University of Tennessee, Knoxville The Discontinuous Galerkin Finite Element Method p.1/41
More informationINTRODUCTION TO MULTIGRID METHODS
INTRODUCTION TO MULTIGRID METHODS LONG CHEN 1. ALGEBRAIC EQUATION OF TWO POINT BOUNDARY VALUE PROBLEM We consider the discretization of Poisson equation in one dimension: (1) u = f, x (0, 1) u(0) = u(1)
More informationFINITE VOLUME METHOD: BASIC PRINCIPLES AND EXAMPLES
FINITE VOLUME METHOD: BASIC PRINCIPLES AND EXAMPLES SHRUTI JAIN B.Tech III Year, Electronics and Communication IIT Roorkee Tutors: Professor G. Biswas Professor S. Chakraborty ACKNOWLEDGMENTS I would like
More informationBACKGROUNDS. Two Models of Deformable Body. Distinct Element Method (DEM)
BACKGROUNDS Two Models of Deformable Body continuum rigid-body spring deformation expressed in terms of field variables assembly of rigid-bodies connected by spring Distinct Element Method (DEM) simple
More information4. Numerical Quadrature. Where analytical abilities end... continued
4. Numerical Quadrature Where analytical abilities end... continued Where analytical abilities end... continued, November 30, 22 1 4.3. Extrapolation Increasing the Order Using Linear Combinations Once
More informationAn additive average Schwarz method for the plate bending problem
J. Numer. Math., Vol. 10, No. 2, pp. 109 125 (2002) c VSP 2002 Prepared using jnm.sty [Version: 02.02.2002 v1.2] An additive average Schwarz method for the plate bending problem X. Feng and T. Rahman Abstract
More informationSolving an Elliptic PDE Eigenvalue Problem via Automated Multi-Level Substructuring and Hierarchical Matrices
Solving an Elliptic PDE Eigenvalue Problem via Automated Multi-Level Substructuring and Hierarchical Matrices Peter Gerds and Lars Grasedyck Bericht Nr. 30 März 2014 Key words: automated multi-level substructuring,
More informationWeak form of Boundary Value Problems. Simulation Methods in Acoustics
Weak form of Boundary Value Problems Simulation Methods in Acoustics Note on finite dimensional description of functions Approximation: N f (x) ˆf (x) = q j φ j (x) j=1 Residual function: r(x) = f (x)
More informationScientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1
Scientific Computing WS 2018/2019 Lecture 15 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 15 Slide 1 Lecture 15 Slide 2 Problems with strong formulation Writing the PDE with divergence and gradient
More informationAMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends
AMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends Lecture 25: Introduction to Discontinuous Galerkin Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Finite Element Methods
More informationFEM Convergence for PDEs with Point Sources in 2-D and 3-D
FEM Convergence for PDEs with Point Sources in 2-D and 3-D Kourosh M. Kalayeh 1, Jonathan S. Graf 2 Matthias K. Gobbert 2 1 Department of Mechanical Engineering 2 Department of Mathematics and Statistics
More informationApplied Numerical Analysis Quiz #2
Applied Numerical Analysis Quiz #2 Modules 3 and 4 Name: Student number: DO NOT OPEN UNTIL ASKED Instructions: Make sure you have a machine-readable answer form. Write your name and student number in the
More informationBlock-Structured Adaptive Mesh Refinement
Block-Structured Adaptive Mesh Refinement Lecture 2 Incompressible Navier-Stokes Equations Fractional Step Scheme 1-D AMR for classical PDE s hyperbolic elliptic parabolic Accuracy considerations Bell
More informationarxiv: v5 [math.na] 1 Sep 2018
High-Order Adaptive Extended Stencil FEM (AES-FEM) Part I: Convergence and Superconvergence Xiangmin Jiao Rebecca Conley Tristan J. Delaney arxiv:1603.09325v5 [math.na] 1 Sep 2018 Abstract Finite elements
More informationAlgebraic multigrid and multilevel methods A general introduction. Outline. Algebraic methods: field of application
Algebraic multigrid and multilevel methods A general introduction Yvan Notay ynotay@ulbacbe Université Libre de Bruxelles Service de Métrologie Nucléaire May 2, 25, Leuven Supported by the Fonds National
More informationBoundary Value Problems - Solving 3-D Finite-Difference problems Jacob White
Introduction to Simulation - Lecture 2 Boundary Value Problems - Solving 3-D Finite-Difference problems Jacob White Thanks to Deepak Ramaswamy, Michal Rewienski, and Karen Veroy Outline Reminder about
More informationSection 12.6: Non-homogeneous Problems
Section 12.6: Non-homogeneous Problems 1 Introduction Up to this point all the problems we have considered are we what we call homogeneous problems. This means that for an interval < x < l the problems
More informationFINITE DIFFERENCE METHODS (II): 1D EXAMPLES IN MATLAB
1.723 - COMPUTATIONAL METHODS FOR FLOW IN POROUS MEDIA Spring 2009 FINITE DIFFERENCE METHODS (II): 1D EXAMPLES IN MATLAB Luis Cueto-Felgueroso 1. COMPUTING FINITE DIFFERENCE WEIGHTS The function fdcoefs
More informationDomain Decomposition Preconditioners for Spectral Nédélec Elements in Two and Three Dimensions
Domain Decomposition Preconditioners for Spectral Nédélec Elements in Two and Three Dimensions Bernhard Hientzsch Courant Institute of Mathematical Sciences, New York University, 51 Mercer Street, New
More informationTime-dependent variational forms
Time-dependent variational forms Hans Petter Langtangen 1,2 1 Center for Biomedical Computing, Simula Research Laboratory 2 Department of Informatics, University of Oslo Oct 30, 2015 PRELIMINARY VERSION
More informationBasic Principles of Weak Galerkin Finite Element Methods for PDEs
Basic Principles of Weak Galerkin Finite Element Methods for PDEs Junping Wang Computational Mathematics Division of Mathematical Sciences National Science Foundation Arlington, VA 22230 Polytopal Element
More informationPoisson Equation in 2D
A Parallel Strategy Department of Mathematics and Statistics McMaster University March 31, 2010 Outline Introduction 1 Introduction Motivation Discretization Iterative Methods 2 Additive Schwarz Method
More information