Orthogonality of hat functions in Sobolev spaces

Size: px
Start display at page:

Download "Orthogonality of hat functions in Sobolev spaces"

Transcription

1 1 Orthogonality of hat functions in Sobolev spaces Ulrich Reif Technische Universität Darmstadt A Strobl, September 18, 27

2 2

3 3 Outline: Recap: quasi interpolation Recap: orthogonality of uniform B-splines Orthogonality of hat functions in IR d

4 4 Quasi interpolation Consider a univariate spline space S of order n with B-splines B n j. A quasi interpolant Λ of order ν is a linear operator f Λf = j (λ j f) B n j S given by functionals λ j, with Locality: λ j f depends only on f restricted to supp Bj n. Boundedness: sup j λ j < Polynomial precision: Λp = p for all p IP ν, or ideally p IP n.

5 5 Schoenberg: With µ j denoting the Greville abscissae, Λ j f = j f(µ j )B n j is a QI of second order, f Λf = O(h 2 )

6 6 Schoenberg: With µ j denoting the Greville abscissae, Λ j f = j f(µ j )B n j is a QI of second order, f Λf = O(h 2 )

7 7 Schoenberg: With µ j denoting the Greville abscissae, Λ j f = j f(µ j )B n j is a QI of second order, f Λf = O(h 2 )

8 8 Schoenberg: With µ j denoting the Greville abscissae, Λ j f = j f(µ j )B 2 j is a QI of second order, f Λf = O(h 2 ). This is already optimal for the piecewise linear case n = 2,

9 9 de Boor-Fix: For certain coefficients ψ j,k, Λ j f = j (λ j f)b n j, λ j f = n 1 k= ψ j,k D k f(µ j ), is a QI of maximal order n, f Λf = O(h n ). Example: quadratic splines with integer knots λ j f = f(j + 3/2) 1 8 f (j + 3/2)

10 de Boor-Fix

11 de Boor-Fix Least Squares

12 Interpolation

13 Interpolation Least Squares

14 12 Quasi interpolation vs. Least squares local rules for coefficients asymptotically optimal approximation order h n error not minimal wrt. norm solve global system asymptotically optimal approximation order h n error minimal wrt. norm

15 12 Quasi interpolation vs. Least squares local rules for coefficients asymptotically optimal approximation order h n error not minimal wrt. norm solve global system asymptotically optimal approximation order h n error minimal wrt. norm How to combine the advantages?

16 For polynomials: adapt the basis to the inner product. 13

17 13 For polynomials: adapt the basis to the inner product. For splines: adapt the inner product to the basis.

18 13 For polynomials: adapt the basis to the inner product. For splines: adapt the inner product to the basis. For positive weights ω := [ω,..., ω m ], (f, g) ω := m µ= ω µ µ f, µ g defines the Sobolev space H m ω (IR). The induced norm ω is equivalent to the standard norm with weights ω = = ω m = 1.

19 13 For polynomials: adapt the basis to the inner product. For splines: adapt the inner product to the basis. For positive weights ω := [ω,..., ω m ], (f, g) ω := m µ= ω µ µ f, µ g defines the Sobolev space H m ω (IR). The induced norm ω is equivalent to the standard norm with weights ω = = ω m = 1. Since B n j Hn 1 (IR), one can try to determine ω such that (B n j, B n k ) ω = δ j,k.

20 14 For uniform B-splines, this yields n conditions for the n weights in ω (B 3, B 3 ) ω = 1 (B 3, B 3 1) ω = (B 3, B 3 2) ω =

21 14 For uniform B-splines, this yields n conditions for the n weights in ω (B 3, B 3 ) ω = 1 (B 3, B 3 1) ω = (B 3, B 3 2) ω = Example: Quadratic B-splines with integer knots are orthonormal wrt. (f, g) ω(3) = f, g + f, g /4 + f, g /3.

22 15 More particular cases: n ω (n) ω 1 (n) ω 2 (n) ω 3 (n) ω 4 (n) ω 5 (n) Example: Quadratic B-splines with integer knots are orthonormal wrt. (f, g) ω(3) = f, g + f, g /4 + f, g /3.

23 16 Under mild regularity assumptions, Fourier series and transforms ˆϕ(y) := ϕ(x) exp( ixy) dx IR ϕ(y) := j Z ϕ(j) exp( ijy) are related by the Poisson summation formula ϕ(y) = k Z ˆϕ(y + 2kπ),

24 16 Under mild regularity assumptions, Fourier series and transforms ˆϕ(y) := ϕ(x) exp( ixy) dx IR ϕ(y) := j Z ϕ(j) exp( ijy) are related by the Poisson summation formula ϕ(y) = k Z ˆϕ(y + 2kπ), With B n the centered B-spline of order n, let ϕ(x) := ( B n, B n ( x) ). ω Then orthonormality is equivalent to ϕ(j) = δ j, ϕ(y) 1 ϕ(y) 1 + O(y 2n ).

25 By the convolution property of B-splines, 17 ϕ(x) := (B n, B n ( x)) ω = ˆϕ(y) = n 1 m= n 1 m= ω m ( 1) m 2m B 2n (x) ω m y 2m sinc 2n (y/2)

26 By the convolution property of B-splines, 17 ϕ(x) := (B n, B n ( x)) ω = ˆϕ(y) = n 1 m= n 1 m= ω m ( 1) m 2m B 2n (x) ω m y 2m sinc 2n (y/2) By the Poisson summation formula, ϕ(y) = k Z ˆϕ(y + 2kπ) = n 1 m= k Z = ( n 1 m= ω m y 2m sinc 2n (y/2 + kπ) ω m y 2m)( sinc 2n (y/2) + O(y 2n ) )! = 1 + O(y 2n ).

27 18 Theorem [R. 95] The sequence {Bj n, j Z} of cardinal B-splines is orthonormal in (IR) for weights ω = ω(n) defined by H n 1 ω 1/sinc 2n (y/2) = n 1 m= ω m (n)y 2m + O(y 2n ).

28 18 Theorem [R. 95] The sequence {Bj n, j Z} of cardinal B-splines is orthonormal in (IR) for weights ω = ω(n) defined by H n 1 ω 1/sinc 2n (y/2) = n 1 m= ω m (n)y 2m + O(y 2n ). For knot spacing h, weights are scaled according to ω m (n, h) := h 2m 1 ω m (n).

29 18 Theorem [R. 95] The sequence {Bj n, j Z} of cardinal B-splines is orthonormal in (IR) for weights ω = ω(n) defined by H n 1 ω 1/sinc 2n (y/2) = n 1 m= ω m (n)y 2m + O(y 2n ). For knot spacing h, weights are scaled according to ω m (n, h) := h 2m 1 ω m (n). The solution g := Λ n hf to the least squares approximation problem of f in H n 1 ω(n,h) (IR) is given by the quasi interpolant Λn h with λ n hf := (B n h, f) ω(n,h).

30 de Boor-Fix Orthogonal

31 Interpolation Orthogonal

32 21 Generalizations: approximation on bounded intervals for n 1 non-uniform B-splines obvious for n = 2 tricky for n = 3 open for n 4 uniform tensor product B-splines open for unimodular box splines

33 21 Generalizations: approximation on bounded intervals for n 1 non-uniform B-splines obvious for n = 2 tricky for n = 3 open for n 4 uniform tensor product B-splines open for unimodular box splines new: hat functions on arbitrary triangulations in IR d

34 22 Hat functions: The triangulation of a set Ω IR d consists of simplices S k, k K, and vertices V i, i I. The hat functions B i : Ω IR are defined by S k B i (V j ) = δ i,j, i, j I B i S k IP 2 (S k ), k K.

35 23 Hat functions: The orthogonality conditions (B i, B j ) Ω = δ i,j, i, j I are globally coupled. A stronger, but local condition requires orthogonality on each simplex, S k (B i, B j ) k = δ i,j, i, j I, k K.

36 24 In IR 2 : For each triangle S k, there exist 3 non-vanishing hat functions, yielding 3 homogeneous conditions for orthogonality.

37 24 In IR 2 : For each triangle S k, there exist 3 non-vanishing hat functions, yielding 3 homogeneous conditions for orthogonality. The ansatz ( (f, g) k := ωk fg + f W k g t) S k ω k >, W k spd (2 2)-matrix, provides the appropriate number of degrees of freedom.

38 25 Theorem [App, R.] On the unit triangle S := {x IR 2 : x 1 + x 2 1}, the weights ω := 6, W := [ ] 1 1/2 1/2 1 yield orthonormality.

39 26 In IR d : For each simplex S k, there exist d + 1 non-vanishing hat functions, yielding d 2 + d 2 homogeneous conditions for orthogonality. The ansatz ( (f, g) k := ωk fg + f W k g t) S k ω k >, W k spd (d d)-matrix, provides the appropriate number of degrees of freedom.

40 27 Theorem [App, R.] On the unit simplex S := {x IR d : x x d 1}, the weights ω := (d + 1)!, W := d! d + 2 d d d yield orthonormality.

41 28 For an arbitrary simplex S k, obtained from S by an affine map the weights yield orthogonality. ω k := S k = AS + a, ω det A, W k := AW At det A (A,a)

42 29 Orthogonality: Define the Sobolev type inner product (f, g) Ω := (f, g) k = ( ωk fg + f W k g t), k K k K S k then, with #B i the number of simplices in supp B i, (B i, B j ) Ω = δ i,j #B i.

43 29 Orthogonality: Define the Sobolev type inner product (f, g) Ω := (f, g) k = ( ωk fg + f W k g t), k K k K S k then, with #B i the number of simplices in supp B i, (B i, B j ) Ω = δ i,j #B i. Approximation: The solution g = Λf to the least squares approximation problem of f wrt. the inner product (, ) Ω is given by Λf = i (f, B i ) Ω #B i B i.

44 3 Discrete Variants: Denote vertices and edge midpoints of S k by P k = p 1 k. p m k and the quadratic polynomial interpolating the function f at P k by q k = Q k f. Then [f, g] Ω := k K(Q k f, Q k g) k is a discrete inner product with [B i, B j ] Ω = (Q k B i, Q k B j ) k = i, B j ) k = (B i, B j ) Ω. k K k K(B

45 31 Evaluation of [f, B i ] Ω is cheap, [f, B i ] k = (Q k f, B i ) k = V F k, F k = f(p k ), where V is independent of k. In the 2d-case, 1/

46 32 Average savings in 2d: For similar accuracy wrt. max norm, interpolation requires 4% more triangles. L 2 -norm, interpolation requires 1% more triangles.

47 32 Average savings in 2d: For similar accuracy wrt. max norm, interpolation requires 4% more triangles. L 2 -norm, interpolation requires 1% more triangles. Applications: Computer graphics? FEM Nonlinear optimization...

48 33 Conclusion: Sobolev orthogonality available for uniform B-splines Sobolev orthogonality available for hat functions in IR d Cheaper than L 2 Better than QI

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

Numerical 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 information

INTRODUCTION TO FINITE ELEMENT METHODS

INTRODUCTION 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 information

Math 660-Lecture 15: Finite element spaces (I)

Math 660-Lecture 15: Finite element spaces (I) 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

More information

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

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 information

Kernel Method: Data Analysis with Positive Definite Kernels

Kernel Method: Data Analysis with Positive Definite Kernels Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University

More information

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

Scientific 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 information

Chapter 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 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 information

HW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.

HW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given. HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard

More information

Spline Methods Draft. Tom Lyche and Knut Mørken

Spline Methods Draft. Tom Lyche and Knut Mørken Spline Methods Draft Tom Lyche and Knut Mørken 25th April 2003 2 Contents 1 Splines and B-splines an Introduction 3 1.1 Convex combinations and convex hulls..................... 3 1.1.1 Stable computations...........................

More information

Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions

Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions Chapter 3 Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions 3.1 Scattered Data Interpolation with Polynomial Precision Sometimes the assumption on the

More information

RKHS, Mercer s theorem, Unbounded domains, Frames and Wavelets Class 22, 2004 Tomaso Poggio and Sayan Mukherjee

RKHS, Mercer s theorem, Unbounded domains, Frames and Wavelets Class 22, 2004 Tomaso Poggio and Sayan Mukherjee RKHS, Mercer s theorem, Unbounded domains, Frames and Wavelets 9.520 Class 22, 2004 Tomaso Poggio and Sayan Mukherjee About this class Goal To introduce an alternate perspective of RKHS via integral operators

More information

Numerical Solutions to Partial Differential Equations

Numerical Solutions to Partial Differential Equations Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Nonconformity and the Consistency Error First Strang Lemma Abstract Error Estimate

More information

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

Numerical 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 information

Numerical Solutions to Partial Differential Equations

Numerical 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 information

Consistency Estimates for gfd Methods and Selection of Sets of Influence

Consistency Estimates for gfd Methods and Selection of Sets of Influence Consistency Estimates for gfd Methods and Selection of Sets of Influence Oleg Davydov University of Giessen, Germany Localized Kernel-Based Meshless Methods for PDEs ICERM / Brown University 7 11 August

More information

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

1. 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 information

We have to prove now that (3.38) defines an orthonormal wavelet. It belongs to W 0 by Lemma and (3.55) with j = 1. We can write any f W 1 as

We have to prove now that (3.38) defines an orthonormal wavelet. It belongs to W 0 by Lemma and (3.55) with j = 1. We can write any f W 1 as 88 CHAPTER 3. WAVELETS AND APPLICATIONS We have to prove now that (3.38) defines an orthonormal wavelet. It belongs to W 0 by Lemma 3..7 and (3.55) with j =. We can write any f W as (3.58) f(ξ) = p(2ξ)ν(2ξ)

More information

L. Levaggi A. Tabacco WAVELETS ON THE INTERVAL AND RELATED TOPICS

L. Levaggi A. Tabacco WAVELETS ON THE INTERVAL AND RELATED TOPICS Rend. Sem. Mat. Univ. Pol. Torino Vol. 57, 1999) L. Levaggi A. Tabacco WAVELETS ON THE INTERVAL AND RELATED TOPICS Abstract. We use an abstract framework to obtain a multilevel decomposition of a variety

More information

Supraconvergence of a Non-Uniform Discretisation for an Elliptic Third-Kind Boundary-Value Problem with Mixed Derivatives

Supraconvergence of a Non-Uniform Discretisation for an Elliptic Third-Kind Boundary-Value Problem with Mixed Derivatives Supraconvergence of a Non-Uniform Discretisation for an Elliptic Third-Kind Boundary-Value Problem with Mixed Derivatives Etienne Emmrich Technische Universität Berlin, Institut für Mathematik, Straße

More information

Applied/Numerical Analysis Qualifying Exam

Applied/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 information

ETNA Kent State University

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 information

Construction of wavelets. Rob Stevenson Korteweg-de Vries Institute for Mathematics University of Amsterdam

Construction of wavelets. Rob Stevenson Korteweg-de Vries Institute for Mathematics University of Amsterdam Construction of wavelets Rob Stevenson Korteweg-de Vries Institute for Mathematics University of Amsterdam Contents Stability of biorthogonal wavelets. Examples on IR, (0, 1), and (0, 1) n. General domains

More information

A 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 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

Constitutive models. Constitutive model: determines P in terms of deformation

Constitutive models. Constitutive model: determines P in terms of deformation Constitutive models Constitutive model: determines P in terms of deformation Elastic material: P depends only on current F Hyperelastic material: work is independent of path strain energy density function

More information

On an Approximation Result for Piecewise Polynomial Functions. O. Karakashian

On 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 information

A very short introduction to the Finite Element Method

A 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 information

Chapter 7 Wavelets and Multiresolution Processing

Chapter 7 Wavelets and Multiresolution Processing Chapter 7 Wavelets and Multiresolution Processing Background Multiresolution Expansions Wavelet Transforms in One Dimension Wavelet Transforms in Two Dimensions Image Pyramids Subband Coding The Haar

More information

The variational collocation method

The variational collocation method The variational collocation method Hector Gomez a,, Laura De Lorenzis b a Departamento de Métodos Matemáticos, Universidade da Coruña, Campus de A Coruña, 15071, A Coruña, Spain. b Institut für Angewandte

More information

Outline of Fourier Series: Math 201B

Outline of Fourier Series: Math 201B Outline of Fourier Series: Math 201B February 24, 2011 1 Functions and convolutions 1.1 Periodic functions Periodic functions. Let = R/(2πZ) denote the circle, or onedimensional torus. A function f : C

More information

Your first day at work MATH 806 (Fall 2015)

Your first day at work MATH 806 (Fall 2015) Your first day at work MATH 806 (Fall 2015) 1. Let X be a set (with no particular algebraic structure). A function d : X X R is called a metric on X (and then X is called a metric space) when d satisfies

More information

Introduction to Signal Spaces

Introduction to Signal Spaces Introduction to Signal Spaces Selin Aviyente Department of Electrical and Computer Engineering Michigan State University January 12, 2010 Motivation Outline 1 Motivation 2 Vector Space 3 Inner Product

More information

INTRODUCTION TO FINITE ELEMENT METHODS ON ELLIPTIC EQUATIONS LONG CHEN

INTRODUCTION TO FINITE ELEMENT METHODS ON ELLIPTIC EQUATIONS LONG CHEN INTROUCTION TO FINITE ELEMENT METHOS ON ELLIPTIC EQUATIONS LONG CHEN CONTENTS 1. Poisson Equation 1 2. Outline of Topics 3 2.1. Finite ifference Method 3 2.2. Finite Element Method 3 2.3. Finite Volume

More information

Chapter 1: The Finite Element Method

Chapter 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 information

FEM 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 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 information

On orthogonal polynomials for certain non-definite linear functionals

On orthogonal polynomials for certain non-definite linear functionals On orthogonal polynomials for certain non-definite linear functionals Sven Ehrich a a GSF Research Center, Institute of Biomathematics and Biometry, Ingolstädter Landstr. 1, 85764 Neuherberg, Germany Abstract

More information

Stability of Tensor Product B-Splines on Domains

Stability of Tensor Product B-Splines on Domains Stability of Tensor Product B-Splines on Domains Bernhard Mößner and Ulrich Reif Abstract We construct a uniformly stable family of bases for tensor product spline approximation on domains in R d. These

More information

Lecture 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 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 information

Hilbert Spaces. Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space.

Hilbert Spaces. Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space. Hilbert Spaces Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space. Vector Space. Vector space, ν, over the field of complex numbers,

More information

Numerical Solutions to Partial Differential Equations

Numerical Solutions to Partial Differential Equations Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University A Framework for Interpolation Error Estimation of Affine Equivalent FEs 1 The

More information

Homework I, Solutions

Homework I, Solutions Homework I, Solutions I: (15 points) Exercise on lower semi-continuity: Let X be a normed space and f : X R be a function. We say that f is lower semi - continuous at x 0 if for every ε > 0 there exists

More information

Outline. 1 Interpolation. 2 Polynomial Interpolation. 3 Piecewise Polynomial Interpolation

Outline. 1 Interpolation. 2 Polynomial Interpolation. 3 Piecewise Polynomial Interpolation Outline Interpolation 1 Interpolation 2 3 Michael T. Heath Scientific Computing 2 / 56 Interpolation Motivation Choosing Interpolant Existence and Uniqueness Basic interpolation problem: for given data

More information

Lectures notes. Rheology and Fluid Dynamics

Lectures notes. Rheology and Fluid Dynamics ÉC O L E P O L Y T E C H N IQ U E FÉ DÉR A L E D E L A U S A N N E Christophe Ancey Laboratoire hydraulique environnementale (LHE) École Polytechnique Fédérale de Lausanne Écublens CH-05 Lausanne Lectures

More information

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )

More information

Geometric Interpolation by Planar Cubic Polynomials

Geometric Interpolation by Planar Cubic Polynomials 1 / 20 Geometric Interpolation by Planar Cubic Polynomials Jernej Kozak, Marjeta Krajnc Faculty of Mathematics and Physics University of Ljubljana Institute of Mathematics, Physics and Mechanics Avignon,

More information

Approximation of Geometric Data

Approximation of Geometric Data Supervised by: Philipp Grohs, ETH Zürich August 19, 2013 Outline 1 Motivation Outline 1 Motivation 2 Outline 1 Motivation 2 3 Goal: Solving PDE s an optimization problems where we seek a function with

More information

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

Chapter 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 information

Engineering 7: Introduction to computer programming for scientists and engineers

Engineering 7: Introduction to computer programming for scientists and engineers Engineering 7: Introduction to computer programming for scientists and engineers Interpolation Recap Polynomial interpolation Spline interpolation Regression and Interpolation: learning functions from

More information

The hp-version of the boundary element method with quasi-uniform meshes in three dimensions

The hp-version of the boundary element method with quasi-uniform meshes in three dimensions The hp-version of the boundary element method with quasi-uniform meshes in three dimensions Alexei Bespalov Norbert Heuer Dedicated to Professor Ernst P. Stephan on the occasion of his 60th birthday. Abstract

More information

A WEAK GALERKIN MIXED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATIONS

A 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 information

UNIVERSITY OF WISCONSIN-MADISON CENTER FOR THE MATHEMATICAL SCIENCES. Tight compactly supported wavelet frames of arbitrarily high smoothness

UNIVERSITY OF WISCONSIN-MADISON CENTER FOR THE MATHEMATICAL SCIENCES. Tight compactly supported wavelet frames of arbitrarily high smoothness UNIVERSITY OF WISCONSIN-MADISON CENTER FOR THE MATHEMATICAL SCIENCES Tight compactly supported wavelet frames of arbitrarily high smoothness Karlheinz Gröchenig Amos Ron Department of Mathematics U-9 University

More information

MATH 205C: STATIONARY PHASE LEMMA

MATH 205C: STATIONARY PHASE LEMMA MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)

More information

Polynomial approximation via de la Vallée Poussin means

Polynomial approximation via de la Vallée Poussin means Summer School on Applied Analysis 2 TU Chemnitz, September 26-3, 2 Polynomial approximation via de la Vallée Poussin means Lecture 2: Discrete operators Woula Themistoclakis CNR - National Research Council

More information

Approximation by Conditionally Positive Definite Functions with Finitely Many Centers

Approximation by Conditionally Positive Definite Functions with Finitely Many Centers Approximation by Conditionally Positive Definite Functions with Finitely Many Centers Jungho Yoon Abstract. The theory of interpolation by using conditionally positive definite function provides optimal

More information

Simple Examples on Rectangular Domains

Simple 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 information

Classical and Quantum Complexity of the Sturm-Liouville Eigenvalue Problem

Classical and Quantum Complexity of the Sturm-Liouville Eigenvalue Problem Classical and Quantum Complexity of the Sturm-Liouville Eigenvalue Problem A. Papageorgiou 1 and H. Woźniakowski 1, Department of Computer Science, Columbia University, New York, USA Institute of Applied

More information

MGA Tutorial, September 08, 2004 Construction of Wavelets. Jan-Olov Strömberg

MGA Tutorial, September 08, 2004 Construction of Wavelets. Jan-Olov Strömberg MGA Tutorial, September 08, 2004 Construction of Wavelets Jan-Olov Strömberg Department of Mathematics Royal Institute of Technology (KTH) Stockholm, Sweden Department of Numerical Analysis and Computer

More information

Exercises * on Linear Algebra

Exercises * on Linear Algebra Exercises * on Linear Algebra Laurenz Wiskott Institut für Neuroinformatik Ruhr-Universität Bochum, Germany, EU 4 February 7 Contents Vector spaces 4. Definition...............................................

More information

Adaptive 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 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 information

Numerische Mathematik

Numerische Mathematik Numer. Math. (997) 76: 479 488 Numerische Mathematik c Springer-Verlag 997 Electronic Edition Exponential decay of C cubic splines vanishing at two symmetric points in each knot interval Sang Dong Kim,,

More information

A Banach Gelfand Triple Framework for Regularization and App

A Banach Gelfand Triple Framework for Regularization and App A Banach Gelfand Triple Framework for Regularization and Hans G. Feichtinger 1 hans.feichtinger@univie.ac.at December 5, 2008 1 Work partially supported by EUCETIFA and MOHAWI Hans G. Feichtinger hans.feichtinger@univie.ac.at

More information

Kernel B Splines and Interpolation

Kernel B Splines and Interpolation Kernel B Splines and Interpolation M. Bozzini, L. Lenarduzzi and R. Schaback February 6, 5 Abstract This paper applies divided differences to conditionally positive definite kernels in order to generate

More information

Chapter 4: Interpolation and Approximation. October 28, 2005

Chapter 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 information

Nonparametric Regression. Badr Missaoui

Nonparametric Regression. Badr Missaoui Badr Missaoui Outline Kernel and local polynomial regression. Penalized regression. We are given n pairs of observations (X 1, Y 1 ),...,(X n, Y n ) where Y i = r(x i ) + ε i, i = 1,..., n and r(x) = E(Y

More information

Finite Element Methods for Fourth Order Variational Inequalities

Finite Element Methods for Fourth Order Variational Inequalities Louisiana State University LSU Digital Commons LSU Doctoral Dissertations Graduate School 2013 Finite Element Methods for Fourth Order Variational Inequalities Yi Zhang Louisiana State University and Agricultural

More information

Isogeometric Analysis:

Isogeometric 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 information

The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods

The 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 information

A 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 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 information

An a posteriori error estimate and a Comparison Theorem for the nonconforming P 1 element

An 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 information

Scientific Computing: An Introductory Survey

Scientific Computing: An Introductory Survey Scientific Computing: An Introductory Survey Chapter 7 Interpolation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted

More information

Key Words: cardinal B-spline, coefficients, moments, rectangular rule, interpolating quadratic spline, hat function, cubic B-spline.

Key Words: cardinal B-spline, coefficients, moments, rectangular rule, interpolating quadratic spline, hat function, cubic B-spline. M a t h e m a t i c a B a l a n i c a New Series Vol. 24, 2, Fasc.3-4 Splines in Numerical Integration Zlato Udovičić We gave a short review of several results which are related to the role of splines

More information

Multiresolution analysis by infinitely differentiable compactly supported functions. N. Dyn A. Ron. September 1992 ABSTRACT

Multiresolution analysis by infinitely differentiable compactly supported functions. N. Dyn A. Ron. September 1992 ABSTRACT Multiresolution analysis by infinitely differentiable compactly supported functions N. Dyn A. Ron School of of Mathematical Sciences Tel-Aviv University Tel-Aviv, Israel Computer Sciences Department University

More information

From Fourier to Wavelets in 60 Slides

From Fourier to Wavelets in 60 Slides From Fourier to Wavelets in 60 Slides Bernhard G. Bodmann Math Department, UH September 20, 2008 B. G. Bodmann (UH Math) From Fourier to Wavelets in 60 Slides September 20, 2008 1 / 62 Outline 1 From Fourier

More information

Lecture 7: Kernels for Classification and Regression

Lecture 7: Kernels for Classification and Regression Lecture 7: Kernels for Classification and Regression CS 194-10, Fall 2011 Laurent El Ghaoui EECS Department UC Berkeley September 15, 2011 Outline Outline A linear regression problem Linear auto-regressive

More information

ASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR THE POINTWISE GRADIENT ERROR ON EACH ELEMENT IN IRREGULAR MESHES. PART II: THE PIECEWISE LINEAR CASE

ASYMPTOTICALLY 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 information

Time domain boundary elements for dynamic contact problems

Time domain boundary elements for dynamic contact problems Time domain boundary elements for dynamic contact problems Heiko Gimperlein (joint with F. Meyer 3, C. Özdemir 4, D. Stark, E. P. Stephan 4 ) : Heriot Watt University, Edinburgh, UK 2: Universität Paderborn,

More information

Riesz Bases of Wavelets and Applications to Numerical Solutions of Elliptic Equations

Riesz Bases of Wavelets and Applications to Numerical Solutions of Elliptic Equations Riesz Bases of Wavelets and Applications to Numerical Solutions of Elliptic Equations Rong-Qing Jia and Wei Zhao Department of Mathematical and Statistical Sciences University of Alberta Edmonton, Canada

More information

Your first day at work MATH 806 (Fall 2015)

Your first day at work MATH 806 (Fall 2015) Your first day at work MATH 806 (Fall 2015) 1. Let X be a set (with no particular algebraic structure). A function d : X X R is called a metric on X (and then X is called a metric space) when d satisfies

More information

Mathematical Methods for Computer Science

Mathematical Methods for Computer Science Mathematical Methods for Computer Science Computer Laboratory Computer Science Tripos, Part IB Michaelmas Term 2016/17 Professor J. Daugman Exercise problems Fourier and related methods 15 JJ Thomson Avenue

More information

From Bernstein approximation to Zauner s conjecture

From Bernstein approximation to Zauner s conjecture From Bernstein approximation to Zauner s conjecture Shayne Waldron Mathematics Department, University of Auckland December 5, 2017 Shayne Waldron (University of Auckland) Workshop on Spline Approximation

More information

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

On the relationship of local projection stabilization to other stabilized methods for one-dimensional advection-diffusion equations On the relationship of local projection stabilization to other stabilized methods for one-dimensional advection-diffusion equations Lutz Tobiska Institut für Analysis und Numerik Otto-von-Guericke-Universität

More information

Applied Numerical Analysis Quiz #2

Applied Numerical Analysis Quiz #2 Applied Numerical Analysis Quiz #2 Modules 3 and 4 Name: Student number: DO NOT OPEN UNTIL ASKED Instructions: Make sure you have a machine-readable answer form. Write your name and student number in the

More information

ON THE BOUNDEDNESS BEHAVIOR OF THE SPECTRAL FACTORIZATION IN THE WIENER ALGEBRA FOR FIR DATA

ON THE BOUNDEDNESS BEHAVIOR OF THE SPECTRAL FACTORIZATION IN THE WIENER ALGEBRA FOR FIR DATA ON THE BOUNDEDNESS BEHAVIOR OF THE SPECTRAL FACTORIZATION IN THE WIENER ALGEBRA FOR FIR DATA Holger Boche and Volker Pohl Technische Universität Berlin, Heinrich Hertz Chair for Mobile Communications Werner-von-Siemens

More information

UNIVERSITY OF WISCONSIN-MADISON CENTER FOR THE MATHEMATICAL SCIENCES. A characterization of the approximation order of multivariate spline spaces

UNIVERSITY OF WISCONSIN-MADISON CENTER FOR THE MATHEMATICAL SCIENCES. A characterization of the approximation order of multivariate spline spaces UNIVERSITY OF WISCONSIN-MADISON CENTER FOR THE MATHEMATICAL SCIENCES A characterization of the approximation order of multivariate spline spaces Amos Ron Center for the Mathematical Sciences and Computer

More information

Vector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.

Vector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms. Vector Spaces Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms. For each two vectors a, b ν there exists a summation procedure: a +

More information

Multiscale Frame-based Kernels for Image Registration

Multiscale Frame-based Kernels for Image Registration Multiscale Frame-based Kernels for Image Registration Ming Zhen, Tan National University of Singapore 22 July, 16 Ming Zhen, Tan (National University of Singapore) Multiscale Frame-based Kernels for Image

More information

Anton ARNOLD. with N. Ben Abdallah (Toulouse), J. Geier (Vienna), C. Negulescu (Marseille) TU Vienna Institute for Analysis and Scientific Computing

Anton ARNOLD. with N. Ben Abdallah (Toulouse), J. Geier (Vienna), C. Negulescu (Marseille) TU Vienna Institute for Analysis and Scientific Computing TECHNISCHE UNIVERSITÄT WIEN Asymptotically correct finite difference schemes for highly oscillatory ODEs Anton ARNOLD with N. Ben Abdallah (Toulouse, J. Geier (Vienna, C. Negulescu (Marseille TU Vienna

More information

MINIMAL DEGREE UNIVARIATE PIECEWISE POLYNOMIALS WITH PRESCRIBED SOBOLEV REGULARITY

MINIMAL DEGREE UNIVARIATE PIECEWISE POLYNOMIALS WITH PRESCRIBED SOBOLEV REGULARITY MINIMAL DEGREE UNIVARIATE PIECEWISE POLYNOMIALS WITH PRESCRIBED SOBOLEV REGULARITY Amal Al-Rashdan & Michael J. Johnson* Department of Mathematics Kuwait University P.O. Box: 5969 Safat 136 Kuwait yohnson1963@hotmail.com*

More information

Mixed Hybrid Finite Element Method: an introduction

Mixed 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 information

Scientific Computing

Scientific 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 information

Hardy spaces of Dirichlet series and function theory on polydiscs

Hardy spaces of Dirichlet series and function theory on polydiscs Hardy spaces of Dirichlet series and function theory on polydiscs Kristian Seip Norwegian University of Science and Technology (NTNU) Steinkjer, September 11 12, 2009 Summary Lecture One Theorem (H. Bohr)

More information

96 CHAPTER 4. HILBERT SPACES. Spaces of square integrable functions. Take a Cauchy sequence f n in L 2 so that. f n f m 1 (b a) f n f m 2.

96 CHAPTER 4. HILBERT SPACES. Spaces of square integrable functions. Take a Cauchy sequence f n in L 2 so that. f n f m 1 (b a) f n f m 2. 96 CHAPTER 4. HILBERT SPACES 4.2 Hilbert Spaces Hilbert Space. An inner product space is called a Hilbert space if it is complete as a normed space. Examples. Spaces of sequences The space l 2 of square

More information

Numerical Methods I Orthogonal Polynomials

Numerical Methods I Orthogonal Polynomials Numerical Methods I Orthogonal Polynomials Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001, Fall 2010 Nov. 4th and 11th, 2010 A. Donev (Courant Institute)

More information

Spectral methods for fuzzy structural dynamics: modal vs direct approach

Spectral methods for fuzzy structural dynamics: modal vs direct approach Spectral methods for fuzzy structural dynamics: modal vs direct approach S Adhikari Zienkiewicz Centre for Computational Engineering, College of Engineering, Swansea University, Wales, UK IUTAM Symposium

More information

Space-time Finite Element Methods for Parabolic Evolution Problems

Space-time Finite Element Methods for Parabolic Evolution Problems Space-time Finite Element Methods for Parabolic Evolution Problems with Variable Coefficients Ulrich Langer, Martin Neumüller, Andreas Schafelner Johannes Kepler University, Linz Doctoral Program Computational

More information

Numerical Solutions to Partial Differential Equations

Numerical 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 information

From Completing the Squares and Orthogonal Projection to Finite Element Methods

From Completing the Squares and Orthogonal Projection to Finite Element Methods From Completing the Squares and Orthogonal Projection to Finite Element Methods Mo MU Background In scientific computing, it is important to start with an appropriate model in order to design effective

More information

Adaptive Piecewise Polynomial Estimation via Trend Filtering

Adaptive Piecewise Polynomial Estimation via Trend Filtering Adaptive Piecewise Polynomial Estimation via Trend Filtering Liubo Li, ShanShan Tu The Ohio State University li.2201@osu.edu, tu.162@osu.edu October 1, 2015 Liubo Li, ShanShan Tu (OSU) Trend Filtering

More information

Solutions: Problem Set 3 Math 201B, Winter 2007

Solutions: Problem Set 3 Math 201B, Winter 2007 Solutions: Problem Set 3 Math 201B, Winter 2007 Problem 1. Prove that an infinite-dimensional Hilbert space is a separable metric space if and only if it has a countable orthonormal basis. Solution. If

More information

Scientific Computing: Numerical Integration

Scientific 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 information

Spring, 2012 CIS 515. Fundamentals of Linear Algebra and Optimization Jean Gallier

Spring, 2012 CIS 515. Fundamentals of Linear Algebra and Optimization Jean Gallier Spring 0 CIS 55 Fundamentals of Linear Algebra and Optimization Jean Gallier Homework 5 & 6 + Project 3 & 4 Note: Problems B and B6 are for extra credit April 7 0; Due May 7 0 Problem B (0 pts) Let A be

More information