Norms and spaces Definition: The space of all square integrable funcions defined in the domain is a finite number not infinity L2 norm of f Examplecompute.

Slides:



Advertisements
Similar presentations
Finite Difference Discretization of Elliptic Equations: 1D Problem Lectures 2 and 3.
Advertisements

Numerical Integration
One-phase Solidification Problem: FEM approach via Parabolic Variational Inequalities Ali Etaati May 14 th 2008.
Partial Differential Equations
The Finite Element Method Defined
MECH593 Introduction to Finite Element Methods
By S Ziaei-Rad Mechanical Engineering Department, IUT.
Asymptotic error expansion Example 1: Numerical differentiation –Truncation error via Taylor expansion.
Notes Assignment questions… cs533d-winter-2005.
1cs533d-term Notes  Assignment 2 is up. 2cs533d-term Modern FEM  Galerkin framework (the most common)  Find vector space of functions that.
1cs542g-term Notes  Make-up lecture tomorrow 1-2, room 204.
BVP Weak Formulation Weak Formulation ( variational formulation) where Multiply equation (1) by and then integrate over the domain Green’s theorem gives.
Chapter 5 Orthogonality
A posteriori Error Estimate - Adaptive method Consider the boundary value problem Weak form Discrete Equation Error bounds ( priori error )
12/21/2001Numerical methods in continuum mechanics1 Continuum Mechanics On the scale of the object to be studied the density and other fluid properties.
Finite Element Method Introduction General Principle
Weak Formulation ( variational formulation)
Approximation on Finite Elements Bruce A. Finlayson Rehnberg Professor of Chemical Engineering.
MECH300H Introduction to Finite Element Methods
Tutorial 10 Iterative Methods and Matrix Norms. 2 In an iterative process, the k+1 step is defined via: Iterative processes Eigenvector decomposition.
6 6.3 © 2012 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
Regularization by Galerkin Methods Hans Groot. 2 Overview In previous talks about inverse problems: well-posedness worst-case errors regularization strategies.
Length and Dot Product in R n Notes: is called a unit vector. Notes: The length of a vector is also called its norm. Chapter 5 Inner Product Spaces.
1 st order linear differential equation: P, Q – continuous. Algorithm: Find I(x), s.t. by solving differential equation for I(x): then integrate both sides.
Chapters 5 and 6: Numerical Integration
CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.
MA2213 Lecture 4 Numerical Integration. Introduction Definition is the limit of Riemann sums I(f)
Section 2: Finite Element Analysis Theory
1.3 Distance and Midpoints
Scientific Computing Linear Least Squares. Interpolation vs Approximation Recall: Given a set of (x,y) data points, Interpolation is the process of finding.
Finite Element Method.
Section 6.1 Rational Expressions. OBJECTIVES A Find the numbers that make a rational expression undefined.
AN ORTHOGONAL PROJECTION
Orthogonality and Least Squares
1 Variational and Weighted Residual Methods. 2 The Weighted Residual Method The governing equation for 1-D heat conduction A solution to this equation.
Polynomial Preserving Gradient Recovery in Finite Element Methods Zhimin Zhang Department of Mathematics Wayne State University Detroit, MI 48202
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 8.
6. Introduction to Spectral method. Finite difference method – approximate a function locally using lower order interpolating polynomials. Spectral method.
1 Chien-Hong Cho ( 卓建宏 ) (National Chung Cheng University)( 中正大學 ) 2010/11/11 in NCKU On the finite difference approximation for hyperbolic blow-up problems.
Elliptic PDEs and the Finite Difference Method
Approximation on Finite Elements Bruce A. Finlayson Rehnberg Professor of Chemical Engineering.
DE Weak Form Linear System
Scientific Computing General Least Squares. Polynomial Least Squares Polynomial Least Squares: We assume that the class of functions is the class of all.
CHAPTER 5 SIGNAL SPACE ANALYSIS
Chap. 5 Inner Product Spaces 5.1 Length and Dot Product in R n 5.2 Inner Product Spaces 5.3 Orthonormal Bases: Gram-Schmidt Process 5.4 Mathematical Models.
HEAT TRANSFER FINITE ELEMENT FORMULATION
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 24.
Chapter 1: Square Roots and the Pythagorean Theorem Unit Review.
Chapter 4 Euclidean n-Space Linear Transformations from to Properties of Linear Transformations to Linear Transformations and Polynomials.
1  Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
CHAP 3 WEIGHTED RESIDUAL AND ENERGY METHOD FOR 1D PROBLEMS
Partial Derivatives Example: Find If solution: Partial Derivatives Example: Find If solution: gradient grad(u) = gradient.
6 6.3 © 2016 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
Finite Element Method. History Application Consider the two point boundary value problem.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 25.
BENG 276 HHMI Interfaces Lab 2: Numerical Analysis for Multi-Scale Biology Introduction to Finite Element Modeling Andrew McCulloch Department of Bioengineering.
1 Copyright by PZ Bar-Yoseph © Finite Element Methods in Engineering Winter Semester Lecture 7.
Let W be a subspace of R n, y any vector in R n, and the orthogonal projection of y onto W. …
Answers for Review Questions for Lectures 1-4. Review Lectures 1-4 Problems Question 2. Derive a closed form for the estimate of the solution of the equation.
1 CHAP 3 WEIGHTED RESIDUAL AND ENERGY METHOD FOR 1D PROBLEMS FINITE ELEMENT ANALYSIS AND DESIGN Nam-Ho Kim.
EEE 431 Computational Methods in Electrodynamics
Introduction to the Finite Element Method
Uniqueness Theorem vanishes on S vanishes in V
C H A P T E R 3 Vectors in 2-Space and 3-Space
Orthogonality and Least Squares
Finite element method.
Orthogonality and Least Squares
1st semester a.y. 2018/2019 – November 22, 2018
Approximation of Functions
Approximation of Functions
Presentation transcript:

Norms and spaces Definition: The space of all square integrable funcions defined in the domain is a finite number not infinity L2 norm of f Examplecompute

Definition: The function and its first derivatives are square integrable Example Def: Norms and spaces

Example Def: Norms and spaces Energy norm Example Compute the energy norm of the function

Norms and spaces Example Which of the following belongs to Definition:

Triangle inequality Norms and spaces Cauchy-Schwartz inequality (Real numbers) Triangle inequality Cauchy-Schwartz inequality

the space of all continuous piecewise linear polynomials the space of all continuous piecewise linear polynomials which vanishes on the boundary Definition: Norms and spaces Relations:

the length of the longest edge on K Mesh size h local mesh size Example: mesh size Example:

A Priori Error Estimates in what sense the error e becomes small

A Priori Error Estimates variational formulationfinite element method

Galerkin Orthogonality The finite element approximation u h, satisfies the orthogonality Theorem 1 (Galerkin Orthogonality). Proof: from the variational formulation we have: subtract variational formulation finite element method

Best Approximation The finite element approximation u h, satisfies Theorem 2 (Best Approximation). Proof: This shows that the finite element solution uh is the closest of all functions in Vh to the exact solution u when measuring distance using the energy norm.

Energy Norm Error The finite element approximation u h, satisfies the a priori error estimate Theorem 3 ( error depends on meshsize ). Proof: This shows that how the error depends on the mesh size. with a constant C independent of Start from the best approximation choosing v= πu the gradient of the error tends to zero as the maximum mesh size h tend to zero. Remark

Error Depends on h For any function Theorem (Poincare Inequality). These constants C’s are different Remark

L2 error is h2 we expect that the L2 error to be h2 and not h The finite element approximation u h, satisfies the a priori error estimate Theorem 4 (The L2-error) with a constant C independent of The proof uses a well-known technique called Nitsche’s trick, Dual problem or adjoint problemMain problem

Remark: Continuous Piecewise Linear Interpolation Definition: we define its continuous piecewise linear interpolant by Let approximates by taking on the same values in the nodes Ni.

L2 error is h2 The finite element approximation u h, satisfies the a priori error estimate Theorem 4 (The L2-error) with a constant C independent of Proof: let ϕ be the solution of the dual problem Multiplying by e and integrating using Green’s formula Cauchy-Schwartz inequality Dividing by ∥ e ∥

Error norms The finite element approximation u h, satisfies the a priori error estimate Theorem (L2 Norm) with a constant C independent of The finite element approximation u h, satisfies the a priori error estimate Theorem (Energy Norm) with a constant C independent of

Calcuate the L2 error

Exact solution

function [l2error] = compute_error(p, t, uh, u, u_x, u_y) % calculates the error nt = size(t, 2); % number of triangles np = size(p,2); t1 = t(1,:); t2 = t(2,:); t3 = t(3,:); x1 = p(1, t1); x2 = p(1, t2); x3 = p(1, t3); y1 = p(2, t1); y2 = p(2, t2); y3 = p(2, t3); xc = (x1 + x2 + x3)/3 ; % x-coord of element midpoints yc = (y1 + y2 + y3)/3 ; % y-coord of element midpoints exact = feval(u, xc, yc); % exact sol at the midpoints uhc = pdeintrp(p, t, uh); % FE sol at the midpoints l2error2 =0; for K = 1:nt loc2glob = t(1:3,K); x = p(1,loc2glob); y = p(2,loc2glob); area = polyarea(x,y); loc_er = (exact(loc2glob) - uhc(loc2glob)).^2; l2error2 = l2error2 + sum(loc_er)*area end l2error = sqrt(l2error2); [exact', uhc', abs(exact-uhc)'] function [p,e,t,uh] = solveE(hmax) % Poisson's equation on a square [-1,1]X[-1,1] is solved % and the resulting finite element solution is stored in % the vector uh. % g = 'squareg'; % domain b = 'squareb1'; % Dirichlet data f = '-2*((x.^2 - 1) + (y.^2 - 1))'; % right hand side [p, e, t] = initmesh(g,'Hmax',hmax); % triangulation uh = assempde(b, p, e, t, 1, 0, f); % solve pde u = inline('(x.^2 - 1).*(y.^2 - 1)', 'x', 'y'); % exact sol u_x = inline('2*x.*(y.^2 - 1)', 'x', 'y'); % u_x exact u_y = inline('2*y.*(x.^2 - 1)', 'x', 'y'); % u_y exact h1=0.2; [p1,e1,t1,uh1] = solveE(h1); [l2error1] = compute_error(p1, t1, uh1, u, u_x, u_y) h2=0.1; [p2,e2,t2,uh2] = solveE(h2); [l2error2] = compute_error(p2, t2, uh2, u, u_x, u_y) log(l2error1/l2error2)/log(h1/h2)

Calcuate the energy norm of the error function [energy_error] = energy_error(p, t, uh, u, u_x, u_y) a) Write matlab file to compute the energy norm of the error b) Write matlab file to compute the energy norm of the error for two different meshes with meshsizes h1 and h2 and verify the rate of convergence Exercise