Numerical Analysis 2011160001 Yu Jieun.

Slides:



Advertisements
Similar presentations
Explicit vs Implicit. Explicit: Explicit: A function defined in terms of one variable. y= 3x + 2 is defined in terms of x only. Implicit: Implicit: A.
Advertisements

Technique of nondimensionalization Aim: –To remove physical dimensions –To reduce the number of parameters –To balance or distinguish different terms in.
Population dynamics of infectious diseases Arjan Stegeman.
Host population structure and the evolution of parasites
Chapter 20 Basic Numerical Procedures
Mech300 Numerical Methods, Hong Kong University of Science and Technology. 1 Part Seven Ordinary Differential Equations.
Lecture 34 - Ordinary Differential Equations - BVP CVEN 302 November 28, 2001.
The Finite Difference Method This section presents a quick overview bout the finite difference method. This method can be used to solve any partial differential.
Lecturer :Jan Röman Students:Daria Novoderejkina,Arad Tahmidi,Dmytro Sheludchenko.
Zheng Zhenlong, Dept of Finance,XMU Basic Numerical Procedures Chapter 19.
18.1 Options, Futures, and Other Derivatives, 5th edition © 2002 by John C. Hull Numerical Procedures Chapter 18.
Random Sampling, Point Estimation and Maximum Likelihood.
Chapter 8 Probability Section R Review. 2 Barnett/Ziegler/Byleen Finite Mathematics 12e Review for Chapter 8 Important Terms, Symbols, Concepts  8.1.
Variants of the 1D Wave Equation Jason Batchelder 6/28/07.
Implicit Differentiation
1 MGT 821/ECON 873 Numerical Procedures. 2 Approaches to Derivatives Valuation How to find the value of an option?  Black-Scholes partial differential.
The general linear 2ed order PDE in two variables x, y. Chapter 2:Linear Second-Order Equations Sec 2.2,2.3,2.4:Canonical Form Canonical Form.
Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Chapter 5 Discrete Random Variables.
McGraw-Hill/IrwinCopyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 5 Discrete Random Variables.
One model for the growth of a population is based on the assumption that the population grows at a rate proportional to the size of the population. That.
Basic Numerical Procedures Chapter 19 1 Options, Futures, and Other Derivatives, 7th Edition, Copyright © John C. Hull 2008.
MA2213 Lecture 11 PDE. Topics Introduction p Poisson equation p Visualization of numerical results p Boundary conditions p.
Basic Numerical Procedure
Math b (Discrete) Random Variables, Binomial Distribution.
Epidemics Pedro Ribeiro de Andrade Gilberto Câmara.
© K.Cuthbertson, D. Nitzsche FINANCIAL ENGINEERING: DERIVATIVES AND RISK MANAGEMENT (J. Wiley, 2001) K. Cuthbertson and D. Nitzsche Lecture Asset Price.
Engineering Analysis – Computational Fluid Dynamics –
Implicit Differentiation Objective: To find derivatives of functions that we cannot solve for y.
Implicit Differentiation. Implicitly vs. Explicitly Defined Functions y is given explicitly as a function of x (y is solved in terms of x) y is given.
3.7 – Implicit Differentiation An Implicit function is one where the variable “y” can not be easily solved for in terms of only “x”. Examples:
Da Nang-05/2015 Natural Science Department – Duy Tan University SPRING MOTION MODEL with Differential Equations In this section, we will learn: How to.
L – Modelling and Simulating Social Systems with MATLAB © ETH Zürich | Lesson 3 – Dynamical Systems Anders Johansson and Wenjian.
Differential Equations Linear Equations with Variable Coefficients.
Ch. 1 First-Order ODEs Ordinary differential equations (ODEs) Deriving them from physical or other problems (modeling) Solving them by standard methods.
Predicting the Future To Predict the Future, “all we have to have is a knowledge of how things are and an understanding of the rules that govern the changes.
Def: The mathematical description of a system or a phenomenon is called a mathematical model.
SS r SS r This model characterizes how S(t) is changing.
Worked examples and exercises are in the text STROUD PROGRAMME 24 FIRST-ORDER DIFFERENTIAL EQUATIONS.
STROUD Worked examples and exercises are in the text Programme 25: First-order differential equations FIRST-ORDER DIFFERENTIAL EQUATIONS PROGRAMME 25.
EMIS 7300 SYSTEMS ANALYSIS METHODS FALL 2005 Dr. John Lipp Copyright © 2005 Dr. John Lipp.
MTH 253 Calculus (Other Topics) Chapter 9 – Mathematical Modeling with Differential Equations Section 9.4 – Second-Order Linear Homogeneous Differential.
Solving Partial Differential Equation Numerically Pertemuan 13 Matakuliah: S0262-Analisis Numerik Tahun: 2010.
Numerical Analysis -Applications to SIR epidemic model and Computational Finance - with MATLAB Jaepil LEE.
Numerical Methods for derivatives pricing. 2 American Monte Carlo It’s difficult to price an option with early exercise using Monte Carlo But some options.
Final Exam Information These slides and more detailed information will be posted on the webpage later…
Topic Overview and Study Checklist. From Chapter 7 in the white textbook: Modeling with Differential Equations basic models exponential logistic modified.
The Pure Birth Process Derivation of the Poisson Probability Distribution Assumptions events occur completely at random the probability of an event occurring.
Introduction to Differential Equations
Chapter 3 Linear Systems Review
Review of Probability Theory
EEE 431 Computational Methods in Electrodynamics
Introduction to Differential Equations
Implicit Differentiation
3.6 Warm-Up Find y´´ Find the Derivative:.
Chain Rules for Functions of Several Variables
Scientific Computing Lab
FTCS Explicit Finite Difference Method for Evaluating European Options
CS 179 Lecture 17 Options Pricing.
Mathematical Finance An Introduction
Multiple Random Variables
Efficient Quantification of Uncertainties Associated with Reservoir Performance Simulations Dongxiao Zhang, The University of Oklahoma . The efficiency.
Implicit Differentiation
Graphing systems of linear equations and inequalities
Predicting the Future To Predict the Future, “all we have to have is a knowledge of how things are and an understanding of the rules that govern the changes.
Predicting the Future To Predict the Future, “all we have to have is a knowledge of how things are and an understanding of the rules that govern the changes.
Lecture 11: Binomial and Poisson Distributions
Bernoulli Trials Two Possible Outcomes Trials are independent.
PARTIAL DIFFERENTIATION 2
Introduction CSE 541.
Differential Equations As Mathematical Models
Presentation transcript:

Numerical Analysis 2011160001 Yu Jieun

01 02 03 Index SIR model Finite Difference Method, FDE Implicit Explicit Crank-Nicolson MATLAB Code 03 Monte Carlo Simulation MATLAB Code

01. SIR model Mathematical modeling of spread of disease

01 Variables ① S = S(t) : the number of susceptible individuals Independent variable : time t Dependent variables ① S = S(t) : the number of susceptible individuals ② I = I(t) : the number of infected individuals ③ R = R(t) : the number of removed individuals

01 Assumptions We can ignore birth and disease-unrelated death, like immigration, since the rate of infection and recovery is much faster than the time scale of births and deaths. The population is therefore closed, of constant size N, 𝑁=𝑆 𝑟 +𝐼 𝑟 +𝑅 𝑟

01 Assumptions Each infected individual has a fixed number 𝛽 of contacts per day that are sufficient to spread the disease and a fixed fraction 𝛾 of the infected group will recover during any given day. 𝑑𝑆 𝑑𝑟 =−𝛽𝐼𝑆, 𝑑𝐼 𝑑𝑟 =𝛽𝐼𝑆−𝛾𝐼, 𝑑𝑅 𝑑𝑟 =𝛾𝐼

01 Assumptions These processes which occur simultaneously are referred to as ‘the Law of Mass Action’, that the rate of contact between two groups in a population is proportional to the size of each of the groups concerned.

01 Suspectible Infective S I R Removed 𝛽𝐼𝑆 𝛾𝐼

01 MATLAB Code

01 General graph of SIR model

02. Finite Difference Model

02 Finite Difference Method Black & Scholes modelled stochastic differential equation about the price which follow Geometric Brownian Motion. where V is the price of the option as a function of stock price S and time t, r is the risk-free interest rate, 𝜎 is the volatility of the stock.

02 Finite Difference Method FDM is a method of calculating a numerical approximation to the partial differential equations to differential equations. It refers to the differential equation which is approximated to the derivative of a continuous function in the following forms. Forward Difference : 𝑢 𝑥 𝑥,𝑡 = 𝑢 𝑥+ℎ,𝑡 −𝑢(𝑥,𝑡) ℎ +𝑂 ℎ Backward Difference : 𝑢 𝑥 𝑥,𝑡 = 𝑢 𝑥,𝑡 −𝑢(𝑥−ℎ,𝑡) ℎ +𝑂 ℎ Central Difference : 𝑢 𝑥 𝑥,𝑡 = 𝑢 𝑥+ℎ,𝑡 −𝑢(𝑥−ℎ,𝑡) 2ℎ +𝑂 ℎ 2 .

02 Finite Difference Method For this, we constitutes a two-dimensional grid consisting of a variable of a partial differential equation.

02 1. Explicit FDM If we use the forward difference at time and a second-order central difference for the space derivative at position 𝑥 𝑗 . we get the recurrence equation:                                                                                We can obtain     from the other values this way :                                                                                     where                       

02 2. Implicit FDM If we use the backward difference at time and a second-order central difference for the space derivative at position 𝑥 𝑗 . we get the recurrence equation: We can obtain from solving a system of linear equations:

02 3. Crank-Nicolson method Finally if we use the central difference at time and a second-order central difference for the space derivative at position we get the recurrence equation:                                                                                                                                                      We can obtain    from solving a system of linear equations:                                                                  

02 MATLAB Code – Implicit FDM , call option

02 MATLAB Code

03. Monte Carlo Simulation

03 Monte Carlo Simulation Monte Carlo Simulation is a problem solving technique used to approximate the probability of certain outcomes by running multiple trial runs, called simulations, using random variables.

03 MATLAB Code The following MATLAB scripts performs the Monte-carlo simulation.

03 MATLAB Code

THANK YOU