Introduction to G-RSM (Spectral method for dummies) Masao Kanamitsu Scripps Institution of Oceanography University of California, San Diego.

Slides:



Advertisements
Similar presentations
Signals and Fourier Theory
Advertisements

5.4 Basis And Dimension.
ECON 397 Macroeconometrics Cunningham
Lecture 7: Basis Functions & Fourier Series
Engineering Mathematics Class #15 Fourier Series, Integrals, and Transforms (Part 3) Sheng-Fang Huang.
Techniques in Signal and Data Processing CSC 508 Frequency Domain Analysis.
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
Fourier Series Eng. Ahmed H. Abo absa. Slide number 2 Fourier Series & The Fourier Transform Fourier Series & The Fourier Transform What is the Fourier.
PHY 042: Electricity and Magnetism Laplace’s equation Prof. Hugo Beauchemin 1.
Boyce/DiPrima 10th ed, Ch 10.1: Two-Point Boundary Value Problems Elementary Differential Equations and Boundary Value Problems, 10th edition, by William.
EARS1160 – Numerical Methods notes by G. Houseman
Review of Frequency Domain
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
Curve-Fitting Regression
Ch 5.1: Review of Power Series
Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique.
Chapter 9 Differential equations
Deconstructing periodic driving voltages (or any functions) into their sinusoidal components: It's easy to build a periodic functions by choosing coefficients.
Boyce/DiPrima 9th ed, Ch 11.2: Sturm-Liouville Boundary Value Problems Elementary Differential Equations and Boundary Value Problems, 9th edition, by.
Chapter 6 Numerical Interpolation
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM.
1 10. Joint Moments and Joint Characteristic Functions Following section 6, in this section we shall introduce various parameters to compactly represent.
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 15 Fourier Series and Fourier Transform
Function approximation: Fourier, Chebyshev, Lagrange
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
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.
1 The Spectral Method. 2 Definition where (e m,e n )=δ m,n e n = basis of a Hilbert space (.,.): scalar product in this space In L 2 space where f * :
Interpolation. Interpolation is important concept in numerical analysis. Quite often functions may not be available explicitly but only the values of.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
1 EEE 431 Computational Methods in Electrodynamics Lecture 4 By Dr. Rasime Uyguroglu
Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)
Boyce/DiPrima 9 th ed, Ch 5.1: Review of Power Series Elementary Differential Equations and Boundary Value Problems, 9 th edition, by William E. Boyce.
6. Introduction to Spectral method. Finite difference method – approximate a function locally using lower order interpolating polynomials. Spectral method.
SECTION 13.8 STOKES ’ THEOREM. P2P213.8 STOKES ’ VS. GREEN ’ S THEOREM  Stokes ’ Theorem can be regarded as a higher- dimensional version of Green ’
3.3.3: Semi-Lagrangian schemes AOSC614 class Hong Li.
7. Introduction to the numerical integration of PDE. As an example, we consider the following PDE with one variable; Finite difference method is one of.
Chapter 2 Signals and Spectra (All sections, except Section 8, are covered.)
Periodic driving forces
Chapter 2. Signals and Linear Systems
Numerical Methods.
Astronomical Data Analysis I
Fourier series, Discrete Time Fourier Transform and Characteristic functions.
Discretization Methods Chapter 2. Training Manual May 15, 2001 Inventory # Discretization Methods Topics Equations and The Goal Brief overview.
Lecture 17 - Approximation Methods CVEN 302 July 17, 2002.
Advanced Engineering Mathematics, 7 th Edition Peter V. O’Neil © 2012 Cengage Learning Engineering. All Rights Reserved. CHAPTER 4 Series Solutions.
Joint Moments and Joint Characteristic Functions.
Boundary-Value Problems in Rectangular Coordinates
5 INTEGRALS.
3.3 Separation of Variables 3.4 Multipole Expansion
1 Copyright © Cengage Learning. All rights reserved. 6. The Trigonometric Functions Graphs of Trigonometric Functions.
1 Roadmap SignalSystem Input Signal Output Signal characteristics Given input and system information, solve for the response Solving differential equation.
MODULE 13 Time-independent Perturbation Theory Let us suppose that we have a system of interest for which the Schrödinger equation is We know that we can.
Computational Physics (Lecture 14) PHY4061. What happens if the string is not light, and/or carries a mass density ρ(x) that is not a constant? This is.
Convergence of Fourier series It is known that a periodic signal x(t) has a Fourier series representation if it satisfies the following Dirichlet conditions:
Subject : Advance engineering mathematics Topic : Fourier series & Fourier integral.
Ch 10.2: Fourier Series We will see that many important problems involving partial differential equations can be solved, provided a given function can.
Trigonometric Identities
Functions of Complex Variable and Integral Transforms
EEE 431 Computational Methods in Electrodynamics
Lecture 4: Numerical Stability
Ch 10.1: Two-Point Boundary Value Problems
MECH 373 Instrumentation and Measurements
UNIT II Analysis of Continuous Time signal
3. Boundary Value Problems II 3A. The Spherical Harmonics
Class Notes 9: Power Series (1/3)
UNIT-I SIGNALS & SYSTEMS.
Fourier Analysis Lecture-8 Additional chapters of mathematics
Introduction to Fourier Series
Presentation transcript:

Introduction to G-RSM (Spectral method for dummies) Masao Kanamitsu Scripps Institution of Oceanography University of California, San Diego

All the materials are available from

How to digitize a field Values on grid points □ Geographical location is given □ Discrete representation Easy to understand. No computation necessary. Computer display utilize this method. Will be referred to as physical space ========================== Notation in this presentation: Physical space in RED

Trivial 1-D example Physical space: f(x) is expressed by 7 numbers (-2.0, -1.33, -0.67, 0., +0.67, +1.33, +2.0)

Any other method to digitize fields? f(x)=ax+b a=0.67 b=0. f(x) is expressed by 2 numbers (0.67, 0.) Note Continuous representation ========================== Notation in this presentation: Functional space in BLUE

Can we do similar procedure for more general field distributions? Fourier Series Combination (or summation) of sine and cosine waves with different wave length.

BornMarch 21, 1768 Auxerre, Yonne, FranceMarch AuxerreYonneFrance DiedMay 16, 1830 (aged 62) Paris, France Nationality FrenchMay ParisFrance FieldMathematician, physicist, and historianMathematicianphysicist Institutions École Normale École PolytechniqueÉcole Normale École Polytechnique Polytechnique Academic advisor Joseph LagrangeJoseph Lagrange Joseph Fourier

Fourier’s discovery He claims that any function of a variable, whether continuous or discontinuous, can be expanded in a series of sines of multiples of the variable. Though this result is not correct, Fourier's observation that some discontinuous functions are the sum of infinite series was a breakthrough. The question of determining when a function is the sum of its Fourier series has been fundamental for centuries. Joseph Louis Lagrange had given particular cases of this (false) theorem, and had implied that the method was general, but he had not pursued the subject. Johann Dirichlet was the first to give a satisfactory demonstration of it with some restrictive conditions. A more subtle, but equally fundamental, contribution is the concept of dimensional homogeneity in equations; i.e. an equation can only be formally correct if the dimensions match on either side of the equality.Joseph Louis LagrangeJohann Dirichlet

Any distribution can be expressed (approximately) by the Fourier Series

Fits better with more wave components

More general example Physical space: f(x) is expressed by 7 numbers (2.0, 0.0, -2.0, -0.5, 0.5, 0.0, 2.0)

Wave space: If we use the following series of functions: f 0 (x)=constant f 1 (x)=sin(2B/L x), f 2 (x)=cos(2B/L x), f 3 (x)=sin(2B/L 2x), f 4 (x)=cos(2B/L 2x), f 5 (x)=sin(2B/L 3x), f 5 (x)=cos(2Bx/L 3x) then, f(x) = f 1 (x) f 2 (x) f 3 (x) f 4 (x) f 5 (x) f 6 (x) Now, f(x) is expressed by 7 different numbers!! (0.000, , 1.083, 0.722, 0.750, 0.00, 0.167)

Wave space Values of coefficients of a series of functions Will be referred to as wave space No geographical location Known set of mathematical functions Continuous representation Space derivatives can be computed analytically. Not possible to visualize

grid point space Values on grid points. Will be referred to as grid point space Geographical location specified Physical values themselves Discrete representation Space derivatives computation requires finite difference approximation. Easy to visualize

Derivatives Continuous vs. discrete representation (  F/  x) x=60 =(F 80 -F 40 )/(80-40) –Can be defined only at the grid point (  F/  x) x=60 = *2  /L*cos(2  /Lx) * 2  /L*sin(2  /Lx)+…….. Can be defined everywhere (continuous)

How to select “(series of) functions” Requirements: –Satisfy boundary condition –Orthogonal –Solution of a linearized forecast equation Examples: –1-D periodic ==> Sinusoidal (Fourier) –2-D periodic over plane ==> Double Fourier –2-D wall (zero) ==> Sine only series –2-D symmetric ==> Cosine only series –2-D on sphere ==> Associated Legendre polynomial

Fourier Transform Transformation between physical and wave space 1-D example: where, λ=2π/L

Conversion from wave space to physical space Complex notation is more convenient : f(λ) is physical space F(m) is wave space where then

Conversion from physical space to wave space Note that F(m) is not a function of space (λ) f(λ) is physical space F(m) is wave space

Orthogonality condition

Horizontal derivatives Physical space: Wave space:

Note on ‘scale’ Wavenumber “m” relates to scale (spectral) small “m” ==> large scale large “m” ==> small scale Think as “number of troughs and ridges around the latitude circle”

Skip spectral representation on sphere. Please refer to the page

Spectral method and Grid-point method A method to numerically solve linear and nonlinear (partial) differential equations. We may have: Spectral quasi-geostrophic model Spectral non-hydrostatic model Also used in pure physics and other applications

Spectral forecast equation Grid-point method => predict values on grids Spectral method => predict coefficients

Spectral Forecast Equation 1-D linear equation example

Spectral Forecast Equation 1-D linear equation example Grid-point method

Spectral Forecast Equation 1-D linear equation example Spectral Method Apply the following operator to both sides of the equation like the following: which leads to:

Spectral Forecast Equation 1-D linear equation example Spectral Method or, using finite differencing in time,

Spectral Forecast Equation 1-D non-linear equation example Spectral Method

Spectral Forecast Equation 1-D non-linear equation example Grid-point method

Spectral Forecast Equation 1-D non-linear equation example Spectral Method LHS:

RHS:

Spectral Forecast Equation 1-D non-linear equation example Spectral Method Note that his equation shows nonlinear interaction between the waves. For example, U(3) is generated by U(1) and U(2) {m=3,k=1} (or many other combinations of m and k)

Introduction to Transform Method Question How many grid-points or spectral coefficients are required to represent a given field? Ans. Wave truncation M ==> requires 2M grid points (Or sin/cos coefficients)

Question How many grid points are required to obtain ‘mathematically correct’ nonlinear term ? Qualitative ans. Representation of u requires 2M grid points Representation of requires 2M grid points therefore, requires 4M grid points. However, we have a selection rule, which states that only special combination of u and creates waves within the truncation limit, i.e., U(k) and U(m-k). This requirement reduces the number of combinations by M-1, thus requires 3M+1 grid points.

Advantage of the spectral method 1. No space truncation error 2. No phase speed error 3. Satisfies conservation properties 4. No pole problem 5. Physically clean 6. No overhead for semi-implicit scheme

No-overhead Example : Semi-implicit scheme often requires solution of the following Poisson equation : For Grid point method we need to solve: (ζknown) This requires relaxation method or matrix solver.

For Spectral method we need to solve: (ζknown)

Disadvantages of the spectral method 1. Restricted by boundary condition. 2. Difficulties in handling discontinuity and positive definite quantities ==>Gibbs phenomena 3. For very high resolution (>T1000), efficiency may become a problem.

The Regional Spectral Model Juang, H.-M. and M. Kanamitsu, 1994: The NMC nested regional spectral model. Mon. Wea. Rev., 122, 3-26.

RSM Basics (1) The most serious question is “HOW TO DEAL WITH LATERAL BOUNDARY CONDITION?” –Assume cyclic.... Hilam –Assume zero.... Tatsumi –(Non-zero boundary condition also causes serious difficulties when semi-implicit scheme is used.)

(HILAM) (RSM Tatsumi) (RSM Juang and Kanamitsu) Definition of prediction variable f f f

RSM Basics (2) Introduction of the Perturbation 1. Satisfy zero lateral boundary condition 2. Better boundary condition for semi-implicit scheme 3. Diffusion can be applied to perturbation only (does not change large scale). 4. Lateral boundary relaxation cleaner. 5. Maintain large scale forecast produced by the global model

RSM Basics (3) Definition of perturbation A t =A r +A g A t : Full field (to be predicted) A r : Perturbation (rsm variable, to be predicted) A g : Global model field (known at all times)

RSM Basics (4) Writing equation for Ar is not easy, particularly for nonlinear terms and very nonlinear physical processes.

RSM Basics (5) Different approach: Compute using A t =A r +A g, then use is computed in a similar manner as regular model. is known

Step by step computational procedure (1) 1. Run global model. Get global spherical coefficient A g (n,m) at all times. 2. Get grid point analysis over regional domain A t (x,y). 3. Get grid point values of global model. A g (n,m) ==> Spher. trans. ==> A g (x,y) 4. Compute grid point perturbation A r (x,y) =A t (x,y) - A g (x,y) 5.Get Fourier coefficient of perturbation. A r (x,y) ==>Fourier trans. ==> A r (k,l) (Now Ar(k,l) satisfies zero b.c.) [Steps 1-5 are preparation at the initial time]

Step by step computational procedure (2) 6.Get grid point value of perturbation and its derivatives. A r (k,l) ==>Fourier trans. ==> A r (x,y) Ar(k,l) ==>Fourier trans.==> 7. Get grid point value of global field and its derivatives. A g (m,n) ==>Spherical tans.==> A g (x,y) A g (m,n) ==>Spectral trans.==>

Step by step computational procedure (3) 8.Get grid point total field and derivatives A t (x,y)= A g (x,y) + A r (x,y) 9.Now possible to compute full model tendencies in grid point space (This is non-zero at the boundary)

Step by step computational procedure (4) 10. Get perturbation tendency (Note that is known) 11. Get Fourier coefficient of perturbation tendency (This satisfies boundary condition)

Step by step computational procedure (5) 12. Advance in time 13. Go back to step 6

Further note on the perturbation method Since known fields are A g and A t, and A r is computed from A t and A g, the equation should be expressed as: A r =A t – A g From pure mathematical point of view, A g can be arbitrary except that it must satisfy the condition A r =0 at the boundaries (Tatsumi’s method). The choice of A g as a global model field is to reduce the amplitude of the domain scale from A r and thus spectral filtering does not affect those scales.

Further note on the perturbation method Since RSM does not directly predict A r, it may not be appropriate to call it as a perturbation model. More appropriately, it should be called a perturbation filter model. Although the global model field is used in the entire domain, it is only applied to reduce the error due to the Fourier transform of the domain scale field. There is no explicit forcing towards global model field in the interior of the regional domain. The explicit forcing towards the global model fields is achieved by the lateral boundary blending and/or nudging. It is important to note that these lateral boundary treatment is still an essential part of the RSM, as in the grid-point regional model. The use of Scale Selective Bias Correction Method developed recently by Kanamaru and Kanamitsu considers nudging inside the domain to reduce large systematic error. (To be discussed in other talks)

Little history 1970-‘85: Global spectral model Bourke(1974), Hoskins & Simmons (1975) ECMWF, NMC, JMA 1980's: Regional spectral model Tatsumi(1986) Hoyer (and Simmons) (1987) Juang and Kanamitsu (1994)

Spherical transform Spherical harmonic function m: zonal wavenumber n: total wavenumber n-m: number of zero crossings is Associated Legendre Polynomial (Φ is latitude)

First few examples of

Properties of the 1) Defined as a solution of on sphere. 2) Function of sin 2 and cos 2. 3) Largest order is ‘n’. 4) for m>n 5) Has n-m zero crossing between the poles. 6) Symmetric w.r.t. equator for even n-m. 7) Antisymmetric w.r.t. equator for odd n-m. 8) Orthogonal function.

Legendre (or spherical) Transform formula

Note on ‘scale’ small “m” ==> large zonal scale large “m” ==> small zonal scale small “n-m” ==> large meridional scale large “n-m” ==> small meridional scale

Truncation (model resolution) 1-D example: ‘Maximum m’ or ‘M’ determines the smallest scale possible. 2-D spherical example

Spectral forecast equation on sphere Vorticity equation example:

Nonlinear terms: This is called “Interaction coefficient method”. This computation requires M 5 operations, which is a major disadvantage for lengthy calculations.

“How many grid points are required to obtain ‘mathematically accurate’ nonlinear term?” - another derivation - Problem is that sampling interval misinterprets correct wavelength. Sampled here

If we have 2*S gridpoints. We can represent S waves. Suppose, we have a wave with a wavenumber S+R, then the grid point values of this wave on 2*S grid points are expressed as: The Fourier transform of this grid point value to wavenumber will be preformed as:

This summation is non-zero if: S+R-m is an integer multiple of 2S or m=-{(2N-1)S-R} where N=1,2,3,4... When N=1, |m|=S-R N=2, |m|=3S-R (greater than S for R 1) This indicates that the wave S+R is aliased to S-R. In other word, aliasing occurs as if the wave is folded to a smaller wavenumber at S.

aliasing of S+R to S-R:

The quadratic term generates 2M wave. If we place a condition to the number of grid points (2S) such that the waves between M+1 and 2M do not aliased into waves less than or equal to M, then we have a condition, S+R=2M and S- R=M, i.e., (+1 to avoid aliasing to M) thus requires 3M+1 grid points.

For spherical coefficients, number of required E-W grid points are: (3M+1) and N-S grid points are: (3M+1)/2 for triangular truncation. Note: We choose number of grid points in E-W so that the Fast Fourier Transform works the best. It requires that the number of points is a multiple of 2, 3, 5. Combination of this restriction and the condition above determines the most efficient model truncation (T21, T42, T63...). Note that NCEP model has additional restriction that the wavenumber must be even). Example: Number of grid point = 128 = 2**7 3M+1=128 ==> M=42

There is additional requirement for the non-linear term calculations on sphere!! N-S grid point placement must satisfy the following equation which makes the numerical error of the integration zero. ε =0 leads to: These special latitudes are called Gaussian latitudes

Example for M=5