Orthogonal Functions Numerical Methods in Geophysics Function Approximation The Problem we are trying to approximate a function f(x) by another function.

Slides:



Advertisements
Similar presentations
DCSP-12 Jianfeng Feng
Advertisements

Engineering Mathematics Class #15 Fourier Series, Integrals, and Transforms (Part 3) Sheng-Fang Huang.
9.1 Power Series.
Selected from presentations by Jim Ramsay, McGill University, Hongliang Fei, and Brian Quanz Basis Basics.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Finite element method – basis functions 1 Finite Elements: Basis functions 1-D elements  coordinate transformation  1-D elements  linear basis functions.
Section 9.2a. Do Now – Exploration 1 on p.469 Construct a polynomial with the following behavior at : Since, the constant coefficient is Since, the coefficient.
INFINITE SEQUENCES AND SERIES
Lecture 9 Second Order Linear Differential Equations:
Regressions and approximation Prof. Graeme Bailey (notes modified from Noah Snavely, Spring 2009)
Lecture 8: Fourier Series and Fourier Transform
Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique.
MULTIPLE INTEGRALS Double Integrals over General Regions MULTIPLE INTEGRALS In this section, we will learn: How to use double integrals to.
Chapter 3 Formalism. Hilbert Space Two kinds of mathematical constructs - wavefunctions (representing the system) - operators (representing observables)
6 6.3 © 2012 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
Chapter 4 The Fourier Series and Fourier Transform
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
Boyce/DiPrima 10th ed, Ch 10.2: Fourier Series Elementary Differential Equations and Boundary Value Problems, 10th edition, by William E. Boyce and Richard.
Chapter 4 The Fourier Series and Fourier Transform.
Spectral analysis: Foundations
Quantum One: Lecture 8. Continuously Indexed Basis Sets.
Finite element method 1 Finite Elements  Basic formulation  Basis functions  Stiffness matrix  Poisson‘s equation  Regular grid  Boundary conditions.
Differential Equations Brannan Copyright © 2010 by John Wiley & Sons, Inc. All rights reserved. Chapter 10: Boundary Value Problems and Sturm– Liouville.
Function approximation: Fourier, Chebyshev, Lagrange
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Computational Methods in Physics PHYS 3437 Dr Rob Thacker Dept of Astronomy & Physics (MM-301C)
Chemistry 330 The Mathematics Behind Quantum Mechanics.
1 Review of Fourier series Let S P be the space of all continuous periodic functions of a period P. We’ll also define an inner (scalar) product by where.
Linear Algebra Chapter 4 Vector Spaces.
DOUBLE INTEGRALS OVER GENERAL REGIONS
MA2213 Lecture 4 Numerical Integration. Introduction Definition is the limit of Riemann sums I(f)
difficult if we consider Didn’t you say it’s a very
Functions of Several Variables Copyright © Cengage Learning. All rights reserved.
Fourier TheoryModern Seismology – Data processing and inversion 1 Fourier Series and Transforms Orthogonal functions Fourier Series Discrete Fourier Series.
1. Interpolating polynomials Polynomial of degree n,, is a linear combination of Definitions: (interval, continuous function, abscissas, and polynomial)
6. Introduction to Spectral method. Finite difference method – approximate a function locally using lower order interpolating polynomials. Spectral method.
In section 11.9, we were able to find power series representations for a certain restricted class of functions. Here, we investigate more general problems.
Spatial Frequencies Spatial Frequencies. Why are Spatial Frequencies important? Efficient data representation Provides a means for modeling and removing.
Periodic driving forces
Orthogonal Functions and Fourier Series
Section 5.1 Length and Dot Product in ℝ n. Let v = ‹v 1­­, v 2, v 3,..., v n › and w = ‹w 1­­, w 2, w 3,..., w n › be vectors in ℝ n. The dot product.
5.0 Discrete-time Fourier Transform 5.1 Discrete-time Fourier Transform Representation for discrete-time signals Chapters 3, 4, 5 Chap 3 Periodic Fourier.
Mathematics. Session Functions, Limits and Continuity -3.
1 CHAPTER 5 : FOURIER SERIES  Introduction  Periodic Functions  Fourier Series of a function  Dirichlet Conditions  Odd and Even Functions  Relationship.
1 EEE 431 Computational Methods in Electrodynamics Lecture 18 By Dr. Rasime Uyguroglu
INTEGRALS We saw in Section 5.1 that a limit of the form arises when we compute an area. We also saw that it arises when we try to find the distance traveled.
Fourier Approximation Related Matters Concerning Fourier Series.
6 6.3 © 2016 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
1 Roadmap SignalSystem Input Signal Output Signal characteristics Given input and system information, solve for the response Solving differential equation.
Frequency domain analysis and Fourier Transform
Runge Kutta schemes Taylor series method Numeric solutions of ordinary differential equations.
Continuous-time Fourier Series Prof. Siripong Potisuk.
Then,  Fourier Series: Suppose that f(x) can be expressed as the following series sum because Fourier Series cf. Orthogonal Functions Note: At this point,
Ch 10.2: Fourier Series We will see that many important problems involving partial differential equations can be solved, provided a given function can.
Boyce/DiPrima 10th ed, Ch 10.4: Even and Odd Functions Elementary Differential Equations and Boundary Value Problems, 10th edition, by William E. Boyce.
Ch 11.6: Series of Orthogonal Functions: Mean Convergence
Ch 10.4: Even and Odd Functions
Week 5 The Fourier series and transformation
13 Functions of Several Variables
Finite Elements Basic formulation Basis functions Stiffness matrix
Start with a square one unit by one unit:
Notes Assignments Tutorial problems
5.1 Power Series Method Section 5.1 p1.
Characteristics of Sturm-Liouville Problems
CHAPTER 8. Approximation Theory
Introduction to Fourier Series
Chebyshev Spectral Method with Domain Decomposition
1st semester a.y. 2018/2019 – November 22, 2018
Approximation of Functions
Approximation of Functions
Presentation transcript:

Orthogonal Functions Numerical Methods in Geophysics Function Approximation The Problem we are trying to approximate a function f(x) by another function g n (x) which consists of a sum over N orthogonal functions  (x) weighted by some coefficients a n.

Orthogonal Functions Numerical Methods in Geophysics... and we are looking for optimal functions in a least squares (l 2 ) sense a good choice for the basis functions  (x) are orthogonal functions. What are orthogonal functions? Two functions f and g are said to be orthogonal in the interval [a,b] if How is this related to the more conceivable concept of orthogonal vectors? Let us look at the original definition of integrals: The Problem

Orthogonal Functions Numerical Methods in Geophysics Orthogonal Functions - Definition... where x 0 =a and x N =b, and x i -x i-1 =  x... If we interpret f(x i ) and g(x i ) as the ith components of an N component vector, then this sum corresponds directly to a scalar product of vectors. The vanishing of the scalar product is the condition for orthogonality of vectors (or functions). fifi gigi

Orthogonal Functions Numerical Methods in Geophysics Periodic functions Let us assume we have a piecewise continuous function of the form... we want to approximate this function with a linear combination of 2  periodic functions:

Orthogonal Functions Numerical Methods in Geophysics Orthogonality of Periodic functions... are these functions orthogonal ?... YES, and these relations are valid for any interval of length 2 . Now we know that this is an orthogonal basis, but how can we obtain the coefficients for the basis functions? from minimising f(x)-g(x)

Orthogonal Functions Numerical Methods in Geophysics Fourier coefficients optimal functions g(x) are given if leading to... with the definition of g(x) we get...

Orthogonal Functions Numerical Methods in Geophysics Fourier approximation of |x|... Example..... and for n<4 g(x) looks like leads to the Fourier Serie

Orthogonal Functions Numerical Methods in Geophysics Fourier approximation of x 2... another Example..... and for N<11, g(x) looks like leads to the Fourier Serie

Orthogonal Functions Numerical Methods in Geophysics Fourier - discrete functions.. the so-defined Fourier polynomial is the unique interpolating function to the function f(x j ) with N=2m it turns out that in this particular case the coefficients are given by... what happens if we know our function f(x) only at the points

Orthogonal Functions Numerical Methods in Geophysics Fourier - collocation points... with the important property that in our previous examples... f(x)=|x| => f(x) - blue ; g(x) - red; x i - ‘+’

Orthogonal Functions Numerical Methods in Geophysics Fourier series - convergence f(x)=x 2 => f(x) - blue ; g(x) - red; x i - ‘+’

Orthogonal Functions Numerical Methods in Geophysics Fourier series - convergence f(x)=x 2 => f(x) - blue ; g(x) - red; x i - ‘+’

Orthogonal Functions Numerical Methods in Geophysics Orthogonal functions - Gibb’s phenomenon f(x)=x 2 => f(x) - blue ; g(x) - red; x i - ‘+’ The overshoot for equi- spaced Fourier interpolations is  14% of the step height.

Orthogonal Functions Numerical Methods in Geophysics Chebyshev polynomials We have seen that Fourier series are excellent for interpolating (and differentiating) periodic functions defined on a regularly spaced grid. In many circumstances physical phenomena which are not periodic (in space) and occur in a limited area. This quest leads to the use of Chebyshev polynomials. We depart by observing that cos(n  ) can be expressed by a polynomial in cos(  ):... which leads us to the definition:

Orthogonal Functions Numerical Methods in Geophysics Chebyshev polynomials - definition... for the Chebyshev polynomials T n (x). Note that because of x=cos(  ) they are defined in the interval [-1,1] (which - however - can be extended to  ). The first polynomials are

Orthogonal Functions Numerical Methods in Geophysics Chebyshev polynomials - Graphical The first ten polynomials look like [0, -1] The n-th polynomial has extrema with values 1 or -1 at

Orthogonal Functions Numerical Methods in Geophysics Chebyshev collocation points These extrema are not equidistant (like the Fourier extrema) k x(k)

Orthogonal Functions Numerical Methods in Geophysics Chebyshev polynomials - interpolation... we are now faced with the same problem as with the Fourier series. We want to approximate a function f(x), this time not a periodical function but a function which is defined between [-1,1]. We are looking for g n (x)... and we are faced with the problem, how we can determine the coefficients c k. Again we obtain this by finding the extremum (minimum)

Orthogonal Functions Numerical Methods in Geophysics Chebyshev polynomials - interpolation... to obtain surprisingly these coefficients can be calculated with FFT techniques, noting that... and the fact that f(cos  ) is a 2  -periodic function which means that the coefficients c k are the Fourier coefficients a k of the periodic function F(  )=f(cos  )!

Orthogonal Functions Numerical Methods in Geophysics Chebyshev - discrete functions... leading to the polynomial... in this particular case the coefficients are given by... what happens if we know our function f(x) only at the points... with the property

Orthogonal Functions Numerical Methods in Geophysics Chebyshev - collocation points - |x| f(x)=|x| => f(x) - blue ; g n (x) - red; x i - ‘+’ 8 points 16 points

Orthogonal Functions Numerical Methods in Geophysics Chebyshev - collocation points - |x| f(x)=|x| => f(x) - blue ; g n (x) - red; x i - ‘+’ 32 points 128 points

Orthogonal Functions Numerical Methods in Geophysics Chebyshev - collocation points - x 2 f(x)=x 2 => f(x) - blue ; g n (x) - red; x i - ‘+’ 8 points 64 points The interpolating function g n (x) was shifted by a small amount to be visible at all!

Orthogonal Functions Numerical Methods in Geophysics Chebyshev vs. Fourier - numerical f(x)=x 2 => f(x) - blue ; g N (x) - red; x i - ‘+’ This graph speaks for itself ! Gibb’s phenomenon with Chebyshev? Chebyshev Fourier

Orthogonal Functions Numerical Methods in Geophysics Chebyshev vs. Fourier - Gibb’s f(x)=sign(x-  ) => f(x) - blue ; g N (x) - red; x i - ‘+’ Gibb’s phenomenon with Chebyshev? YES! Chebyshev Fourier

Orthogonal Functions Numerical Methods in Geophysics Chebyshev vs. Fourier - Gibb’s f(x)=sign(x-  ) => f(x) - blue ; g N (x) - red; x i - ‘+’ Chebyshev Fourier

Orthogonal Functions Numerical Methods in Geophysics Fourier vs. Chebyshev Fourier Chebyshev periodic functions limited area [-1,1] collocation points domain basis functions interpolating function

Orthogonal Functions Numerical Methods in Geophysics Fourier vs. Chebyshev (cont’d) Fourier Chebyshev coefficients some properties Gibb’s phenomenon for discontinuous functions Efficient calculation via FFT infinite domain through periodicity limited area calculations grid densification at boundaries coefficients via FFT excellent convergence at boundaries Gibb’s phenomenon