An introduction to the mathematical theory of finite elements

Similar documents
WELL POSEDNESS OF PROBLEMS I

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

Chapter 1 Foundations of Elliptic Boundary Value Problems 1.1 Euler equations of variational problems

Mixed Finite Element Methods. Douglas N. Arnold, University of Minnesota The 41st Woudschoten Conference 5 October 2016

From Completing the Squares and Orthogonal Projection to Finite Element Methods

LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)

Basic Principles of Weak Galerkin Finite Element Methods for PDEs

Chapter 3 Conforming Finite Element Methods 3.1 Foundations Ritz-Galerkin Method

Variational Formulations

INF-SUP CONDITION FOR OPERATOR EQUATIONS

Scientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1

A very short introduction to the Finite Element Method

Numerical Solutions to Partial Differential Equations

Scientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1

Optimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms

2.3 Variational form of boundary value problems

Convergence and optimality of an adaptive FEM for controlling L 2 errors

Theory of PDE Homework 2

LECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES. Sergey Korotov,

Chapter 2 Finite Element Spaces for Linear Saddle Point Problems

Discontinuous Galerkin Methods

Numerical Solutions to Partial Differential Equations

Multigrid Methods for Saddle Point Problems

Numerical Solutions to Partial Differential Equations

Chapter 12. Partial di erential equations Di erential operators in R n. The gradient and Jacobian. Divergence and rotation

A Primal-Dual Weak Galerkin Finite Element Method for Second Order Elliptic Equations in Non-Divergence Form

t y n (s) ds. t y(s) ds, x(t) = x(0) +

Your first day at work MATH 806 (Fall 2015)

0.1 Diagonalization and its Applications

Spline Element Method for Partial Differential Equations

1 Discretizing BVP with Finite Element Methods.

Approximation of Geometric Data

Basic Concepts of Adaptive Finite Element Methods for Elliptic Boundary Value Problems

Numerical Solutions to Partial Differential Equations

Exercises - Chapter 1 - Chapter 2 (Correction)

Yongdeok Kim and Seki Kim

Some Notes on Elliptic Regularity

Introduction. J.M. Burgers Center Graduate Course CFD I January Least-Squares Spectral Element Methods

Equations paraboliques: comportement qualitatif

Space-time Finite Element Methods for Parabolic Evolution Problems

Regularity Theory a Fourth Order PDE with Delta Right Hand Side

1 The Stokes System. ρ + (ρv) = ρ g(x), and the conservation of momentum has the form. ρ v (λ 1 + µ 1 ) ( v) µ 1 v + p = ρ f(x) in Ω.

Math 5520 Homework 2 Solutions

Mixed Finite Elements Method

Université de Metz. Master 2 Recherche de Mathématiques 2ème semestre. par Ralph Chill Laboratoire de Mathématiques et Applications de Metz

Question 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

A primer on Numerical methods for elasticity

Isogeometric Analysis:

Resources. Introduction to the finite element method. History. Topics

Weak Formulation of Elliptic BVP s

[2] (a) Develop and describe the piecewise linear Galerkin finite element approximation of,

Numerical Analysis of Higher Order Discontinuous Galerkin Finite Element Methods

Boundary Value Problems and Iterative Methods for Linear Systems

Key words. inf-sup constant, iterative solvers, preconditioning, saddle point problems

Numerische Mathematik

Simple Examples on Rectangular Domains

On the relationship of local projection stabilization to other stabilized methods for one-dimensional advection-diffusion equations

Chapter 1: The Finite Element Method

1 Constrained Optimization

SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS

Linear Algebra Review

A DELTA-REGULARIZATION FINITE ELEMENT METHOD FOR A DOUBLE CURL PROBLEM WITH DIVERGENCE-FREE CONSTRAINT

Approximation in Banach Spaces by Galerkin Methods

arxiv: v5 [math.na] 1 Sep 2018

Second Order Elliptic PDE

20. A Dual-Primal FETI Method for solving Stokes/Navier-Stokes Equations

A posteriori error estimation in the FEM

A BIVARIATE SPLINE METHOD FOR SECOND ORDER ELLIPTIC EQUATIONS IN NON-DIVERGENCE FORM

6 Inner Product Spaces

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

which together show that the Lax-Milgram lemma can be applied. (c) We have the basic Galerkin orthogonality

1. Subspaces A subset M of Hilbert space H is a subspace of it is closed under the operation of forming linear combinations;i.e.,

NUMERICAL PARTIAL DIFFERENTIAL EQUATIONS

Eigenvectors and Hermitian Operators

The Mortar Boundary Element Method

Schur Complements on Hilbert Spaces and Saddle Point Systems

1. Let a(x) > 0, and assume that u and u h are the solutions of the Dirichlet problem:

Iterative Methods for Linear Systems

Local pointwise a posteriori gradient error bounds for the Stokes equations. Stig Larsson. Heraklion, September 19, 2011 Joint work with A.

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

Finite Element Method for Ordinary Differential Equations

Maximum norm estimates for energy-corrected finite element method

Definition 1. A set V is a vector space over the scalar field F {R, C} iff. there are two operations defined on V, called vector addition

10 The Finite Element Method for a Parabolic Problem

Finite difference method for elliptic problems: I

USING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON S EQUATION

One-dimensional and nonlinear problems

b i (x) u + c(x)u = f in Ω,

A Domain Decomposition Method for Quasilinear Elliptic PDEs Using Mortar Finite Elements

Solution of Non-Homogeneous Dirichlet Problems with FEM

Numerical Methods for the Navier-Stokes equations

DIFFERENTIAL EQUATIONS

Approximation of fluid-structure interaction problems with Lagrange multiplier

An inverse problem for a system of steady-state reaction-diffusion equations on a porous domain using a collage-based approach

CLASSIFICATION AND PRINCIPLE OF SUPERPOSITION FOR SECOND ORDER LINEAR PDE

FINITE ELEMENT METHODS

Notes for Math 663 Spring Alan Demlow

Finite Element Methods for Fourth Order Variational Inequalities

A note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations

Partial Differential Equations and the Finite Element Method

Transcription:

Master in Seismic Engineering E.T.S.I. Industriales (U.P.M.) Discretization Methods in Engineering An introduction to the mathematical theory of finite elements Ignacio Romero ignacio.romero@upm.es October 8, 2014

Outline 1 1. Definitions 2. Unifying formulation for BVP and finite elements 3. Existence and uniqueness of BVP and finite elements 4. The optimality of the FE solution 5. What can go wrong

Definitions 2 Let V be a vector space of (smooth) functions u : Ω R k, for Ω a domain in R 1, R 2, or R 3 and k = 1, 2, or 3. Definition: a function L : V R is a linear form if for all α, β R and v, w V. L(αv + βw) = αl(v) + βl(w) Definition: a function B : V V R is a bilinear form if for all α, β R and u, v, w V. A bilinear form is said to be symmetric if for all u, v V. B(αu + βv, w) = αb(u, v) + βb(u, w), B(u, αv + βw) = αb(u, v) + βb(u, w), B(u, v) = B(v, u)

A unifying formulation 3 All the boundary value problems seen in this course are of the form: find u V such that, for all v V, B(u, v) = L(v) where L is a (continuous) linear form and B is a bilinear form on V. Hence, if we are able to say something about this problem, it is valid for all the problems studies this far. All the bilinear forms studied, except for that of the advection diffusion problem, are symmetric. If we are able to say even more things about symmetric problems, these conclusions will be valid in all the corresponding cases. (Note: in fact, we considered slightly more complex formulations in which the test and weighting spaces were different, due to the boundary conditions, but it is essentially the same as above).

The finite element formulation 4 All the finite element formulations seen in this course are of the form: define a finite dimensional subspace V h V and find u h V h such that for all v h V h B(u h, v h ) = L(v h ) The linear and bilinear forms are identical to that of the continuous problem, only the solution and weighting space changes Moreover, all the finite element solutions computed can be written in matrix form with K ab = B(N a, N b ), F a = L(N a ). KU = F

Existence and uniqueness of the continuous problem 5 Lax-Milgram theorem: Let B : V V R be a bilinear form satisfying B(u, v) C u v B(u, u) α u 2 ( ) ( ) for all u V, with α > 0 being a constant, and some natural norm of the problem, then the variational problem of finding u V satisfying B(u, v) = L(v) for all v V has a unique solution which, furthermore, depends continuously on L (whether B is symmetric or not). Remarks: A bilinear form that satisfies ( ) is said to be continuous. A bilinear form that satisfies ( ) is said to be elliptic. There are additional technical conditions on B and the space V. The bilinear form need not be symmetric

Existence and uniqueness of the FE problem 6 The finite element problem has a unique solution if the matrix K is invertible. If the B form is elliptic, for every nonzero u h V and its corresponding vector of nodal degrees of freedom U, we have U T KU = B(u h, u h ) α u h 2 > 0 concluding that K is positive definite, and hence invertible. Even if the FE has a unique solution, it might not be good enough. The solution needs to be well-conditioned.

The relationship minimization / Galerkin 7 If the bilinear form B is symmetric, then there is a functional Π whose minimizer is the solution to the variational problem. u = arg min v V Π[v] The form of the functional is Π[u] = 1 2B(u, u) L(u) If the bilinear form is not symmetric, then there is not a corresponding minimization principle.

Existence and uniqueness of the continuous problem (2) 8 For minimization problems, it is possible to study the existence of solutions directly from the functional Π, although it is more complicated. The advantage is that there exist results even for nonlinear problems. One needs to show that Π is regular, coercive, and lower semicontinuous (Explain).

The optimality of the finite element solution (1) 9 The finite element method always gives approximate solutions which are, in some sense, optimal. Let V h V be a finite element space. Optimality interpretation 1: If the problem can be stated as a minimization problem, then the finite element solution is, by definition, the one of smallest energy among all functions in V h, hence optimal in some sense.

The optimality of the finite element solution (2) 10 It can be shown that if the bilinear form is elliptic and symmetric it defines an inner product and a norm in V, the so called energy inner product and energy norm, defined respectively as u, v E = B(u, v), u E = B(u, u) Optimality interpretation 2: Let e = u h u be the error in the finite element solution. It is energy-orthogonal to V h. e, v h E = 0 for all v h V h Proof: Take B(u, v) = L(v) and choose v = v h. Substract B(u h, v h ) = L(v h ) and use the definition of bilinearity.

The optimality of the finite element solution (3) 11 Optimality interpretation 3: The error made by the finite element solution is the smallest (measured in the energy norm) among all the errors made by other functions in V h. u u h E u w h E, for all w h V h Proof: e 2 E = B(e, e) = B(e, u) = B(e, u w h ) e E u w h E

Convergence theorem 12 It can be shown that a sufficiently smooth function u can be approximated by a piecewise polynomial Π h u with an error of the form u Π h u E Ch k u where C is a constant, h is a measure of the size of the elements, k 1 is a constant that depends on the order of the polynomials in the FE space, and is a (Sobolev) norm. Combining this interpolation estimate with the last optimality condition we obtain Convergence theorem: The error in the finite element solution satisfies u u h E C h k u This proves convergence of the finite element method, that is, when h 0, the error goes to zero too.

What can go wrong (1) 13 The bilinear form is not elliptic. Comment: Ellipticity is a sufficient condition for solvability and uniqueness of the variational problem, but it is not necessary. A weaker condition exists but it is more complicated to analyze. Caution: Some finite elements (so called mixed methods ) fall within this category. Their use is tricky and their analysis complex. Beware!.

What can go wrong (2) 14 The bilinear form is elliptic, but not symmetric and does not define an energy norm. Comment: The analysis is similar to what has been presented, but the error estimates have to be done in another norm, natural to the problem, which obviously is not defined by B(, ). Sobolev norms are the natural ones. Caution: There might be issues with the uniformity of the bounds.

What can go wrong (3) 15 The form is elliptic, it is symmetric, so the finite element solution is the best in its solution space. What if the finite element space is inappropriate for the problem? Comment: The solution is still the best in some sense, but it might be useless. Caution: This is the reason for the phenomenon known as locking : the finite element solution is extremely stiff. It can be solved by changing the bilinear form to something which is equivalent in the continuous formulation but different when discretized.

Example 16 Timoshenko beam: L ( EI Π(u, θ) = 0 2 (θ ) 2 + GA ) s 2 (u θ) 2 dx = EI L ((θ ) 2 + Ct ) 2 2 (u θ) 2 dx Bilinear form: 0 L 0 L 0 qu dx Mθ(L) F u(l) qu dx Mθ(L) F u(l) B(u, θ; v, α) = L 0 (EI θ α + GA s (u θ)(v α)) dx Solution in the thin limit t/l 0 requires u = θ and u is the minimizer of Π 0 (θ) = L 0 EI 2 (θ ) 2 dx L 0 qu dx Mθ(L) F u(l) with u = θ

Example, cont 17 In general, to enforce a constraint on the solution, we can use Lagrange multipliers Π 3 (θ, u, q) = L 0 ( ) EI 2 (θ ) 2 + q(u θ) dx L 0 qu dx Mθ(L) F u(l) with (θ, u, q) = inf sup Π 3 (θ, u, q) θ,u q The problem is no longer one of minimization, but a saddle point. The theory of saddle points is more subtle. The weak form is of the form: a(u, θ; v, α) + b(u, θ; p) = f(v, α) b(u, θ; q) = g(q) The bilinear form a(, ) must verify a coercivity condition and b(, ) an inf-sup condition, known as the LBB condition.

Master in Seismic Engineering E.T.S.I. Industriales (U.P.M.) Discretization Methods in Engineering An introduction to the mathematical theory of finite elements Ignacio Romero ignacio.romero@upm.es October 8, 2014