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

Similar documents
WELL POSEDNESS OF PROBLEMS I

arxiv: v1 [physics.comp-ph] 20 Oct 2017 Abstract

Introduction to Discrete Optimization

Konrad-Zuse-Zentrum für Informationstechnik Berlin Heilbronner Str. 10, D Berlin - Wilmersdorf

RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS

Kinetic Theory of Gases: Elementary Ideas

Supplementary Material for Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion

The Stefan problem with moving boundary. Key Words: Stefan Problem; Crank-Nicolson method; Moving Boundary; Finite Element Method.

Approximation in Banach Spaces by Galerkin Methods

Kinetic Theory of Gases: Elementary Ideas

Lecture 21. Interior Point Methods Setup and Algorithm

A Simple Regression Problem

Soft-margin SVM can address linearly separable problems with outliers

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.

Support recovery in compressed sensing: An estimation theoretic approach

Regularity Theory a Fourth Order PDE with Delta Right Hand Side

Least Squares Fitting of Data

Linear Algebra (I) Yijia Chen. linear transformations and their algebraic properties. 1. A Starting Point. y := 3x.

Concentration of ground states in stationary Mean-Field Games systems: part I

ANALYSIS OF RECOVERY TYPE A POSTERIORI ERROR ESTIMATORS FOR MILDLY STRUCTURED GRIDS

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes

THE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n

A Bernstein-Markov Theorem for Normed Spaces

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

A new type of lower bound for the largest eigenvalue of a symmetric matrix

Page 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011

Block designs and statistics

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

A posteriori error estimation for elliptic problems

Introduction to Robotics (CS223A) (Winter 2006/2007) Homework #5 solutions

From Completing the Squares and Orthogonal Projection to Finite Element Methods

The Solution of One-Phase Inverse Stefan Problem. by Homotopy Analysis Method

On the Use of A Priori Information for Sparse Signal Approximations

ANALYSIS OF A FULLY DISCRETE FINITE ELEMENT METHOD FOR THE PHASE FIELD MODEL AND APPROXIMATION OF ITS SHARP INTERFACE LIMITS

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

Numerical Methods for Elliptic Partial Differential Equations with Random Coefficients

OPTIMAL DESIGNS FOR ESTIMATING PAIRS OF COEFFICIENTS IN FOURIER REGRESSION MODELS

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

NONLINEAR KIRCHHOFF-CARRIER WAVE EQUATION IN A UNIT MEMBRANE WITH MIXED HOMOGENEOUS BOUNDARY CONDITIONS

Supporting Information for Supression of Auger Processes in Confined Structures

Robustness and Regularization of Support Vector Machines

arxiv: v1 [math.na] 10 Oct 2016

A Theoretical Analysis of a Warm Start Technique

1 Bounding the Margin

HESSIAN MATRICES OF PENALTY FUNCTIONS FOR SOLVING CONSTRAINED-OPTIMIZATION PROBLEMS

Support Vector Machines. Maximizing the Margin

Calculation of load limits by the method of Norton- Hoff-Friaâ, behavior NORTON_HOFF

The Methods of Solution for Constrained Nonlinear Programming

Bulletin of the. Iranian Mathematical Society

ANALYSIS OF A NUMERICAL SOLVER FOR RADIATIVE TRANSPORT EQUATION

arxiv:math/ v1 [math.nt] 15 Jul 2003

Optimal quantum detectors for unambiguous detection of mixed states

Chapter 6 1-D Continuous Groups

i ij j ( ) sin cos x y z x x x interchangeably.)

An introduction to the mathematical theory of finite elements

Anisotropic inverse conductivity and scattering problems

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

Quantum Chemistry Exam 2 Take-home Solutions

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

1. Introduction. This paper is concerned with the study of convergence of Krylov subspace methods for solving linear systems of equations,

Supplementary Materials: Proofs and Technical Details for Parsimonious Tensor Response Regression Lexin Li and Xin Zhang

1 Discretizing BVP with Finite Element Methods.

Finite difference method for elliptic problems: I

Shannon Sampling II. Connections to Learning Theory

Semicircle law for generalized Curie-Weiss matrix ensembles at subcritical temperature

Consistent Multiclass Algorithms for Complex Performance Measures. Supplementary Material

Hybrid System Identification: An SDP Approach

POD-DEIM MODEL ORDER REDUCTION FOR THE MONODOMAIN REACTION-DIFFUSION EQUATION IN NEURO-MUSCULAR SYSTEM

ABSTRACT INTRODUCTION

AN APPLICATION OF CUBIC B-SPLINE FINITE ELEMENT METHOD FOR THE BURGERS EQUATION

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

The Weierstrass Approximation Theorem

CS Lecture 13. More Maximum Likelihood

Polygonal Designs: Existence and Construction

A note on the realignment criterion

Complex Quadratic Optimization and Semidefinite Programming

FAST DYNAMO ON THE REAL LINE

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

Variations on Backpropagation

Determining the Robot-to-Robot Relative Pose Using Range-only Measurements

Sharp Time Data Tradeoffs for Linear Inverse Problems

Non-Parametric Non-Line-of-Sight Identification 1

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

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

Asynchronous Gossip Algorithms for Stochastic Optimization

Solution of Non-Homogeneous Dirichlet Problems with FEM

1 Analysis of heat transfer in a single-phase transformer

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

Variational Formulations

Stability Analysis of the Matrix-Free Linearly Implicit 2 Euler Method 3 UNCORRECTED PROOF

c 2010 Society for Industrial and Applied Mathematics

A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR SINGULARLY PERTURBED PARABOLIC PROBLEM

Optimal designs for estimating pairs of coefficients in Fourier regression models

STOPPING SIMULATED PATHS EARLY

Worst-case performance of critical path type algorithms

The Fundamental Basis Theorem of Geometry from an algebraic point of view

Distributed Subgradient Methods for Multi-agent Optimization

Principles of Optimal Control Spring 2008

Transcription:

UPPSALA UNIVERSITY Departent of Inforation Technology Division of Scientific Coputing Solutions to exa in Finite eleent ethods II 14-6-5 Stefan Engblo, Daniel Elfverson Question 1 Note: a inus sign in front of the A is issing on the exa. (a) Multiplying the PDE by a test-function v which vanishes at the boundary and integrating by parts, we get (A u, v) + (b u, v) + (cu, v) = (f, v). Define V = H 1 (Ω), the variational forulation reads: find u V such that a(u, v) =: (A u, v) + (b u, v) + (cu, v) = (f, v) := l(v), v V. For the Galerkin approxiation we consider a subspace V h V, find u h V h such that a(u h, v) = l(v), v V h. (b) The assuptions are (A u, u) a ( u, u), c 1 b > c >, and f L (Ω). Note also that We get = (n bu, 1) Ω = ( (bu ), 1) Ω = (( b)u, u) Ω + (b u, u) Ω. (1) a(u, u) = (A u, u) + (b u, u) + (cu, u) a ( u, u) + (cu, u) 1 (( b)u, u) a ( u, u) + c (u, u) = a u + c u in(a, c ) u V = u V, () for coercivity, a(u, v) = (A u, v) + (b u, v) + (cu, v) A L (Ω) u v + b L (Ω) u v + c L (Ω) u v C ab u v + C c u v C u V v V (3) for continuity, and l(v) = (f, v) = f v f v V, (4) which together show that the Lax-Milgra lea can be applied. (c) We have the basic Galerkin orthogonality a(u u h, v) = v V h. (5) We start by proving Cea s lea and then use the interpolation estiate u u h V 1 a(u u h, u u h ) = C a a(u u h, u v) We obtain for a Poincaré constant C p, C a u u h V u v V. (6) u u h V C a u v V C ac p (u πu) C ac p C π hin(,p) u H 3 (Ω). (7) 1

(d) First is to show that the solution the the variational proble iniize the functional F (v) = 1 a(v, v) l(v). We obtain F (u + v) = 1 a(u + v, u + v) F (u + v) = 1 (a(u, u) + a(u, v) + a(v, v)) l(u) l(v) = F (u) + a(u, v) l(u) + 1 a(v, v) F (u). (8) Then we ust show that a iniizer to F (v) solves the variational proble. Let g(ɛ) = F (u + ɛv), we obtain Differentiating g with respect the ɛ, we have g(ɛ) = 1 a(u + ɛv, u + ɛv) l(u + ɛv). (9) g (ɛ) = a(u, v) ɛa(v, v) l(v) (1) and setting ɛ = we have the variational forulation. Note that V h V, we can concludes the proof. Question (a) We have the syste 1 L 1 (1) L 1 (r) L 1 (s) L 1 (t) L 1 (rs) L 1 (rt) L 1 (st) L 1 (rst) c 1 L (1) L (r) L (s) L (t) L (rs) L (rt) L (st) L (rst) c L 3 (1) L 3 (r) L 3 (s) L 3 (t) L 3 (rs) L 3 (rt) L 3 (st) L 3 (rst) c 3 e 1 = = L 4 (1) L 4 (r) L 4 (s) L 4 (t) L 4 (rs) L 4 (rt) L 4 (st) L 4 (rst) c 4 L 5 (1) L 5 (r) L 5 (s) L 5 (t) L 5 (rs) L 5 (rt) L 5 (st) L 5 (rst) c 5 L 6 (1) L 6 (r) L 6 (s) L 6 (t) L 6 (rs) L 6 (rt) L 6 (st) L 6 (rst) c 6 L 7 (1) L 7 (r) L 7 (s) L 7 (t) L 7 (rs) L 7 (rt) L 7 (st) L 7 (rst) c 7 L 8 (1) L 8 (r) L 8 (s) L 8 (t) L 8 (rs) L 8 (rt) L 8 (st) L 8 (rst) c 8 (11) Which is 1 1 c 1 1 1 c 1 1 1 1 c 3 = 1 1 c 4 1 1 c 5 (1) 1 1 1 1 c 6 1 1 1 1 1 1 1 1 c 7 1 1 1 1 (b) We have u u h h u v h + v u h h (13) for v V h. For the first ter choose v as sup v Vh u v h. For the second ter we have v u h h 1 a h(v u h, v u h ) = 1 a h(v u + u u h, v u h ) c 8 = 1 (a h(v u, v u h ) + a h (u u h, v u h )) (14) = 1 (C α v u h v u h h + a h (u, v u h ) l(v u h ))

which iplies that v u h h 1 ( C α v u h + a ) h(u, v u h ) l(v u h ) v u h h 1 ( ) (15) a h (u, w) l(w) C α v u h + sup w V h Added the bound for the first and second ter we have for C = 1 + Cα. Question 3 u u h h (1 + C α ) inf u v h + 1 v V h sup a h (u, w) l(w) w V h ( ) (16) a h (u, w) l(w) C inf u v h + sup v V h w V h (a) Lets try to bound the gradient of the solution in ters of data. We have the variational for: find u V = H 1 (Ω) We obtain ɛ( u, v) + (b u, v) = (f, v) v V. (17) ɛ u = ɛ( u, u) + (b u, u) = (f, v) f v C P F f v. (18) where we used that = (n bu, 1) Ω = ( (bu ), 1) Ω = (( b)u, u) Ω + (b u, u) Ω. (19) together with b =. (b) First fro the continuous proble we have that u solves: find u V = H 1 (Ω) such that ɛ( u, v) + (b u, v) = (f, v) v V. () For the reaining part we have, ( ɛ u + b u, ɛ v + b v)) = (f, ɛ v + b v). (1) Also since, u H (Ω) V, we have that ɛ : H (Ω) L (Ω), but ɛ T : H 1 (T ) L (T ) is not true in general, so we can not test for all v V. The eleentwice operator ɛ T : V h L (T ) is true since all v V h are polynoials of finite diension. Multiplying the original equation with a test function in w L (Ω) defined as w T = ɛ v + b v L (T ) on eleent T, we have that (ɛ u, w) + (b u, w) = (f, w) ( ɛ u + b u, w) = (f, w), () for all v V h. Using the first and second part together we obtain that that u H V satisfies a h (u, v) = l(v) v V h. (3) 3

Question 4 (a) A typical Picard iteration for the proble is With u k as given we find by linearity that (c(u k ) u k+1 ) = f. (c(u k ) (u k u k+1 )) = r k, with hoogeneous Dirichlet boundary conditions. (b) The suggested iteration is clearly consistent since it is satisfied identically by any solution u to the PDE itself. Using the boundary conditions we readily find the variational forulation find u k+1 H 1 (Ω) such that for all v H 1 (Ω). This iplies the FEM ( v, a(u k ) u k+1 ) = (v, f) + ( v, b(u k ) u k ) A k ξ k+1 = b + B k ξ k, A k (i, j) = ( ϕ i, a(u k ) ϕ j ), B k (i, j) = ( ϕ i, b(u k ) ϕ j ), b i = (ϕ i, f), U k = j ξ k j ϕ j. (c) By taking v = u k+1 in the variational forulation we produce the energy estiate α u k+1 ( u k+1, a(u k ) u k+1 ) = (u k+1, f) + ( u k+1, b(u k ) u k ) u k+1 f + β u k+1 u k C f u k+1 + β u k+1 u k. Hence a suitable a priori bound is u k+1 α 1 C f + α 1 β u k, which if κ := α 1 β < 1 can be iterated to give α 1 C f + κα 1 C f + κ u k 1... (1 + κ +... + κ k )α 1 C f + κ k+1 u α 1 C f 1 κ + u. (d) Here we show that the LM lea is applicable, but the proble is syetric so the RR theore is also applicable. We have l(v) = (v, f) + ( v, b(u k ) u k ) ax( f, β u k ) v H1 (Ω). a(u, v) = ( v, a(u k ) u) A k v u A k v H 1 (Ω) u H 1 (Ω), where a(u k ) A k (recall that a is bounded). Finally, a(u, u) α u α C u, = a(u, u) α in(1, 1/C ) u H 1 (Ω). 4

(e) We arrive at the Newton ethod by linearising around the previous iterate u k. Put u k+1 = u k +δ. Then this is achieved by a(u k+1 ) u k+1 = a(u k +δ) (u k +δ) = a(u k ) (u k + δ) + δa (u k ) u k + O(δ ). The variational forulation becoes find u k+1 H 1 (Ω) such that ( v, a(u k ) u k+1 ) + ( v, u k+1 a (u k ) u k ) = (v, f) + ( v, b(u k ) u k ) + ( v, u k a (u k ) u k ) for all v H 1 (Ω). The FEM becoes with atrices A and B as before and with (A k + C k )ξ k+1 = b + (B k + C k )ξ k, C k (i, j) = ( ϕ i, ϕ j a (U k ) U k ). 5