Math 660-Lecture 15: Finite element spaces (I)
|
|
- Sheryl White
- 5 years ago
- Views:
Transcription
1 Math 660-Lecture 15: Finite element spaces (I) (Chapter 3, 4.2, 4.3) Before we introduce the concrete spaces, let s first of all introduce the following important lemma. Theorem 1. Let V h consists of piecewise polynomials. Then, V h H 1 (Ω) V h C 0 ( Ω) and V h H 2 (Ω) V h C 1 ( Ω) Here C 0 simply means continuous functions. Here, one only needs to show that H 1 C 0. The piecewise polynomial and continuous condition obviously implies in H 1 (if not continuous, the weak derivative will be infinity at the interface. Such distributions are not in L 2.) For H 1 C 0, similarly, if not continuous, the weak derivative doesn t exist. Remark: Consider an open set Ω with smooth boundary. For general Sobolev spaces, if p > n, then Wp k C k [n/p] 1,γ where 0 γ < 1. For n = 1, the continuity can be ensured if p = n. Hence, H 2 = W2 2 for n = 2 is in C 0,γ for any γ < 1 but not C 1 in general. H 1 = W2 1 doesn t imply C0 and there are counterexamples. However, if we talk about piecewise polynomials, the above theorem is true. 1 1D spaces Consider the interval Ω = [a, b] and a subdivision (triangulation) T h = {[x j, x j+1 ]} and K = [x j, x j+1 ]. Define P r (K) = {v : v is a polynomial with degree r on K} Consider the linear function P 1 (K). P 1 (K) can be determined uniquely by the values at the node. Hence, if we make up a finite element space V h such that each function in V h when restricted on K belongs to P 1 (K), then V h is C 0 ([a, b]) and therefore in H 1. Consider P 2 (K). It has three coefficients. Then, it s impossible to construct C 1 functions on the whole Ω since there will be four requirements. The function on each K can be determined by the values at the endpoints and the value at the midpoint. Functions generated in such a way is still in H 1 (Ω). Using P 3 (K) functions, we can construct a finite element space V h C 1 (Ω) and thus in H 2 (Ω). 1
2 See the pictures on P81. Example: solve the 1d problem u (x) = f with u(0) = u (0) = u(1) = u (1) = 0. Solution. We first of all get the weak formulation. Multiply a test function v and integrate: 1 0 f(x)v(x)dx = u vdx = u v 1 0 u v dx = (u v u v ) 1 0+ u v dx First of all, for the integral u v dx to make sense, we need both u and v to be in H 2. Secondly, if we require v H0 2 H2 (which means v, v both vanish at the endpoints), then we don t have the boundary terms. Hence, a suitable weak formulation is: Find u H0 2 ([0, 1]) such that 1 a(u, v) = u v dx = f(x)v(x)dx, v H Now considering using Galerkin s FEM. We need a finite element space to be in H 2. If we use piecewise polynomials, then the functions should be in C 1. From what we just studied, clearly, we should use P 3 (K). Then, for node x j, we need two functions: φ j and ϕ j such that (1). φ j (x i ) = δ ij, φ j (x i) = 0; (2). ϕ j (x i ) = 0 and ϕ j (x i) = δ ij. Each of them are cubic on the interval. The finite element space is then V h = { j a j φ j + j b j ϕ j } These basis functions can be constructed using Hermite interpolation. You ll finish this in HW3. 2 2D spaces: Triangular elements Ω R 2 and T h = {K} is a collection of triangles for the triangulation. P r (K) = {v v is a polynomial of deg r on K}. Lemma 1. dim(p r ) = C 2 r+2 = (r+2)(r+1) 2 2
3 Proof. the basis is x i 1 xj 2. 0 i + j r. Consider we divide r units into 3 distinct groups. Let s say the number of the units in the first group is i and number of units in the second group is j. Clearly, one such division corresponds to uniquely an (i, j) pair. The number of such divisions are equivalent to choosing two from r +2 positions and the chosen two positions will be the partition boundary. 2.1 Examples of finite element spaces Consider the following finite element space: V h = {v is defined on Ω : v K P 1 (K)} Since dim(p 1 (K)) = 3, then there are 3 degrees of freedom. a i, 1 i 3 be the vertices of K. Then, we claim: Let Theorem 2. Given α i, 1 i 3, there is uniquely a function v P 1 (K) such that v(a i ) = α i. In other words, the function on K is uniquely determined by its values at the vertices. Proof. The number of unknowns (dimension, which is 3) equals the number of conditions given. Hence, we have a 3 by 3 linear system. For such a system, the solution exists uniquely is equivalent to saying the homogeneous solution is trivial. In other words, it suffices to show that if v = C 1 + C 2 x 1 + C 3 x 2 is zero on a i, then v = 0. The line a 1 a 2 has an equation of the form d 1 x 1 + d 2 x 2 + d 3 = 0. Since v vanishes on this edge, we must have v = C(x)(d 1 x 1 + d 2 x 2 + d 3 ). The degree of v is at most 1, and therefore C(x) = C. Further, a 3 is not on the line, we must have d 1 a d 2a d 3 0. Hence, C = 0. Let s consider constructing the basis functions of V h. By the theorem just proved, we need to specify the values at the nodes only. Let λ i P 1 (K) and λ i (a j ) = δ ij. λ 1 = µ(d 1 x 1 + d 2 x 2 + d 3 ) where d 1 x is the equation of a 2 a 3. Then, µ is determined uniquely by the condition λ 1 (a 1 ) = 1. Now, suppose we are given v(a i ). We define the finite element space to be 3 V h = {v : v K = v(a i )λ i }. i=1 3
4 Theorem 3. V h C 0 (Ω). By this definition, w V h is continuous at the nodes. Consider one edge e. Suppose e is the intersection between K 1 and K 2. On e, we define g = w K1 w K2. g = c 1 x 1 + c 2 x 2 + c 3 is linear on e. It is zero at the endpoints. Then, it must be zero on the whole line containing e since it is linear. (g itself may not be a zero function.) Hence, w is continuous at the edge. Consider V h = {v : v K P 2 (K), K T h } The dimension of P 2 (K) is 6. Let a ij = 1 2 (ai + a j ) be the midpoint of a i and a j. Then, we have Theorem 4. v P 2 (K) is uniquely determined by the values at a i, 1 i 3 and a ij, i < j. Proof. Again, the unknowns (dimension) equals the conditions. suffices to show that if v vanishes at these points, then it s zero. First of all, it vanishes on a 1 a 2 because a 1D quadratic function is zero if it s zero on three points. Then, v a 1 a 2 = h(x)λ 3 where λ 3 is the basis function in the previous example (linear function and is only 1 at a 3 ). Since v is quadratic, h is linear. Since v also vanishes on a 1 a 3, then h vanishes on a 1 a 3. Hence, h = Cλ 2. v = Cλ 2 λ 3. Finally, v also vanishes on a 23, then C has to be zero. Clearly, λ i (2λ i 1) is a quadratic function that is only 1 at a i and vanishes at the other five points. 4λ i λ j is the quadratic function that is 1 only at a ij. Hence, in general, It v K = 3 v(a i )λ i (2λ i 1) + v(a ij )4λ i λ j i<j i=1 Then, we actually only have V h C 0 (Ω). V h is not in C 1. P 2 (K) is not enough for us to make C 1 functions. To have C 1 functions, we actually need P 5 (K). dim(p 5 (K)) = 21. Theorem 5. v P 5 (K) is uniquely determined by D α v(a i ), α 2 and v(a ij )/ n. 4
5 Proof. Let s show that if on K, for v these values are zero, then v = 0. On a 2 a 3, noting first that v = v/ s = 2 v/ s 2 = 0 at a 2 and a 3 (where s is the arc length of a 2 a 3 ), we conclude that v = 0 on this edge since there are 6 conditions for a five degree 1D polynomial. Secondly, g = v/ n as a function on a 2 a 3 is a polynomial of degree at most 4. g(a 23 ) = 0 by the given condition. g = g/ s = 0 at a 2 and a 3 by the fact that D α v = 0. Hence g = v/ n should be zero. (we have used 10 conditions). Then, we must have that v = λ 2 1 h. Similarly, λ2 2, λ2 3 can divide v as well. These polynomials don t have common factors. Then, λ 2 1 λ2 2 λ2 3 can divide v. Since v is of only 5 degree, we must have v = 0. Using what we have proved, we can construct V h = {v : v K P 5 (K)} such that if w V h, then w has continuous D α w at the vertices and continuous w/ n at the midpoints. Then, we can show that w is C 1 on one edge. Then, V h C 1 (Ω). 5
Scientific 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 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 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 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 informationLECTURE 5, FRIDAY
LECTURE 5, FRIDAY 20.02.04 FRANZ LEMMERMEYER Before we start with the arithmetic of elliptic curves, let us talk a little bit about multiplicities, tangents, and singular points. 1. Tangents How do we
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 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 informationFinite Elements. Colin Cotter. January 18, Colin Cotter FEM
Finite Elements January 18, 2019 The finite element Given a triangulation T of a domain Ω, finite element spaces are defined according to 1. the form the functions take (usually polynomial) when restricted
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 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 Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Polynomial Interpolation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 24, 2013 1.1 Introduction We first look at some examples. Lookup table for f(x) = 2 π x 0 e x2
More informationPDE & FEM TERMINOLOGY. BASIC PRINCIPLES OF FEM.
PDE & FEM TERMINOLOGY. BASIC PRINCIPLES OF FEM. Sergey Korotov Basque Center for Applied Mathematics / IKERBASQUE http://www.bcamath.org & http://www.ikerbasque.net 1 Introduction The analytical solution
More informationMixed Hybrid Finite Element Method: an introduction
Mixed Hybrid Finite Element Method: an introduction First lecture Annamaria Mazzia Dipartimento di Metodi e Modelli Matematici per le Scienze Applicate Università di Padova mazzia@dmsa.unipd.it Scuola
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 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 informationX. Numerical Methods
X. Numerical Methods. Taylor Approximation Suppose that f is a function defined in a neighborhood of a point c, and suppose that f has derivatives of all orders near c. In section 5 of chapter 9 we introduced
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 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 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 informationIntroduction to Computer Graphics. Modeling (1) April 13, 2017 Kenshi Takayama
Introduction to Computer Graphics Modeling (1) April 13, 2017 Kenshi Takayama Parametric curves X & Y coordinates defined by parameter t ( time) Example: Cycloid x t = t sin t y t = 1 cos t Tangent (aka.
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 informationLecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015 2 Contents 1.1 Introduction................................ 3 1.1.1
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 informationAn a posteriori error estimate and a Comparison Theorem for the nonconforming P 1 element
Calcolo manuscript No. (will be inserted by the editor) An a posteriori error estimate and a Comparison Theorem for the nonconforming P 1 element Dietrich Braess Faculty of Mathematics, Ruhr-University
More informationDepartment of Mathematics, University of Wisconsin-Madison Math 114 Worksheet Sections (4.1),
Department of Mathematics, University of Wisconsin-Madison Math 114 Worksheet Sections (4.1), 4.-4.6 1. Find the polynomial function with zeros: -1 (multiplicity ) and 1 (multiplicity ) whose graph passes
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 informationOrthogonality of hat functions in Sobolev spaces
1 Orthogonality of hat functions in Sobolev spaces Ulrich Reif Technische Universität Darmstadt A Strobl, September 18, 27 2 3 Outline: Recap: quasi interpolation Recap: orthogonality of uniform B-splines
More informationLinear Systems. Math A Bianca Santoro. September 23, 2016
Linear Systems Math A4600 - Bianca Santoro September 3, 06 Goal: Understand how to solve Ax = b. Toy Model: Let s study the following system There are two nice ways of thinking about this system: x + y
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 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 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 information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationA sharp upper bound on the approximation order of smooth bivariate pp functions C. de Boor and R.Q. Jia
A sharp upper bound on the approximation order of smooth bivariate pp functions C. de Boor and R.Q. Jia Introduction It is the purpose of this note to show that the approximation order from the space Π
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 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 informationA P4 BUBBLE ENRICHED P3 DIVERGENCE-FREE FINITE ELEMENT ON TRIANGULAR GRIDS
A P4 BUBBLE ENRICHED P3 DIVERGENCE-FREE FINITE ELEMENT ON TRIANGULAR GRIDS SHANGYOU ZHANG DEDICATED TO PROFESSOR PETER MONK ON THE OCCASION OF HIS 6TH BIRTHDAY Abstract. On triangular grids, the continuous
More informationElliptic Curves and Public Key Cryptography
Elliptic Curves and Public Key Cryptography Jeff Achter January 7, 2011 1 Introduction to Elliptic Curves 1.1 Diophantine equations Many classical problems in number theory have the following form: Let
More informationGlobal polynomial interpolants suffer from the Runge Phenomenon if the data sites (nodes) are not chosen correctly.
Piecewise polynomial interpolation Global polynomial interpolants suffer from the Runge Phenomenon if the data sites (nodes) are not chosen correctly. In many applications, one does not have the freedom
More informationMath From Scratch Lesson 37: Roots of Cubic Equations
Math From Scratch Lesson 7: Roots of Cubic Equations W. Blaine Dowler September 1, 201 Contents 1 Defining Cubic Equations 1 2 The Roots of Cubic Equations 1 2.1 Case 1: a 2 = a 1 = 0.........................
More informationGrade 11/12 Math Circles Elliptic Curves Dr. Carmen Bruni November 4, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 11/12 Math Circles Elliptic Curves Dr. Carmen Bruni November 4, 2015 Revisit the Congruent Number
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 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 informationElliptic Curves. Dr. Carmen Bruni. November 4th, University of Waterloo
University of Waterloo November 4th, 2015 Revisit the Congruent Number Problem Congruent Number Problem Determine which positive integers N can be expressed as the area of a right angled triangle with
More informationMATH 115, SUMMER 2012 LECTURE 12
MATH 115, SUMMER 2012 LECTURE 12 JAMES MCIVOR - last time - we used hensel s lemma to go from roots of polynomial equations mod p to roots mod p 2, mod p 3, etc. - from there we can use CRT to construct
More information3.3 Limits and Infinity
Calculus Maimus. Limits Infinity Infinity is not a concrete number, but an abstract idea. It s not a destination, but a really long, never-ending journey. It s one of those mind-warping ideas that is difficult
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 informationTetrahedral C m Interpolation by Rational Functions
Tetrahedral C m Interpolation by Rational Functions Guoliang Xu State Key Laboratory of Scientific and Engineering Computing, ICMSEC, Chinese Academy of Sciences Chuan I Chu Weimin Xue Department of Mathematics,
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationPOLYNOMIAL EXPRESSIONS PART 1
POLYNOMIAL EXPRESSIONS PART 1 A polynomial is an expression that is a sum of one or more terms. Each term consists of one or more variables multiplied by a coefficient. Coefficients can be negative, so
More informationChapter 5 A priori error estimates for nonconforming finite element approximations 5.1 Strang s first lemma
Chapter 5 A priori error estimates for nonconforming finite element approximations 51 Strang s first lemma We consider the variational equation (51 a(u, v = l(v, v V H 1 (Ω, and assume that the conditions
More informationUpdated: January 16, 2016 Calculus II 7.4. Math 230. Calculus II. Brian Veitch Fall 2015 Northern Illinois University
Math 30 Calculus II Brian Veitch Fall 015 Northern Illinois University Integration of Rational Functions by Partial Fractions From algebra, we learned how to find common denominators so we can do something
More informationLECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).
CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f
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 informationVARIETIES WITHOUT EXTRA AUTOMORPHISMS I: CURVES BJORN POONEN
VARIETIES WITHOUT EXTRA AUTOMORPHISMS I: CURVES BJORN POONEN Abstract. For any field k and integer g 3, we exhibit a curve X over k of genus g such that X has no non-trivial automorphisms over k. 1. Statement
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 informationLocal properties of plane algebraic curves
Chapter 7 Local properties of plane algebraic curves Throughout this chapter let K be an algebraically closed field of characteristic zero, and as usual let A (K) be embedded into P (K) by identifying
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 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 informationLecture VI: Projective varieties
Lecture VI: Projective varieties Jonathan Evans 28th October 2010 Jonathan Evans () Lecture VI: Projective varieties 28th October 2010 1 / 24 I will begin by proving the adjunction formula which we still
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 information1. Find the domain of the following functions. Write your answer using interval notation. (9 pts.)
MATH- Sample Eam Spring 7. Find the domain of the following functions. Write your answer using interval notation. (9 pts.) a. 9 f ( ) b. g ( ) 9 8 8. Write the equation of the circle in standard form given
More information3.1 Interpolation and the Lagrange Polynomial
MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate
More informationMath 203A, Solution Set 6.
Math 203A, Solution Set 6. Problem 1. (Finite maps.) Let f 0,..., f m be homogeneous polynomials of degree d > 0 without common zeros on X P n. Show that gives a finite morphism onto its image. f : X P
More informationLecture Notes: African Institute of Mathematics Senegal, January Topic Title: A short introduction to numerical methods for elliptic PDEs
Lecture Notes: African Institute of Mathematics Senegal, January 26 opic itle: A short introduction to numerical methods for elliptic PDEs Authors and Lecturers: Gerard Awanou (University of Illinois-Chicago)
More informationThere is a unique function s(x) that has the required properties. It turns out to also satisfy
Numerical Analysis Grinshpan Natural Cubic Spline Let,, n be given nodes (strictly increasing) and let y,, y n be given values (arbitrary) Our goal is to produce a function s() with the following properties:
More informationarxiv: v1 [math.na] 29 Feb 2016
EFFECTIVE IMPLEMENTATION OF THE WEAK GALERKIN FINITE ELEMENT METHODS FOR THE BIHARMONIC EQUATION LIN MU, JUNPING WANG, AND XIU YE Abstract. arxiv:1602.08817v1 [math.na] 29 Feb 2016 The weak Galerkin (WG)
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 informationSection 0.2 & 0.3 Worksheet. Types of Functions
MATH 1142 NAME Section 0.2 & 0.3 Worksheet Types of Functions Now that we have discussed what functions are and some of their characteristics, we will explore different types of functions. Section 0.2
More informationNONCONFORMING MIXED ELEMENTS FOR ELASTICITY
Mathematical Models and Methods in Applied Sciences Vol. 13, No. 3 (2003) 295 307 c World Scientific Publishing Company NONCONFORMING MIXED ELEMENTS FOR ELASTICITY DOUGLAS N. ARNOLD Institute for Mathematics
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 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 informationQuestion 1: The graphs of y = p(x) are given in following figure, for some Polynomials p(x). Find the number of zeroes of p(x), in each case.
Class X - NCERT Maths EXERCISE NO:.1 Question 1: The graphs of y = p(x) are given in following figure, for some Polynomials p(x). Find the number of zeroes of p(x), in each case. (i) (ii) (iii) (iv) (v)
More informationLecture 1 INF-MAT : Chapter 2. Examples of Linear Systems
Lecture 1 INF-MAT 4350 2010: Chapter 2. Examples of Linear Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo August 26, 2010 Notation The set of natural
More informationInterpolation Theory
Numerical Analysis Massoud Malek Interpolation Theory The concept of interpolation is to select a function P (x) from a given class of functions in such a way that the graph of y P (x) passes through the
More information1. (25 points) Consider the region bounded by the curves x 2 = y 3 and y = 1. (a) Sketch both curves and shade in the region. x 2 = y 3.
Test Solutions. (5 points) Consider the region bounded by the curves x = y 3 and y =. (a) Sketch both curves and shade in the region. x = y 3 y = (b) Find the area of the region above. Solution: Observing
More informationA Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions
A Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions Zhiqiang Cai Seokchan Kim Sangdong Kim Sooryun Kong Abstract In [7], we proposed a new finite element method
More informationCauchy s Theorem (rigorous) In this lecture, we will study a rigorous proof of Cauchy s Theorem. We start by considering the case of a triangle.
Cauchy s Theorem (rigorous) In this lecture, we will study a rigorous proof of Cauchy s Theorem. We start by considering the case of a triangle. Given a certain complex-valued analytic function f(z), for
More informationLECTURE-13 : GENERALIZED CAUCHY S THEOREM
LECTURE-3 : GENERALIZED CAUCHY S THEOREM VED V. DATAR The aim of this lecture to prove a general form of Cauchy s theorem applicable to multiply connected domains. We end with computations of some real
More informationBMT 2018 Team Test Solutions March 18, 2018
. A circle with radius is inscribed in a right triangle with hypotenuse 4 as shown below. What is the area of the triangle? Note that the diagram is not to scale. 4 Answer: 9 Solution : We wish to use
More informationConstructions with ruler and compass.
Constructions with ruler and compass. Semyon Alesker. 1 Introduction. Let us assume that we have a ruler and a compass. Let us also assume that we have a segment of length one. Using these tools we can
More informationCommuting nilpotent matrices and pairs of partitions
Commuting nilpotent matrices and pairs of partitions Roberta Basili Algebraic Combinatorics Meets Inverse Systems Montréal, January 19-21, 2007 We will explain some results on commuting n n matrices and
More informationDownloaded from
Question 1: Exercise 2.1 The graphs of y = p(x) are given in following figure, for some polynomials p(x). Find the number of zeroes of p(x), in each case. (i) (ii) (iii) Page 1 of 24 (iv) (v) (v) Page
More informationSection A.6. Solving Equations. Math Precalculus I. Solving Equations Section A.6
Section A.6 Solving Equations Math 1051 - Precalculus I A.6 Solving Equations Simplify 1 2x 6 x + 2 x 2 9 A.6 Solving Equations Simplify 1 2x 6 x + 2 x 2 9 Factor: 2x 6 = 2(x 3) x 2 9 = (x 3)(x + 3) LCD
More informationMATH 20B MIDTERM #2 REVIEW
MATH 20B MIDTERM #2 REVIEW FORMAT OF MIDTERM #2 The format will be the same as the practice midterms. There will be six main questions worth 0 points each. These questions will be similar to problems you
More informationA WEAK GALERKIN MIXED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATIONS
A WEAK GALERKIN MIXED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATIONS LIN MU, JUNPING WANG, YANQIU WANG, AND XIU YE Abstract. This article introduces and analyzes a weak Galerkin mixed finite element method
More informationInterpolation and Approximation
Interpolation and Approximation The Basic Problem: Approximate a continuous function f(x), by a polynomial p(x), over [a, b]. f(x) may only be known in tabular form. f(x) may be expensive to compute. Definition:
More informationA PLANAR SOBOLEV EXTENSION THEOREM FOR PIECEWISE LINEAR HOMEOMORPHISMS
A PLANAR SOBOLEV EXTENSION THEOREM FOR PIECEWISE LINEAR HOMEOMORPHISMS EMANUELA RADICI Abstract. We prove that a planar piecewise linear homeomorphism ϕ defined on the boundary of the square can be extended
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 informationLecturer: Shuchi Chawla Topic: Inapproximability Date: 4/27/2007
CS880: Approximations Algorithms Scribe: Tom Watson Lecturer: Shuchi Chawla Topic: Inapproximability Date: 4/27/2007 So far in this course, we have been proving upper bounds on the approximation factors
More informationNumerical Integration for Multivariable. October Abstract. We consider the numerical integration of functions with point singularities over
Numerical Integration for Multivariable Functions with Point Singularities Yaun Yang and Kendall E. Atkinson y October 199 Abstract We consider the numerical integration of functions with point singularities
More information8.3 Numerical Quadrature, Continued
8.3 Numerical Quadrature, Continued Ulrich Hoensch Friday, October 31, 008 Newton-Cotes Quadrature General Idea: to approximate the integral I (f ) of a function f : [a, b] R, use equally spaced nodes
More informationFinite Element Method for Ordinary Differential Equations
52 Chapter 4 Finite Element Method for Ordinary Differential Equations In this chapter we consider some simple examples of the finite element method for the approximate solution of ordinary differential
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 informationMath 115 Spring 11 Written Homework 10 Solutions
Math 5 Spring Written Homework 0 Solutions. For following its, state what indeterminate form the its are in and evaluate the its. (a) 3x 4x 4 x x 8 Solution: This is in indeterminate form 0. Algebraically,
More informationMath 40510, Algebraic Geometry
Math 40510, Algebraic Geometry Problem Set 1, due February 10, 2016 1. Let k = Z p, the field with p elements, where p is a prime. Find a polynomial f k[x, y] that vanishes at every point of k 2. [Hint:
More informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 3. Modular arithmetic, quotients, product groups
D-MATH Algebra I HS 2013 Prof. Brent Doran Solution 3 Modular arithmetic, quotients, product groups 1. Show that the functions f = 1/x, g = (x 1)/x generate a group of functions, the law of composition
More informationSPLINE INTERPOLATION
Spline Background SPLINE INTERPOLATION Problem: high degree interpolating polynomials often have extra oscillations. Example: Runge function f(x = 1 1+4x 2, x [ 1, 1]. 1 1/(1+4x 2 and P 8 (x and P 16 (x
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 informationGeneral Form: y = a n x n + a n 1 x n a 2 x 2 + a 1 x + a 0
Families of Functions Prepared by: Sa diyya Hendrickson Name: Date: Definition: function A function f is a rule that relates two sets by assigning to some element (e.g. x) in a set A exactly one element
More informationMA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs
MA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs David L. Finn December 9th, 2004 We now start considering the basic curve elements to be used throughout this course; polynomial curves and
More information