To Dream the Impossible Scheme Part 1 Approximating Derivatives on Non-Uniform, Skewed and Random Grid Schemes Part 2 Applying Rectangular Finite Difference.

Slides:



Advertisements
Similar presentations
Courant and all that Consistency, Convergence Stability Numerical Dispersion Computational grids and numerical anisotropy The goal of this lecture is to.
Advertisements

Partial Differential Equations
Computational Modeling for Engineering MECN 6040
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2013 – 12269: Continuous Solution for Boundary Value Problems.
Parabolic Partial Differential Equations
Numerical Computation
Lecture 18 - Numerical Differentiation
CE33500 – Computational Methods in Civil Engineering Differentiation Provided by : Shahab Afshari
Total Recall Math, Part 2 Ordinary diff. equations First order ODE, one boundary/initial condition: Second order ODE.
Chapter 19 Numerical Differentiation §Estimate the derivatives (slope, curvature, etc.) of a function by using the function values at only a set of discrete.
Ch 7.9: Nonhomogeneous Linear Systems
Computer-Aided Analysis on Energy and Thermofluid Sciences Y.C. Shih Fall 2011 Chapter 6: Basics of Finite Difference Chapter 6 Basics of Finite Difference.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 23 Numerical Differentiation.
Numerical Methods for Partial Differential Equations CAAM 452 Spring 2005 Lecture 6 Various Finite Difference Discretizations for the Advection Equations.
Recall that a square matrix is one in which there are the same amount of rows as columns. A square matrix must exist in order to evaluate a determinant.
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Taylor Series.
Finite Differences Finite Difference Approximations  Simple geophysical partial differential equations  Finite differences - definitions  Finite-difference.
Interpolation. Interpolation is important concept in numerical analysis. Quite often functions may not be available explicitly but only the values of.
© Arturo S. Leon, BSU, Spring 2010
Sistem Kontrol I Kuliah II : Transformasi Laplace Imron Rosyadi, ST 1.
11.8 Power Series 11.9 Representations of Functions as Power Series Taylor and Maclaurin Series.
Numerical Methods on Partial Differential Equation Md. Mashiur Rahman Department of Physics University of Chittagong Laplace Equation.
Finite Element Method.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 9 Matrices and Determinants.
1 LES of Turbulent Flows: Lecture 14 (ME EN ) Prof. Rob Stoll Department of Mechanical Engineering University of Utah Fall 2014.
1 Ch. 4 Linear Models & Matrix Algebra Matrix algebra can be used: a. To express the system of equations in a compact manner. b. To find out whether solution.
1 EEE 431 Computational Methods in Electrodynamics Lecture 4 By Dr. Rasime Uyguroglu
Numerical Methods for Partial Differential Equations CAAM 452 Spring 2005 Lecture 5 Summary of convergence checks for LMM and one-step time stepping Instructor:
6. Introduction to Spectral method. Finite difference method – approximate a function locally using lower order interpolating polynomials. Spectral method.
Computational Methods in Physics PHYS 3437 Dr Rob Thacker Dept of Astronomy & Physics (MM-301C)
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.
Elliptic PDEs and the Finite Difference Method
Akram Bitar and Larry Manevitz Department of Computer Science
Boundary Value Problems l Up to this point we have solved differential equations that have all of their initial conditions specified. l There is another.
Today’s class Numerical Differentiation Finite Difference Methods Numerical Methods Lecture 14 Prof. Jinbo Bi CSE, UConn 1.
Engineering Analysis – Computational Fluid Dynamics –
Engineering Analysis – Computational Fluid Dynamics –
MECN 3500 Inter - Bayamon Lecture 9 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
The Mathematics for Chemists (I) (Fall Term, 2004) (Fall Term, 2005) (Fall Term, 2006) Department of Chemistry National Sun Yat-sen University 化學數學(一)
FALL 2015 Esra Sorgüven Öner
Discretization Methods Chapter 2. Training Manual May 15, 2001 Inventory # Discretization Methods Topics Equations and The Goal Brief overview.
Schrödinger’s Equation in a Central Potential Field
Copyright © 2007 Pearson Education, Inc. Slide 7-1.
Approximating Derivatives Using Taylor Series and Vandermonde Matrices.
NUMERICAL DIFFERENTIATION or DIFFERENCE APPROXIMATION Used to evaluate derivatives of a function using the functional values at grid points. They are.
The Finite-Difference Method Taylor Series Expansion Suppose we have a continuous function f(x), its value in the vicinity of can be approximately expressed.
1 Week 11 Numerical methods for ODEs 1.The basics: finite differences, meshes 2.The Euler method.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 21 Numerical Differentiation.
EEE 431 Computational Methods in Electrodynamics
NUMERICAL DIFFERENTIATION Forward Difference Formula
Numerical Differentiation
Simple FD Gerard T. Schuster.
Advanced Numerical Methods (S. A. Sahu) Code: AMC 51151
The taylor series and Numerical Differentiation
Lecture 19 MA471 Fall 2003.
CHE 391 T. F. Edgar Spring 2012.
NUMERICAL DIFFERENTIATION AND INTEGRATION
MATRICES AND DETERMINANTS
ME/AE 339 Computational Fluid Dynamics K. M. Isaac Topic2_PDE
Chapter 27.
Numerical differentiation
topic13_grid_generation
Nonlinear regression.
6.5 Taylor Series Linearization
Chapter 7: Matrices and Systems of Equations and Inequalities
The taylor series and Numerical Differentiation
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
Akram Bitar and Larry Manevitz Department of Computer Science
Derivatives and Gradients
Presentation transcript:

To Dream the Impossible Scheme Part 1 Approximating Derivatives on Non-Uniform, Skewed and Random Grid Schemes Part 2 Applying Rectangular Finite Difference Schemes to Non-Rectangular Regions to Approximate Solutions to Partial Differential Equations

Approximating Derivatives on Non-Uniform, Skewed and Random, Grid Schemes Skewed Non-Uniform Random

Approximating Derivatives from a Data Table xy=f(x) How do we approximate f’(.5)

Approximating Derivatives from a Data Table xy=f(x) Point Forward Difference Approximation

Approximating Derivatives from a Data Table xy=f(x) Point Backward Difference Approximation

Approximating Derivatives from a Data Table xy=f(x) Point Central Difference Approximation

Approximating Derivatives from a Data Table xy=f(x) In Summary … so Far MethodApproximation 2-PT BD PT CD PT FD 5.64 Which is right? Which is better?

Approximating Derivatives from a Data Table xy=f(x) PT FD Approx

Approximating Derivatives from a Data Table xy=f(x) PT CD Approximation Note the new compact notation:

Approximating Derivatives from a Data Table xy=f(x) PT FD Approximation:

Approximating Derivatives from a Data Table xy=f(x) In Summary MethodApproximation 2-PT BD PT CD PT FD PT FD PT CD PT FD 5.00 Which is the best approximation?

Approximating Derivatives from a Data Table xy=f(x) MethodApproximation 2-PT BD PT CD PT FD PT FD PT CD PT CD 5.00

Estimates of the 1 st Derivative (CRC) 2-point FD: 3-point FD: 4-point CD: 5-point FD: 2-point CD:

Estimates of Higher Order Derivatives (CRC) 2 nd D,2-point CD : 3 rd D, 4-point FD: 3 rd D, 4-point CD: 4 th D, 5-point FD: 4 th D, 5-point CD:

What’s Missing? Derivative Grid Scheme# Points1234>=5 Forward/ Backward Difference 2 ☺ na 3 ☺☺ 4 ??? ☺ na 5 ☺ ??? ☺ >6 ??? Central Difference 2 ☺ na 3 ??? ☺ na 4 ☺ ??? ☺ na 5 ??? ☺ na >6 ??? Non-Uniform ??? Skewed-Grid Schemes ???

Where do these Equations Come From –Derivation starts with the Taylor Series centered on x: –i.e: –Or in a shorthand form the you will see on the following slides:

Derivation of 2-Point BD Equation for the 1 st Derivative on a Uniform Grid Where: f n =f(x 0 +nδ) where δ is the grid spacing. Note: Equation for f 0 is expanded for use in further derivation Note: Define 0 0 =1 Start with Three 3-Term Taylor Series Expansions.

Derivation of 3-Point BD Equation for the 1 st Derivative on a Uniform Grid Multiply Each Equation by a Weight ω n. Note: Error term dropped for the time being for brevity

Derivation of 3-Point BD Equation for the 1 st Derivative on a Uniform Grid Sum up the Coefficients to Generate the 1 st Derivative Expression.

Derivation of 3-Point BD Equation for the 1 st Derivative on a Uniform Grid A little algebraic manipulation …

Derivation of 2-Point BD Equation for the 1 st Derivative on a Uniform Grid Note: A Vandermonde Matrix And rewritten as a matrix equation …

Derivation of 3-Point BD Equation for the 1 st Derivative on a Uniform Grid A General Vandermonde Matrix

Solving for ω -2 Using Cramer’s Rule Cofactor Expansion Determinant of a Vandermonde matrix

Derivation of 3-Point BD Equation for the 1 st Derivative on a Uniform Grid Solve for the Remaining Weights. Now use weights to calculate the coefficient of the remainder term …

Derivation of 3-Point BD Equation for the 1 st Derivative on a Uniform Grid Voila !.

Derivation of 3-Point BD Equation for the 2 nd Derivative on a Uniform Grid Alter RHS Slightly ….

Derivation of 5-Point CD Equation for the 3 rd Derivative on a Uniform GriD (or, if I desire, anything up to the 4 th Derivative)

System will also Work for Skew Grid Schemes (i.e. use backward 1 st and 4 th point and forward 1 st, 2 nd, and 6 th point to find the 3 rd derivative on a uniform grid) Note: The grid is “uniform”, the spacing between the points is not.

A General Matrix System (for an r-point approximation for the i th derivative) a n : integer that describes position of grid point with respect to center point (i.e. a n Δx).

Using Cramer's Rule to Solve for ω a 1

Which “Simplifies” to: Determinant of a Vandermonde matrix Cofactor Expansion About the 1 st Column and The (i+1) th Row

Turning our Attention to the Numerator … T. Ernst, Generalized Vendermonde Systems of Equations. Mathematics of Computation, 24, (1970) I.G. Macdonald, Symmetric Functions and Hall Polynomials, Oxford Mathematical Mongraphs, Second Ed S.D. Marchi, Polynomials arising in factoring generalized Vandermonde determinants: An algorthm for computing their coefficients, The Mathematical and Computer Modeling, 34 (2003) Minor of the Vandermonde Matrix With the (i+1) th row and n th column removed (from previous slide). Schur polynomial of order r-i-1 Vandermonde Matrix with the r th row and n th column removed.

Schur Polynomials

Therefore … det(V) Schur Polynomial

Finally … Where ω n is the n th weight for an r-point estimate of the i th derivative with grid points whose relative position to the center is given by {a 1, …, a r } and grid spacing is δ.

Recall the Earlier Example … (i.e. use backward 1 st and 4 th point and forward 1 st, 2 nd, and 6 th point to estimate the 3 rd derivative on a uniform grid) Note: The grid is “uniform”, the spacing between the points is not.

Using Algorithm Generates … xy=f(x)

It also Generates the 4 th Derivative… xy=f(x)

Derivative Grid Scheme# Points123 4>=5 Forward/ Backward Difference 2 ☺ na 3 ☺☺ 4 ☺☺☺ 5 ☺☺☺☺ >6 ☺☺☺☺☺ Central Difference 2 ☺ na 3 ☺☺ 4 ☺☺☺ 5 ☺☺☺☺ >6 ☺☺☺☺☺ Non-Uniform ☺☺☺☺☺ Skewed-Grid Schemes ☺☺☺☺☺

The Extension to Random Grids… A slight adjustment to this equation will accomplish this. Let δ=1 and a i be the position from the point of interest.

Applying Finite Difference Schemes to Non-Rectangular Regions

The Wave Equation on a Circular Membrane Object: Solve analytically using the polar from of the wave equation. Then compare to a numerical finite difference approximation that superimposes a rectangular grid on the circle. Note that the grid size varies from point to point on the circle.

The Wave Equation Rectangular Form: Wave Equation: Polar Form: (Radial Symmetry)

Boundary/Initial Conditions PDE ( ω=1, 0≤r ≤1 ): Boundary Conditions: Initial Conditions:

Analytic Solution J m : Bessel Function of the First Kind of order m μ mn : Is the n th eigenvalue of J m

Numeric Solution Since the grid is rectangular, use the rectangular form of the wave equation: The discrete form of this equation from finite difference methods Note: Based on 3-point central difference formulations of the spatial terms. Note: Based on 3-point backward difference formulation in time. Note: The time grid is uniform.

Numeric Solution Time Stepping: Stability Requirement: Δt ≤ smallest grid increment

Demonstration Using 3-pt CD Formulations

Future Research Apply to More Complex Regions