A Gradient Recovery Operator Based on an Oblique Projection
|
|
- Ferdinand Mathews
- 5 years ago
- Views:
Transcription
1 A Gradient Recovery Operator Based on an Bishnu P. Lamichhane, School of Mathematical and Physical Sciences, University of Newcastle, Australia CARMA Retreat July 18, 2011
2 Table of Contents 1 Current Research Projects 2 3 Orthogonal Projection
3 Current Research Projects My current research projects include Solid Mechanics A symmetric mixed finite element method for nearly incompressible elasticity based on biorthogonal systems. A joint project with Prof. Ernst Stephan, Leibniz University Hanover, Hanover, Germany. This project is just finished and published in Numerical Methods for Partial Differential Equations, DOI: /num Data Smoothing Approximation of thin plates spline using a mixed finite element method. In collaboration with Prof. Markus Hegland, Dr. Stephen Roberts and Dr. Linda Stals at the ANU. A part of this project is finished in 2011 and is accepted to appear in ANZIAM Journal: electronic supplement.
4 Current Research Projects My current research projects include Solid Mechanics A symmetric mixed finite element method for nearly incompressible elasticity based on biorthogonal systems. A joint project with Prof. Ernst Stephan, Leibniz University Hanover, Hanover, Germany. This project is just finished and published in Numerical Methods for Partial Differential Equations, DOI: /num Data Smoothing Approximation of thin plates spline using a mixed finite element method. In collaboration with Prof. Markus Hegland, Dr. Stephen Roberts and Dr. Linda Stals at the ANU. A part of this project is finished in 2011 and is accepted to appear in ANZIAM Journal: electronic supplement.
5 Current Research Projects Solid Mechanics A finite element method based on simplices for the Hu-Washizu formulation in linear elasticity. In collaboration with Prof. B. Daya Reddy, University of Cape Town, South Africa. Close to be finished. Parameter Estimation of PDEs Parameter estimation in elliptic partial differential equations. This project is very close to be finished and is done with Dr. Robert S (Bob) Anderssen, CSIRO, ANU. Trying to submit for MODSIM proceeding. Image Processing Total variation minimisation in removing the mixture of Gaussian and impulsive noise. I am collaborating with Dr. David Allingham, CARMA, to complete this project.
6 Current Research Projects Solid Mechanics A finite element method based on simplices for the Hu-Washizu formulation in linear elasticity. In collaboration with Prof. B. Daya Reddy, University of Cape Town, South Africa. Close to be finished. Parameter Estimation of PDEs Parameter estimation in elliptic partial differential equations. This project is very close to be finished and is done with Dr. Robert S (Bob) Anderssen, CSIRO, ANU. Trying to submit for MODSIM proceeding. Image Processing Total variation minimisation in removing the mixture of Gaussian and impulsive noise. I am collaborating with Dr. David Allingham, CARMA, to complete this project.
7 Current Research Projects Solid Mechanics A finite element method based on simplices for the Hu-Washizu formulation in linear elasticity. In collaboration with Prof. B. Daya Reddy, University of Cape Town, South Africa. Close to be finished. Parameter Estimation of PDEs Parameter estimation in elliptic partial differential equations. This project is very close to be finished and is done with Dr. Robert S (Bob) Anderssen, CSIRO, ANU. Trying to submit for MODSIM proceeding. Image Processing Total variation minimisation in removing the mixture of Gaussian and impulsive noise. I am collaborating with Dr. David Allingham, CARMA, to complete this project.
8 Current Research Projects Finite Element Theory A gradient recovery operator based on an oblique projection. This project was finished in 2010 and is now published in Electronic Transactions on Numerical Analysis, Vol 37 (2010), Biharmonic Problem 2 u = 0 A mixed finite element method for the biharmonic problem using biorthogonal or quasi-biorthogonal systems. This project was finished in 2009 and is now published in Journal of Scientific Computing, Vol 46 (2011),
9 Current Research Projects Finite Element Theory A gradient recovery operator based on an oblique projection. This project was finished in 2010 and is now published in Electronic Transactions on Numerical Analysis, Vol 37 (2010), Biharmonic Problem 2 u = 0 A mixed finite element method for the biharmonic problem using biorthogonal or quasi-biorthogonal systems. This project was finished in 2009 and is now published in Journal of Scientific Computing, Vol 46 (2011),
10 Current Research Projects Biharmonic Problem 2 u = 0 A Stabilized Mixed for the Biharmonic Equation Based on Biorthogonal Systems. This project was finished in 2010 and is now published in Journal of Computational and Applied Mathematics, DOI: /j.cam Future Goal: time-dependent problems and improve the estimate. Solid Mechanics Two s for Nearly Incompressible Linear Elasticity Using Simplicial Meshes, Submitted Book Chapter for Nova Science Publisher, New York.
11 Current Research Projects Biharmonic Problem 2 u = 0 A Stabilized Mixed for the Biharmonic Equation Based on Biorthogonal Systems. This project was finished in 2010 and is now published in Journal of Computational and Applied Mathematics, DOI: /j.cam Future Goal: time-dependent problems and improve the estimate. Solid Mechanics Two s for Nearly Incompressible Linear Elasticity Using Simplicial Meshes, Submitted Book Chapter for Nova Science Publisher, New York.
12 The main idea: For a problem posed in a continuous space W, we replace the continuous space W (which is infinite dimensional) by a discrete one W h. For example, for Ω R d, d {1, 2, 3}, the continuous space can be replaced by a discrete space H 1 (Ω) = {u L 2 (Ω), u [L 2 (Ω)] d } W h = span{φ 1, φ 2,, φ n}. Fiinite element basis functions in 1D φ i T A finite element basis function in 2D φ i A hanging node T W h H 1 (Ω) if there are no hanging nodes (right picture).
13 Piecewise Linear Space: A Finite Element Space Let = {a = x 0 < x 1 < < x n = b} be a set of points in [a, b], and T = {I i} n 1 i=0, where Ii = [xi, xi+1). The piecewise linear interpolant is obtained by joining the set of data points {(x 0, f(x 0)), (x 1, f(x 1)),, (x n, f(x n))} by a series of straight lines, as shown in the adjacent figure. Linear Space S l ( ) Let S l ( ) be the space of all piecewise linear functions with respect to. One can show that S l ( ) is a linear space of dimension n + 1. This is like a rational approximation of an irrational number like π.
14 Piecewise Linear Space: A Finite Element Space Let = {a = x 0 < x 1 < < x n = b} be a set of points in [a, b], and T = {I i} n 1 i=0, where Ii = [xi, xi+1). The piecewise linear interpolant is obtained by joining the set of data points {(x 0, f(x 0)), (x 1, f(x 1)),, (x n, f(x n))} by a series of straight lines, as shown in the adjacent figure. Linear Space S l ( ) Let S l ( ) be the space of all piecewise linear functions with respect to. One can show that S l ( ) is a linear space of dimension n + 1. This is like a rational approximation of an irrational number like π.
15 Piecewise Linear Space: Basis Functions We can form a basis of S h = S l ( ). Define x x 1 if x I x x n 1 0 if x I n 1 φ 0(x) = x 0 x 1, φ n(x) = x n x n 1 0 otherwise 0 otherwise x x i 1 if x I i 1 x i x i 1 φ i(x) = x x i+1 if x I i, for i = 1,..., n 1, x i x i+1 0 otherwise and Then {φ i} n i=0 forms a basis for the space S l ( ). A piecewise linear interpolant of a continuous function u is written as I h u S l ( ) with n I h u(x) = u(x i)φ i(x). i=0 φ 0 φ i φn T
16 The Considered Problem Orthogonal Projection Weak Derivative The function I h u is continuous but not differentiable at the nodes {x 0, x 1,, x n}. The weak derivative of I h u is a piecewise constant function, but it is not continuous. Generically, we can think of a finite element space S h consisting of piecewise polynomials for Ω R d : S h := {v h C 0 (Ω) : v h T P p(t ), T T h }, p N, where T is a simplex, and P p(t ) is the space of polynomials of total degree less than or equal to p in T. Orthogonal Projection of Weak Derivative We now want to project the gradient of I h u onto the space S h. The projected gradient is then continuous. But what do we gain? In fact, the projected gradient approximates the exact gradient u better than the unprojected discrete gradient I h u.
17 The Considered Problem Orthogonal Projection Weak Derivative The function I h u is continuous but not differentiable at the nodes {x 0, x 1,, x n}. The weak derivative of I h u is a piecewise constant function, but it is not continuous. Generically, we can think of a finite element space S h consisting of piecewise polynomials for Ω R d : S h := {v h C 0 (Ω) : v h T P p(t ), T T h }, p N, where T is a simplex, and P p(t ) is the space of polynomials of total degree less than or equal to p in T. Orthogonal Projection of Weak Derivative We now want to project the gradient of I h u onto the space S h. The projected gradient is then continuous. But what do we gain? In fact, the projected gradient approximates the exact gradient u better than the unprojected discrete gradient I h u.
18 Orthogonal Projection Project a Component of the Gradient Vector Let I h u = gh, 1, gh d and consider a component of the gradient vector gh 1 = I hu x 1. Let p 1 h be its projection onto the space S h, then p 1 h S h is defined as p 1 hφ j dx = ghφ 1 j dx, φ j S h. Ω Since p 1 h S h, we have p 1 h = n i=1 ciφi, for some constants c1,, cn. Linear System Ω Putting this expression back in the projection formula, we get Mc = r where M is a matrix with (i, j)th entry M ij = φ iφ j dx, Ω c and r are vectors of length n with the jth component c j and Ω g1 hφ j dx. Here M is a mass matrix, which is sparse. We need to invert this matrix to computer c. In higher dimension, it is not easy to invert.
19 Orthogonal Projection Project a Component of the Gradient Vector Let I h u = gh, 1, gh d and consider a component of the gradient vector gh 1 = I hu x 1. Let p 1 h be its projection onto the space S h, then p 1 h S h is defined as p 1 hφ j dx = ghφ 1 j dx, φ j S h. Ω Since p 1 h S h, we have p 1 h = n i=1 ciφi, for some constants c1,, cn. Linear System Ω Putting this expression back in the projection formula, we get Mc = r where M is a matrix with (i, j)th entry M ij = φ iφ j dx, Ω c and r are vectors of length n with the jth component c j and Ω g1 hφ j dx. Here M is a mass matrix, which is sparse. We need to invert this matrix to computer c. In higher dimension, it is not easy to invert.
20 Orthogonal Projection Super-Approximation Property Let R h be the component-wise projection operator onto S h. For the projected gradient R h I h u, we can show that (for good meshes) u R h I h u 0,Ω Ch u W 3, (Ω), whereas u I h u 0,Ω Ch 1+0 u W 3, (Ω). Gradient projection gives a better estimate but expensive to compute. What happens if we replace the orthogonal projection R h I h u by an oblique projection Q h I uu? The oblique projection p 1 h S h of the first component of the gradient I h u is obtained by p 1 hµ j dx = ghµ 1 j dx, µ j M h. Ω Ω This also gives a linear system Mc = r, but the (i, j)th component of M is defined as M ij = φ iµ j dx. Bishnu P. Lamichhane, bishnu.lamichhane@newcastle.edu.au Ω A Gradient Recovery Operator Based on an
21 Orthogonal Projection Super-Approximation Property Let R h be the component-wise projection operator onto S h. For the projected gradient R h I h u, we can show that (for good meshes) u R h I h u 0,Ω Ch u W 3, (Ω), whereas u I h u 0,Ω Ch 1+0 u W 3, (Ω). Gradient projection gives a better estimate but expensive to compute. What happens if we replace the orthogonal projection R h I h u by an oblique projection Q h I uu? The oblique projection p 1 h S h of the first component of the gradient I h u is obtained by p 1 hµ j dx = ghµ 1 j dx, µ j M h. Ω Ω This also gives a linear system Mc = r, but the (i, j)th component of M is defined as M ij = φ iµ j dx. Bishnu P. Lamichhane, bishnu.lamichhane@newcastle.edu.au Ω A Gradient Recovery Operator Based on an
22 Orthogonal Projection Diagonal Matrix M Can we define the space M h such that the matrix M is diagonal? Let the space of the standard finite element functions S h be spanned by the basis {φ 1,..., φ n}. We construct the basis {µ 1,..., µ n} of the space M h of test functions so that the basis functions of S h and M h satisfy a condition of biorthogonality relation µ i φ j dx = c jδ ij, c j 0, 1 i, j n, (1) Ω where n := dim M h = dim S h, δ ij is the Kronecker symbol, and c j a scaling factor, and is always positive. Oblique vs Orthogonal Projection It is easy to verify that Q h is a projection onto the space S h. We note that Q h is not the orthogonal projection onto S h but an oblique projection onto it. Refer to [Gal03, Szy06] for more detail. Orthogonal projection is unique, but the oblique projection depends on a direction. Projection of OP onto OX Orthogonal: OR Oblique along PS: OS P O R S Y X
23 Orthogonal Projection Diagonal Matrix M Can we define the space M h such that the matrix M is diagonal? Let the space of the standard finite element functions S h be spanned by the basis {φ 1,..., φ n}. We construct the basis {µ 1,..., µ n} of the space M h of test functions so that the basis functions of S h and M h satisfy a condition of biorthogonality relation µ i φ j dx = c jδ ij, c j 0, 1 i, j n, (1) Ω where n := dim M h = dim S h, δ ij is the Kronecker symbol, and c j a scaling factor, and is always positive. Oblique vs Orthogonal Projection It is easy to verify that Q h is a projection onto the space S h. We note that Q h is not the orthogonal projection onto S h but an oblique projection onto it. Refer to [Gal03, Szy06] for more detail. Orthogonal projection is unique, but the oblique projection depends on a direction. Projection of OP onto OX Orthogonal: OR Oblique along PS: OS P O R S Y X
24 Orthogonal Projection Properties of the Gradient Recovery Operator The following lemma establishes the approximation property of operator Q h for a function v H 1+s (Ω). Lemma For a function v H s+1 (Ω), s > 0, there exists a constant C independent of the mesh-size h so that v Q h v L 2 (Ω) Ch 1+r v H r+1 (Ω) v Q h v H 1 (Ω) Ch r v H r+1 (Ω), (2) where r := min{s, p}.
25 Orthogonal Projection Properties of the Gradient Recovery Operator We show that operator Q h has the same approximation property as the orthogonal projection operator. However, the new operator is more efficient than the old one. Hence, it is ideal to use this operator as a gradient recovery operator in the a posteriori error estimation. Theorem We have I h u P h I h u L 2 (Ω) I h u Q h I h u L 2 (Ω) 1 β I hu P h I h u L 2 (Ω). (3) where β > 0 and P h is the vector version of the L 2 -projection operator P h.
26 Orthogonal Projection The Gradient Recovery Operator: Applications Since S h and M h form a biorthogonal system, we can write Q h as n µi v dx Ω Q h v = φ i (locality). (4) c i If v has compact support, then Q h v has also compact support. i=1 Since the error estimator based on an orthogonal projection is asymptotically exact for mildly unstructured meshes, the error estimator based on this oblique projection is also asymptotically exact for such meshes. However, the orthogonal projection is not local and hence also expensive to compute. Our new oblique projection thus gives a local gradient recovery operator, which is easy and cheap to compute. The error estimator on element T is defined as η T = Q h u h u h L 2 (T ), where u h is the finite element solution of some boundary value problem.
27 Orthogonal Projection A. Galántai. Projectors and Projection Methods. Kluwer Academic Publishers, Dordrecht, D.B. Szyld. The many proofs of an identity on the norm of oblique projections. Numerical Algorithms, 42: , 2006.
ETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 37, pp. 166-172, 2010. Copyright 2010,. ISSN 1068-9613. ETNA A GRADIENT RECOVERY OPERATOR BASED ON AN OBLIQUE PROJECTION BISHNU P. LAMICHHANE Abstract.
More informationarxiv: v1 [math.na] 1 May 2013
arxiv:3050089v [mathna] May 03 Approximation Properties of a Gradient Recovery Operator Using a Biorthogonal System Bishnu P Lamichhane and Adam McNeilly May, 03 Abstract A gradient recovery operator based
More informationA gradient recovery method based on an oblique projection and boundary modification
ANZIAM J. 58 (CTAC2016) pp.c34 C45, 2017 C34 A gradient recovery method based on an oblique projection and boundary modification M. Ilyas 1 B. P. Lamichhane 2 M. H. Meylan 3 (Received 24 January 2017;
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 informationScientific 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 informationNumerical solution of surface PDEs with Radial Basis Functions
Numerical solution of surface PDEs with Radial Basis Functions Andriy Sokolov Institut für Angewandte Mathematik (LS3) TU Dortmund andriy.sokolov@math.tu-dortmund.de TU Dortmund June 1, 2017 Outline 1
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 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 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 informationA Framework for Analyzing and Constructing Hierarchical-Type A Posteriori Error Estimators
A Framework for Analyzing and Constructing Hierarchical-Type A Posteriori Error Estimators Jeff Ovall University of Kentucky Mathematics www.math.uky.edu/ jovall jovall@ms.uky.edu Kentucky Applied and
More informationNew class of finite element methods: weak Galerkin methods
New class of finite element methods: weak Galerkin methods Xiu Ye University of Arkansas at Little Rock Second order elliptic equation Consider second order elliptic problem: a u = f, in Ω (1) u = 0, on
More informationASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR THE POINTWISE GRADIENT ERROR ON EACH ELEMENT IN IRREGULAR MESHES. PART II: THE PIECEWISE LINEAR CASE
MATEMATICS OF COMPUTATION Volume 73, Number 246, Pages 517 523 S 0025-5718(0301570-9 Article electronically published on June 17, 2003 ASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR TE POINTWISE GRADIENT
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationLECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)
LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,
More informationPIECEWISE LINEAR FINITE ELEMENT METHODS ARE NOT LOCALIZED
PIECEWISE LINEAR FINITE ELEMENT METHODS ARE NOT LOCALIZED ALAN DEMLOW Abstract. Recent results of Schatz show that standard Galerkin finite element methods employing piecewise polynomial elements of degree
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 informationSpline Element Method for Partial Differential Equations
for Partial Differential Equations Department of Mathematical Sciences Northern Illinois University 2009 Multivariate Splines Summer School, Summer 2009 Outline 1 Why multivariate splines for PDEs? Motivation
More informationSparse Approximation of Signals with Highly Coherent Dictionaries
Sparse Approximation of Signals with Highly Coherent Dictionaries Bishnu P. Lamichhane and Laura Rebollo-Neira b.p.lamichhane@aston.ac.uk, rebollol@aston.ac.uk Support from EPSRC (EP/D062632/1) is acknowledged
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 informationInterpolation. 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter
Key References: Interpolation 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter 6. 2. Press, W. et. al. Numerical Recipes in C, Cambridge: Cambridge University Press. Chapter 3
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 informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationThe Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods
The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods by Hae-Soo Oh Department of Mathematics, University of North Carolina at Charlotte, Charlotte, NC 28223 June
More informationNodal O(h 4 )-superconvergence of piecewise trilinear FE approximations
Preprint, Institute of Mathematics, AS CR, Prague. 2007-12-12 INSTITTE of MATHEMATICS Academy of Sciences Czech Republic Nodal O(h 4 )-superconvergence of piecewise trilinear FE approximations Antti Hannukainen
More informationA posteriori error estimation for elliptic problems
A posteriori error estimation for elliptic problems Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in
More informationIterative methods for positive definite linear systems with a complex shift
Iterative methods for positive definite linear systems with a complex shift William McLean, University of New South Wales Vidar Thomée, Chalmers University November 4, 2011 Outline 1. Numerical solution
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
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 information1 Math 241A-B Homework Problem List for F2015 and W2016
1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let
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 informationMath 108b: Notes on the Spectral Theorem
Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator
More informationSemi-Lagrangian Formulations for Linear Advection Equations and Applications to Kinetic Equations
Semi-Lagrangian Formulations for Linear Advection and Applications to Kinetic Department of Mathematical and Computer Science Colorado School of Mines joint work w/ Chi-Wang Shu Supported by NSF and AFOSR.
More informationECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis
ECE 8201: Low-dimensional Signal Models for High-dimensional Data Analysis Lecture 7: Matrix completion Yuejie Chi The Ohio State University Page 1 Reference Guaranteed Minimum-Rank Solutions of Linear
More informationCubic Splines; Bézier Curves
Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471
More informationIsogeometric Analysis:
Isogeometric Analysis: some approximation estimates for NURBS L. Beirao da Veiga, A. Buffa, Judith Rivas, G. Sangalli Euskadi-Kyushu 2011 Workshop on Applied Mathematics BCAM, March t0th, 2011 Outline
More informationKarhunen-Loève Approximation of Random Fields Using Hierarchical Matrix Techniques
Institut für Numerische Mathematik und Optimierung Karhunen-Loève Approximation of Random Fields Using Hierarchical Matrix Techniques Oliver Ernst Computational Methods with Applications Harrachov, CR,
More informationSubdiffusion in a nonconvex polygon
Subdiffusion in a nonconvex polygon Kim Ngan Le and William McLean The University of New South Wales Bishnu Lamichhane University of Newcastle Monash Workshop on Numerical PDEs, February 2016 Outline Time-fractional
More informationAccuracy, Precision and Efficiency in Sparse Grids
John, Information Technology Department, Virginia Tech.... http://people.sc.fsu.edu/ jburkardt/presentations/ sandia 2009.pdf... Computer Science Research Institute, Sandia National Laboratory, 23 July
More informationGeometric Modeling Summer Semester 2010 Mathematical Tools (1)
Geometric Modeling Summer Semester 2010 Mathematical Tools (1) Recap: Linear Algebra Today... Topics: Mathematical Background Linear algebra Analysis & differential geometry Numerical techniques Geometric
More informationEfficient Solvers for Stochastic Finite Element Saddle Point Problems
Efficient Solvers for Stochastic Finite Element Saddle Point Problems Catherine E. Powell c.powell@manchester.ac.uk School of Mathematics University of Manchester, UK Efficient Solvers for Stochastic Finite
More informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
More informationChapter 1 Numerical approximation of data : interpolation, least squares method
Chapter 1 Numerical approximation of data : interpolation, least squares method I. Motivation 1 Approximation of functions Evaluation of a function Which functions (f : R R) can be effectively evaluated
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 informationFitting multidimensional data using gradient penalties and combination techniques
1 Fitting multidimensional data using gradient penalties and combination techniques Jochen Garcke and Markus Hegland Mathematical Sciences Institute Australian National University Canberra ACT 0200 jochen.garcke,markus.hegland@anu.edu.au
More informationarxiv: v1 [math.na] 19 Nov 2018
QUASINORMS IN SEMILINEAR ELLIPTIC PROBLEMS JAMES JACKAMAN AND TRISTAN PRYER arxiv:1811.07816v1 [math.na] 19 Nov 2018 (1.1) Abstract. In this note we examine the a priori and a posteriori analysis of discontinuous
More informationCubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines
Cubic Splines MATH 375 J. Robert Buchanan Department of Mathematics Fall 2006 Introduction Given data {(x 0, f(x 0 )), (x 1, f(x 1 )),...,(x n, f(x n ))} which we wish to interpolate using a polynomial...
More informationSpace-time sparse discretization of linear parabolic equations
Space-time sparse discretization of linear parabolic equations Roman Andreev August 2, 200 Seminar for Applied Mathematics, ETH Zürich, Switzerland Support by SNF Grant No. PDFMP2-27034/ Part of PhD thesis
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 informationLINEAR SYSTEMS (11) Intensive Computation
LINEAR SYSTEMS () Intensive Computation 27-8 prof. Annalisa Massini Viviana Arrigoni EXACT METHODS:. GAUSSIAN ELIMINATION. 2. CHOLESKY DECOMPOSITION. ITERATIVE METHODS:. JACOBI. 2. GAUSS-SEIDEL 2 CHOLESKY
More informationA POSTERIORI ERROR ESTIMATES BY RECOVERED GRADIENTS IN PARABOLIC FINITE ELEMENT EQUATIONS
A POSTERIORI ERROR ESTIMATES BY RECOVERED GRADIENTS IN PARABOLIC FINITE ELEMENT EQUATIONS D. LEYKEKHMAN AND L. B. WAHLBIN Abstract. This paper considers a posteriori error estimates by averaged gradients
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 informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationA Mixed Nonconforming Finite Element for Linear Elasticity
A Mixed Nonconforming Finite Element for Linear Elasticity Zhiqiang Cai, 1 Xiu Ye 2 1 Department of Mathematics, Purdue University, West Lafayette, Indiana 47907-1395 2 Department of Mathematics and Statistics,
More informationMathematics Research Report No. MRR 003{96, HIGH RESOLUTION POTENTIAL FLOW METHODS IN OIL EXPLORATION Stephen Roberts 1 and Stephan Matthai 2 3rd Febr
HIGH RESOLUTION POTENTIAL FLOW METHODS IN OIL EXPLORATION Stephen Roberts and Stephan Matthai Mathematics Research Report No. MRR 003{96, Mathematics Research Report No. MRR 003{96, HIGH RESOLUTION POTENTIAL
More informationProjected Surface Finite Elements for Elliptic Equations
Available at http://pvamu.edu/aam Appl. Appl. Math. IN: 1932-9466 Vol. 8, Issue 1 (June 2013), pp. 16 33 Applications and Applied Mathematics: An International Journal (AAM) Projected urface Finite Elements
More informationDISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS
DISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS Sergey Korotov BCAM Basque Center for Applied Mathematics http://www.bcamath.org 1 The presentation is based on my collaboration with several
More informationA mixed finite element method for nonlinear and nearly incompressible elasticity based on biorthogonal systems
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 2000; 00:1 6 [Version: 2002/09/18 v2.02] A mixed finite element method for nonlinear and nearly incompressible elasticity
More informationA Primal-Dual Weak Galerkin Finite Element Method for Second Order Elliptic Equations in Non-Divergence Form
A Primal-Dual Weak Galerkin Finite Element Method for Second Order Elliptic Equations in Non-Divergence Form Chunmei Wang Visiting Assistant Professor School of Mathematics Georgia Institute of Technology
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 informationNumerical differentiation by means of Legendre polynomials in the presence of square summable noise
www.oeaw.ac.at Numerical differentiation by means of Legendre polynomials in the presence of square summable noise S. Lu, V. Naumova, S. Pereverzyev RICAM-Report 2012-15 www.ricam.oeaw.ac.at Numerical
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More information10 The Finite Element Method for a Parabolic Problem
1 The Finite Element Method for a Parabolic Problem In this chapter we consider the approximation of solutions of the model heat equation in two space dimensions by means of Galerkin s method, using piecewise
More informationExperiences with Model Reduction and Interpolation
Experiences with Model Reduction and Interpolation Paul Constantine Stanford University, Sandia National Laboratories Qiqi Wang (MIT) David Gleich (Purdue) Emory University March 7, 2012 Joe Ruthruff (SNL)
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 informationOn solving linear systems arising from Shishkin mesh discretizations
On solving linear systems arising from Shishkin mesh discretizations Petr Tichý Faculty of Mathematics and Physics, Charles University joint work with Carlos Echeverría, Jörg Liesen, and Daniel Szyld October
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 informationScalable kernel methods and their use in black-box optimization
with derivatives Scalable kernel methods and their use in black-box optimization David Eriksson Center for Applied Mathematics Cornell University dme65@cornell.edu November 9, 2018 1 2 3 4 1/37 with derivatives
More informationBasic Concepts of Adaptive Finite Element Methods for Elliptic Boundary Value Problems
Basic Concepts of Adaptive Finite lement Methods for lliptic Boundary Value Problems Ronald H.W. Hoppe 1,2 1 Department of Mathematics, University of Houston 2 Institute of Mathematics, University of Augsburg
More information1. Introduction. The Stokes problem seeks unknown functions u and p satisfying
A DISCRETE DIVERGENCE FREE WEAK GALERKIN FINITE ELEMENT METHOD FOR THE STOKES EQUATIONS LIN MU, JUNPING WANG, AND XIU YE Abstract. A discrete divergence free weak Galerkin finite element method is developed
More informationStatistical Geometry Processing Winter Semester 2011/2012
Statistical Geometry Processing Winter Semester 2011/2012 Linear Algebra, Function Spaces & Inverse Problems Vector and Function Spaces 3 Vectors vectors are arrows in space classically: 2 or 3 dim. Euclidian
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 informationDiscontinuous Galerkin Methods
Discontinuous Galerkin Methods Joachim Schöberl May 20, 206 Discontinuous Galerkin (DG) methods approximate the solution with piecewise functions (polynomials), which are discontinuous across element interfaces.
More informationAn Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace
An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace Takao Fujimoto Abstract. This research memorandum is aimed at presenting an alternative proof to a well
More informationMatrix square root and interpolation spaces
Matrix square root and interpolation spaces Mario Arioli and Daniel Loghin m.arioli@rl.ac.uk STFC-Rutherford Appleton Laboratory, and University of Birmingham Sparse Days,CERFACS, Toulouse, 2008 p.1/30
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 informationChapter 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
More informationNumerical Analysis and Methods for PDE I
Numerical Analysis and Methods for PDE I A. J. Meir Department of Mathematics and Statistics Auburn University US-Africa Advanced Study Institute on Analysis, Dynamical Systems, and Mathematical Modeling
More informationHamburger Beiträge zur Angewandten Mathematik
Hamburger Beiträge zur Angewandten Mathematik Numerical analysis of a control and state constrained elliptic control problem with piecewise constant control approximations Klaus Deckelnick and Michael
More informationGeometric Modeling Summer Semester 2012 Linear Algebra & Function Spaces
Geometric Modeling Summer Semester 2012 Linear Algebra & Function Spaces (Recap) Announcement Room change: On Thursday, April 26th, room 024 is occupied. The lecture will be moved to room 021, E1 4 (the
More informationA truly meshless Galerkin method based on a moving least squares quadrature
A truly meshless Galerkin method based on a moving least squares quadrature Marc Duflot, Hung Nguyen-Dang Abstract A new body integration technique is presented and applied to the evaluation of the stiffness
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 informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University The Residual and Error of Finite Element Solutions Mixed BVP of Poisson Equation
More informationPhysics 331 Introduction to Numerical Techniques in Physics
Physics 331 Introduction to Numerical Techniques in Physics Instructor: Joaquín Drut Lecture 12 Last time: Polynomial interpolation: basics; Lagrange interpolation. Today: Quick review. Formal properties.
More informationPreliminary Examination in Numerical Analysis
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More informationAlgorithms for Scientific Computing
Algorithms for Scientific Computing Finite Element Methods Michael Bader Technical University of Munich Summer 2016 Part I Looking Back: Discrete Models for Heat Transfer and the Poisson Equation Modelling
More informationRemarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable?
Remarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable? Thomas Apel, Hans-G. Roos 22.7.2008 Abstract In the first part of the paper we discuss minimal
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 informationOn angle conditions in the finite element method. Institute of Mathematics, Academy of Sciences Prague, Czech Republic
On angle conditions in the finite element method Michal Křížek Institute of Mathematics, Academy of Sciences Prague, Czech Republic Joint work with Jan Brandts (University of Amsterdam), Antti Hannukainen
More informationEECS 275 Matrix Computation
EECS 275 Matrix Computation Ming-Hsuan Yang Electrical Engineering and Computer Science University of California at Merced Merced, CA 95344 http://faculty.ucmerced.edu/mhyang Lecture 9 1 / 23 Overview
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 informationOn an Approximation Result for Piecewise Polynomial Functions. O. Karakashian
BULLETIN OF THE GREE MATHEMATICAL SOCIETY Volume 57, 010 (1 7) On an Approximation Result for Piecewise Polynomial Functions O. arakashian Abstract We provide a new approach for proving approximation results
More informationMODULE 8 Topics: Null space, range, column space, row space and rank of a matrix
MODULE 8 Topics: Null space, range, column space, row space and rank of a matrix Definition: Let L : V 1 V 2 be a linear operator. The null space N (L) of L is the subspace of V 1 defined by N (L) = {x
More informationPiecewise Constant Aquifer Parameter Identification Recovery
19th International Congress on Modelling and Simulation, Perth, Australia, 12 16 December 2011 http://mssanz.org.au/modsim2011 Piecewise Constant Aquifer Parameter Identification Recovery R. S. Anderssen
More informationACM/CMS 107 Linear Analysis & Applications Fall 2017 Assignment 2: PDEs and Finite Element Methods Due: 7th November 2017
ACM/CMS 17 Linear Analysis & Applications Fall 217 Assignment 2: PDEs and Finite Element Methods Due: 7th November 217 For this assignment the following MATLAB code will be required: Introduction http://wwwmdunloporg/cms17/assignment2zip
More informationIntroduction to Partial Differential Equations
Introduction to Partial Differential Equations Partial differential equations arise in a number of physical problems, such as fluid flow, heat transfer, solid mechanics and biological processes. These
More informationOrthogonal polynomials
Orthogonal polynomials Gérard MEURANT October, 2008 1 Definition 2 Moments 3 Existence 4 Three-term recurrences 5 Jacobi matrices 6 Christoffel-Darboux relation 7 Examples of orthogonal polynomials 8 Variable-signed
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 informationfor all subintervals I J. If the same is true for the dyadic subintervals I D J only, we will write ϕ BMO d (J). In fact, the following is true
3 ohn Nirenberg inequality, Part I A function ϕ L () belongs to the space BMO() if sup ϕ(s) ϕ I I I < for all subintervals I If the same is true for the dyadic subintervals I D only, we will write ϕ BMO
More informationLocal pointwise a posteriori gradient error bounds for the Stokes equations. Stig Larsson. Heraklion, September 19, 2011 Joint work with A.
Local pointwise a posteriori gradient error bounds for the Stokes equations Stig Larsson Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg Heraklion, September
More information