DOCSLIB.ORG

Lecure 5 Finite Difference Methods

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lecure 5 Finite Difference Methods Chapter 5 Finite Difference Methods Math6911 S08, HM Zhu References 1. Chapters 5 and 9, Brandimarte 2. Section 17.8, Hull 3. Chapter 7, “Numerical analysis”, Burden and Faires 2 Math6911, S08, HM ZHU Outline • Finite difference (FD) approximation to the derivatives • Explicit FD method • Numerical issues • Implicit FD method • Crank-Nicolson method • Dealing with American options • Further comments 3 Math6911, S08, HM ZHU Chapter 5 Finite Difference Methods 5.1 Finite difference approximations Math6911 S08, HM Zhu Finite-difference mesh • Aim to approximate the values of the continuous function f(t, S) on a set of discrete points in (t, S) plane • Divide the S-axis into equally spaced nodes at distance ∆S apart, and, the t-axis into equally spaced nodes a distance ∆t apart • (t, S) plane becomes a mesh with mesh points on (i ∆t, j∆S) • We are interested in the values of f(t, S) at mesh points (i ∆t, j∆S), denoted as fi,j = fit,jS( ∆∆) 5 Math6911, S08, HM ZHU The mesh for finite-difference approximation fi,j = fit,jS( ∆∆) S Smax=M∆S ? j ∆S t i ∆t T=N ∆t 6 Math6911, S08, HM ZHU Black-Scholes Equation for a European option with value V(S,t) ∂V 1 ∂ 2V ∂V + σ 2S 2 + rS − rV = 0 (5.1) ∂t 2 ∂ 2S ∂S where 0 < S < +∞ and 0 ≤ t < T with proper final and boundary conditions Notes: This is a second-order hyperbolic, elliptic, or parabolic, forward or backward partial differential equation Its solution is sufficiently well behaved ,i.e. well-posed Math6911, S08, HM ZHU Finite difference approximations The basic idea of FDM is to replace the partial derivatives by approximations obtained by Taylor expansions near the point of interests For example, ∂+∆−+∆−f ()S,t f ()()S,t t f S,t f ()()S,t t f S,t =≈lim ∂∆tt∆→t 0 ∆ t for small ∆t,using Taylor expansion at point () S,t ∂fS,t() 2 fS,tt()()+∆ = fS,t + ∆ t + O() ∆ t ∂t () 8 Math6911, S08, HM ZHU Forward-, Backward-, and Central- difference approximation to 1st order derivatives central backward forward tt− ∆ t tt+ ∆ ∂+∆−ft,S( ) ft( t,S) ft,S( ) Forward: ≈+∆Ot() ∂∆tt ∂−−∆f() t,S f() t,S f ( t t,S ) Backward: ≈+∆Ot() ∂∆tt ∂+∆−−∆f() t,S f()() t t,S f t t,S 2 Central: ≈+∆Ot() ∂∆tt2 () Symmetric Central-difference approximations to 2nd order derivatives 2 ∂+∆−+−∆f( t,S) f( t,S S) 2 f( t,S) f( t,S S) 2 ≈+∆OS 2 2 ()() ∂S ()∆S Use Taylor's expansions for ft,S( +∆ S) and ft,S( −∆ S) around point ()t,S : ft,S()+∆ S = ? + ft,S()−∆ S = ? 10 Math6911, S08, HM ZHU Finite difference approximations ∂∂ffff− ff− Forward Difference:≈≈i,j++11 i,j, i,j i,j ∂∆tt ∂∆ SS ∂∂ffff−− ff Backward Difference: ≈≈i,j i−−11 ,j, i,j i,j ∂∆∂∆ttSS ∂∂ffff−− ff Central Difference: ≈≈i+−11 ,j i ,j, i,j +− 11 i,j ∂∆∂∆ttSS22 As to the second derivative, we have: 2 ∂ f ⎛⎞ffffi,j+−11−− i,j i,j i,j 2 ≈ ⎜⎟−∆S ∂S ⎝⎠∆∆SS fffi,j+−11−+2 i,j i,j = 2 ()∆S 11 Math6911, S08, HM ZHU Finite difference approximations • Depending on which combination of schemes we use in discretizing the equation, we will have explicit, implicit, or Crank-Nicolson methods • We also need to discretize the boundary and final conditions accordingly. For example, for European Call, Final Condition: fN,j =∆−= max() j S K ,0 , for j0 , 1 ,...,M Boundary Conditions: ⎪⎧ fi,0 = 0 , for i,,...,N= 0 1 ⎨ −−∆rN() i t ⎩⎪ fSKei,M=− max 12 Math6911, S08, HM ZHU where SMS.max =∆ Chapter 5 Finite Difference Methods 5.2.1 Explicit Finite-Difference Method Math6911 S08, HM Zhu Explicit Finite Difference Methods ∂∂ff1 ∂2 f In ++rSσ 22 S = rf, at point ( i ∆∆ t, j S ), set ∂∂tS2 ∂ S2 ∂ f ff− backward difference: ≈ i,j i−1 ,j ∂∆tt ∂f ff− central difference: ≈ i,j+−11 i,j , ∂∆SS2 and ∂ 2 f ff+−2 f ≈==∆i,j+−11 i,j i,j ,rf rf,S jS ∂∆SS22 i,j Math6911, S08, HM ZHU Explicit Finite Difference Methods Rewriting the equation, we get an explicit scheme: *** fafbfcfi−−11 ,j=++ j i,j j i,j j i,j + 1 (5.2) where * 1 22 atjrjj =∆()σ − 2 * 22 btjrj =−∆1 ()σ + * 1 22 ctjrjj =∆()σ + 2 for iN-,N-,...,, == 1210 and j 12, , ..., M - 1 . Math6911, S08, HM ZHU Numerical Computation Dependency S Smax=M∆S (j+1)∆S x j∆S x x (j-1)∆S x 0 0 (i-1)∆t i∆t T=N ∆t t Math6911, S08, HM ZHU Implementation 1. Starting with the final values fN,j , we apply (5.2) to solve fjN,j−1 for 1≤≤M. − 1 We use the boundary condition to determine ff. N, − 10 and N-,M 1 2. Repeat the process to determine f N, − 2 j and so on 17 Math6911, S08, HM ZHU Example We compare explicit finite difference solution for a European put with the exact Black-Scholes formula, where T = 5/12 yr, S0=$50, K = $50, σ=30%, r = 10%. Black-Scholes Price: $2.8446 EFD Method with Smax=$100, ∆S=2, ∆t=5/1200: $2.8288 EFD Method with Smax=$100, ∆S=1, ∆t=5/4800: $2.8406 18 Math6911, S08, HM ZHU Example (Stability) We compare explicit finite difference solution for a European put with the exact Black-Scholes formula, where T = 5/12 yr, S0=$50, K = $50, σ=30%, r = 10%. Black-Scholes Price: $2.8446 EFD Method with Smax=$100, ∆S=2, ∆t=5/1200: $2.8288 EFD Method with Smax=$100, ∆S=1.5, ∆t=5/1200: $3.1414 EFD Method with Smax=$100, ∆S=1, ∆t=5/1200: -$2.8271E22 19 Math6911, S08, HM ZHU Chapter 5 Finite Difference Methods 5.2.2 Numerical Stability Math6911 S08, HM Zhu Numerical Accuracy • The problem itself • The discretization scheme used • The numerical algorithm used 21 Math6911, S08, HM ZHU Conditioning Issue Suppose we have mathematically posed problem: yfx= () where yx is to evaluated given an input . Let xxx* =+δδ for small change x. * If hen fx() is near fx,() then we call the problem is well - conditioned. Otherwise, it is ill-posed/ill-conditioned. 22 Math6911, S08, HM ZHU Conditioning Issue • Conditioning issue is related to the problem itself, not to the specific numerical algorithm; Stability issue is related to the numerical algorithm • One can not expect a good numerical algorithm to solve an ill- conditioned problem any more accurately than the data warrant • But a bad numerical algorithm can produce poor solutions even to well-conditioned problems 23 Math6911, S08, HM ZHU Conditional Issue The concept "near" can be measured by further information about the particular problem: * fx()− fx() δ x ≤≠Cfx()() 0 fx() x where C is called condition number of this problem. If C is large, the problem is ill-conditioned. 24 Math6911, S08, HM ZHU Floating Point Number & Error Let x be any real number. e Infinite decimal expansion : x = ± .x1x2 xd 10 e Truncated floating point number : x ≈ fl()x = ± .x1x2 xd 10 where x1 ≠ 0, 0 ≤ xi ≤ 9, d : an integer, precision of the floating point system e : an bounded integer Floating point or roundoff error : fl()x − x 25 Math6911, S08, HM ZHU Error Propagation When additional calculations are done, there is an accumulation of these floating point errors. Example : Let x = − 0.6667 and fl()x = −0.667 100 where d = 3. Floating point error : fl()x − x = −0.0003 Error propagation : fl()x 2 − x2 = 0.00040011 26 Math6911, S08, HM ZHU Numerical Stability or Instability Stability ensures if the error between the numerical soltuion and the exact solution remains bounded as numerical computation progresses. * That is, fx()(the solution of a slightly perturbed problem) * is near fx()(the computed solution ) . Stability concerns about the behavior offfit,jSi,j −∆∆() as numerical computation progresses for fixed discretization steps ∆∆t and S. 27 Math6911, S08, HM ZHU Convergence issue Convergence of the numerical algorithm concerns about the behavior of ffit,jSt,i,j −∆∆() as ∆∆→S 0 for fixed values ()it,jS∆∆. For well-posed linear initial value problem, Stability ⇔ Convergence (Lax's equivalence theorem, Richtmyer and Morton, "Difference Methods for Initial Value Problems" (2nd) 1967) 28 Math6911, S08, HM ZHU Numerical Accuracy • These factors contribute the accuracy of a numerical solution. We can find a “good” estimate if our problem is well- conditioned and the algorithm is stable ** ⎫ Stable: fx()≈ fx( ) ⎪ fx* ()≈ fx () * ⎬ Well-conditioned: fx()≈ fx()⎭⎪ 29 Math6911, S08, HM ZHU Chapter 5 Finite Difference Methods 5.2.3 Financial Interpretation of Numerical Instability Math6911 S08, HM Zhu Financial Interpretation of instability (Hall, page 423-4) If ∂∂fS and ∂2 fS ∂2 are assumed to be the same at ( i,j +1 ) as they are at (i, j ), we obtain equations of the form: ˆ fafbfcfi,j=++ˆˆ ji,j+−11 ji,j + 1 ji,j ++ 11 (5.3) where 1 ⎛⎞1122 1 aˆ j = ⎜⎟∆−∆=tjσπ trj d 1 +∆rt⎝⎠221 +∆ rt ˆ 1122 bjtj =−∆=()1 σπ0 11+∆rt +∆ rt 11⎛⎞1122 ctjtrjˆ j =∆+∆=⎜⎟σπu 11+∆rt⎝⎠22 +∆ rt for i == N -1210 , N - , ..., , and j 12 , , ..., M - 1 . Math6911, S08, HM ZHU Explicit Finite Difference Methods ƒi +1, j +1 πu π0 ƒi , j ƒi +1, j πd ƒi +1, j –1 These coefficients can be interpreted as probabilities times a discount factor. If one of these probability < 0, instability occurs. Math6911, S08, HM ZHU Explicit Finite Difference Method as Trinomial Tree Check if the mean and variance of the Expected value of the increase in asset price during ∆t: E[]∆=−∆SSrjStrStππdu + 0 0 +∆ π = ∆ ∆= ∆ Variance of the increment: ⎡⎤2 2222 2 2 2 E⎣⎦∆=−∆()SSππd + 0 0 +∆ () πu = σσjSt()∆∆=∆ St 2 2 22 222 22 Var[]∆= E⎣⎦⎡⎤ ∆ − E [] ∆=σσStrSt ∆−() ∆ ≈ St ∆ which is coherent with geometric Brownian motion in a risk-neutral world Math6911, S08, HM ZHU Change of Variable Define ZlnS.= The B-S equation becomes ∂∂∂fff⎛⎞σσ222 +−⎜⎟rrf +2 = ∂∂∂tZZ⎝⎠22 The corresponding difference equation is 22 ffi,j++++−+++−++11111111111−−−+ i,j⎛⎞σσ f i,j f i,j f i,j2 f i,j f i,j +−⎜⎟rr +2 =fi,j ∆∆∆tZZ⎝⎠22 2 or *** fi,j=++αβγ ji,jfff+−11 ji,j + 1 ji,j ++ 11 ()54 .
Load more

Recommended publications
  • Chapter 4 Finite Difference Gradient Information
    Chapter 4 Finite Difference Gradient Information In the masters thesis Thoresson (2003), the feasibility of using gradient- based approximation methods for the optimisation of the spring and damper characteristics of an off-road vehicle, for both ride comfort and handling, was investigated. The Sequential Quadratic Programming (SQP) algorithm and the locally developed Dynamic-Q method were the two successive approximation methods used for the optimisation. The determination of the objective function value is performed using computationally expensive numerical simulations that exhibit severe inherent numerical noise. The use of forward finite differences and central finite differences for the determination of the gradients of the objective function within Dynamic-Q is also investigated. The results of this study, presented here, proved that the use of central finite differencing for gradient information improved the optimisation convergence history, and helped to reduce the difficulties associated with noise in the objective and constraint functions. This chapter presents the feasibility investigation of using gradient-based successive approximation methods to overcome the problems of poor gradient information due to severe numerical noise. The two approximation methods applied here are the locally developed Dynamic-Q optimisation algorithm of Snyman and Hay (2002) and the well known Sequential Quadratic 47 CHAPTER 4. FINITE DIFFERENCE GRADIENT INFORMATION 48 Programming (SQP) algorithm, the MATLAB implementation being used for this research (Mathworks 2000b). This chapter aims to provide the reader with more information regarding the Dynamic-Q successive approximation algorithm, that may be used as an alternative to the more established SQP method. Both algorithms are evaluated for effectiveness and efficiency in determining optimal spring and damper characteristics for both ride comfort and handling of a vehicle.
    [Show full text]
  • Finite Difference Methods for Solving Differential
    FINITE DIFFERENCE METHODS FOR SOLVING DIFFERENTIAL EQUATIONS I-Liang Chern Department of Mathematics National Taiwan University May 16, 2013 2 Contents 1 Introduction 3 1.1 Finite Difference Approximation . ........ 3 1.2 Basic Numerical Methods for Ordinary Differential Equations ........... 5 1.3 Runge-Kuttamethods..... ..... ...... ..... ...... ... ... 8 1.4 Multistepmethods ................................ 10 1.5 Linear difference equation . ...... 14 1.6 Stabilityanalysis ............................... 17 1.6.1 ZeroStability................................. 18 2 Finite Difference Methods for Linear Parabolic Equations 23 2.1 Finite Difference Methods for the Heat Equation . ........... 23 2.1.1 Some discretization methods . 23 2.1.2 Stability and Convergence for the Forward Euler method.......... 25 2.2 L2 Stability – von Neumann Analysis . 26 2.3 Energymethod .................................... 28 2.4 Stability Analysis for Montone Operators– Entropy Estimates ........... 29 2.5 Entropy estimate for backward Euler method . ......... 30 2.6 ExistenceTheory ................................. 32 2.6.1 Existence via forward Euler method . ..... 32 2.6.2 A Sharper Energy Estimate for backward Euler method . ......... 33 2.7 Relaxationoferrors.............................. 34 2.8 BoundaryConditions ..... ..... ...... ..... ...... ... 36 2.8.1 Dirichlet boundary condition . ..... 36 2.8.2 Neumann boundary condition . 37 2.9 The discrete Laplacian and its inversion . .......... 38 2.9.1 Dirichlet boundary condition . ..... 38 3 Finite Difference Methods for Linear elliptic Equations 41 3.1 Discrete Laplacian in two dimensions . ........ 41 3.1.1 Discretization methods . 41 3.1.2 The 9-point discrete Laplacian . ..... 42 3.2 Stability of the discrete Laplacian . ......... 43 3 4 CONTENTS 3.2.1 Fouriermethod ................................ 43 3.2.2 Energymethod ................................ 44 4 Finite Difference Theory For Linear Hyperbolic Equations 47 4.1 A review of smooth theory of linear hyperbolic equations .............
    [Show full text]
  • Exercises from Finite Difference Methods for Ordinary and Partial
    Exercises from Finite Difference Methods for Ordinary and Partial Differential Equations by Randall J. LeVeque SIAM, Philadelphia, 2007 http://www.amath.washington.edu/ rjl/fdmbook ∼ Under construction | more to appear. Contents Chapter 1 4 Exercise 1.1 (derivation of finite difference formula) . 4 Exercise 1.2 (use of fdstencil) . 4 Chapter 2 5 Exercise 2.1 (inverse matrix and Green's functions) . 5 Exercise 2.2 (Green's function with Neumann boundary conditions) . 5 Exercise 2.3 (solvability condition for Neumann problem) . 5 Exercise 2.4 (boundary conditions in bvp codes) . 5 Exercise 2.5 (accuracy on nonuniform grids) . 6 Exercise 2.6 (ill-posed boundary value problem) . 6 Exercise 2.7 (nonlinear pendulum) . 7 Chapter 3 8 Exercise 3.1 (code for Poisson problem) . 8 Exercise 3.2 (9-point Laplacian) . 8 Chapter 4 9 Exercise 4.1 (Convergence of SOR) . 9 Exercise 4.2 (Forward vs. backward Gauss-Seidel) . 9 Chapter 5 11 Exercise 5.1 (Uniqueness for an ODE) . 11 Exercise 5.2 (Lipschitz constant for an ODE) . 11 Exercise 5.3 (Lipschitz constant for a system of ODEs) . 11 Exercise 5.4 (Duhamel's principle) . 11 Exercise 5.5 (matrix exponential form of solution) . 11 Exercise 5.6 (matrix exponential form of solution) . 12 Exercise 5.7 (matrix exponential for a defective matrix) . 12 Exercise 5.8 (Use of ode113 and ode45) . 12 Exercise 5.9 (truncation errors) . 13 Exercise 5.10 (Derivation of Adams-Moulton) . 13 Exercise 5.11 (Characteristic polynomials) . 14 Exercise 5.12 (predictor-corrector methods) . 14 Exercise 5.13 (Order of accuracy of Runge-Kutta methods) .
    [Show full text]
  • The Original Euler's Calculus-Of-Variations Method: Key
    Submitted to EJP 1 Jozef Hanc, [email protected] The original Euler’s calculus-of-variations method: Key to Lagrangian mechanics for beginners Jozef Hanca) Technical University, Vysokoskolska 4, 042 00 Kosice, Slovakia Leonhard Euler's original version of the calculus of variations (1744) used elementary mathematics and was intuitive, geometric, and easily visualized. In 1755 Euler (1707-1783) abandoned his version and adopted instead the more rigorous and formal algebraic method of Lagrange. Lagrange’s elegant technique of variations not only bypassed the need for Euler’s intuitive use of a limit-taking process leading to the Euler-Lagrange equation but also eliminated Euler’s geometrical insight. More recently Euler's method has been resurrected, shown to be rigorous, and applied as one of the direct variational methods important in analysis and in computer solutions of physical processes. In our classrooms, however, the study of advanced mechanics is still dominated by Lagrange's analytic method, which students often apply uncritically using "variational recipes" because they have difficulty understanding it intuitively. The present paper describes an adaptation of Euler's method that restores intuition and geometric visualization. This adaptation can be used as an introductory variational treatment in almost all of undergraduate physics and is especially powerful in modern physics. Finally, we present Euler's method as a natural introduction to computer-executed numerical analysis of boundary value problems and the finite element method. I. INTRODUCTION In his pioneering 1744 work The method of finding plane curves that show some property of maximum and minimum,1 Leonhard Euler introduced a general mathematical procedure or method for the systematic investigation of variational problems.
    [Show full text]
  • Finite Difference and Discontinuous Galerkin Methods for Wave Equations
    Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1522 Finite Difference and Discontinuous Galerkin Methods for Wave Equations SIYANG WANG ACTA UNIVERSITATIS UPSALIENSIS ISSN 1651-6214 ISBN 978-91-554-9927-3 UPPSALA urn:nbn:se:uu:diva-320614 2017 Dissertation presented at Uppsala University to be publicly examined in Room 2446, Polacksbacken, Lägerhyddsvägen 2, Uppsala, Tuesday, 13 June 2017 at 10:15 for the degree of Doctor of Philosophy. The examination will be conducted in English. Faculty examiner: Professor Thomas Hagstrom (Department of Mathematics, Southern Methodist University). Abstract Wang, S. 2017. Finite Difference and Discontinuous Galerkin Methods for Wave Equations. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1522. 53 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-554-9927-3. Wave propagation problems can be modeled by partial differential equations. In this thesis, we study wave propagation in fluids and in solids, modeled by the acoustic wave equation and the elastic wave equation, respectively. In real-world applications, waves often propagate in heterogeneous media with complex geometries, which makes it impossible to derive exact solutions to the governing equations. Alternatively, we seek approximated solutions by constructing numerical methods and implementing on modern computers. An efficient numerical method produces accurate approximations at low computational cost. There are many choices of numerical methods for solving partial differential equations. Which method is more efficient than the others depends on the particular problem we consider. In this thesis, we study two numerical methods: the finite difference method and the discontinuous Galerkin method.
    [Show full text]
  • Upwind Summation by Parts Finite Difference Methods for Large Scale
    Upwind summation by parts finite difference methods for large scale elastic wave simulations in 3D complex geometries ? Kenneth Durua,∗, Frederick Funga, Christopher Williamsa aMathematical Sciences Institute, Australian National University, Australia. Abstract High-order accurate summation-by-parts (SBP) finite difference (FD) methods constitute efficient numerical methods for simulating large-scale hyperbolic wave propagation problems. Traditional SBP FD operators that approximate first-order spatial derivatives with central-difference stencils often have spurious unresolved numerical wave-modes in their computed solutions. Recently derived high order accurate upwind SBP operators based non-central (upwind) FD stencils have the potential to suppress these poisonous spurious wave-modes on marginally resolved computational grids. In this paper, we demonstrate that not all high order upwind SBP FD operators are applicable. Numerical dispersion relation analysis shows that odd-order upwind SBP FD operators also support spurious unresolved high-frequencies on marginally resolved meshes. Meanwhile, even-order upwind SBP FD operators (of order 2; 4; 6) do not support spurious unresolved high frequency wave modes and also have better numerical dispersion properties. For all the upwind SBP FD operators we discretise the three space dimensional (3D) elastic wave equation on boundary-conforming curvilinear meshes. Using the energy method we prove that the semi-discrete ap- proximation is stable and energy-conserving. We derive a priori error estimate and prove the convergence of the numerical error. Numerical experiments for the 3D elastic wave equation in complex geometries corrobo- rate the theoretical analysis. Numerical simulations of the 3D elastic wave equation in heterogeneous media with complex non-planar free surface topography are given, including numerical simulations of community developed seismological benchmark problems.
    [Show full text]
  • High Order Gradient, Curl and Divergence Conforming Spaces, with an Application to NURBS-Based Isogeometric Analysis
    High order gradient, curl and divergence conforming spaces, with an application to compatible NURBS-based IsoGeometric Analysis R.R. Hiemstraa, R.H.M. Huijsmansa, M.I.Gerritsmab aDepartment of Marine Technology, Mekelweg 2, 2628CD Delft bDepartment of Aerospace Technology, Kluyverweg 2, 2629HT Delft Abstract Conservation laws, in for example, electromagnetism, solid and fluid mechanics, allow an exact discrete representation in terms of line, surface and volume integrals. We develop high order interpolants, from any basis that is a partition of unity, that satisfy these integral relations exactly, at cell level. The resulting gradient, curl and divergence conforming spaces have the propertythat the conservationlaws become completely independent of the basis functions. This means that the conservation laws are exactly satisfied even on curved meshes. As an example, we develop high ordergradient, curl and divergence conforming spaces from NURBS - non uniform rational B-splines - and thereby generalize the compatible spaces of B-splines developed in [1]. We give several examples of 2D Stokes flow calculations which result, amongst others, in a point wise divergence free velocity field. Keywords: Compatible numerical methods, Mixed methods, NURBS, IsoGeometric Analyis Be careful of the naive view that a physical law is a mathematical relation between previously defined quantities. The situation is, rather, that a certain mathematical structure represents a given physical structure. Burke [2] 1. Introduction In deriving mathematical models for physical theories, we frequently start with analysis on finite dimensional geometric objects, like a control volume and its bounding surfaces. We assign global, ’measurable’, quantities to these different geometric objects and set up balance statements.
    [Show full text]
  • A Quasi-Static Particle-In-Cell Algorithm Based on an Azimuthal Fourier Decomposition for Highly Efficient Simulations of Plasma-Based Acceleration
    A quasi-static particle-in-cell algorithm based on an azimuthal Fourier decomposition for highly efficient simulations of plasma-based acceleration: QPAD Fei Lia,c, Weiming And,∗, Viktor K. Decykb, Xinlu Xuc, Mark J. Hoganc, Warren B. Moria,b aDepartment of Electrical Engineering, University of California Los Angeles, Los Angeles, CA 90095, USA bDepartment of Physics and Astronomy, University of California Los Angeles, Los Angeles, CA 90095, USA cSLAC National Accelerator Laboratory, Menlo Park, CA 94025, USA dDepartment of Astronomy, Beijing Normal University, Beijing 100875, China Abstract The three-dimensional (3D) quasi-static particle-in-cell (PIC) algorithm is a very effi- cient method for modeling short-pulse laser or relativistic charged particle beam-plasma interactions. In this algorithm, the plasma response, i.e., plasma wave wake, to a non- evolving laser or particle beam is calculated using a set of Maxwell's equations based on the quasi-static approximate equations that exclude radiation. The plasma fields are then used to advance the laser or beam forward using a large time step. The algorithm is many orders of magnitude faster than a 3D fully explicit relativistic electromagnetic PIC algorithm. It has been shown to be capable to accurately model the evolution of lasers and particle beams in a variety of scenarios. At the same time, an algorithm in which the fields, currents and Maxwell equations are decomposed into azimuthal harmonics has been shown to reduce the complexity of a 3D explicit PIC algorithm to that of a 2D algorithm when the expansion is truncated while maintaining accuracy for problems with near azimuthal symmetry.
    [Show full text]
  • The Pascal Matrix Function and Its Applications to Bernoulli Numbers and Bernoulli Polynomials and Euler Numbers and Euler Polynomials
    The Pascal Matrix Function and Its Applications to Bernoulli Numbers and Bernoulli Polynomials and Euler Numbers and Euler Polynomials Tian-Xiao He ∗ Jeff H.-C. Liao y and Peter J.-S. Shiue z Dedicated to Professor L. C. Hsu on the occasion of his 95th birthday Abstract A Pascal matrix function is introduced by Call and Velleman in [3]. In this paper, we will use the function to give a unified approach in the study of Bernoulli numbers and Bernoulli poly- nomials. Many well-known and new properties of the Bernoulli numbers and polynomials can be established by using the Pascal matrix function. The approach is also applied to the study of Euler numbers and Euler polynomials. AMS Subject Classification: 05A15, 65B10, 33C45, 39A70, 41A80. Key Words and Phrases: Pascal matrix, Pascal matrix func- tion, Bernoulli number, Bernoulli polynomial, Euler number, Euler polynomial. ∗Department of Mathematics, Illinois Wesleyan University, Bloomington, Illinois 61702 yInstitute of Mathematics, Academia Sinica, Taipei, Taiwan zDepartment of Mathematical Sciences, University of Nevada, Las Vegas, Las Vegas, Nevada, 89154-4020. This work is partially supported by the Tzu (?) Tze foundation, Taipei, Taiwan, and the Institute of Mathematics, Academia Sinica, Taipei, Taiwan. The author would also thank to the Institute of Mathematics, Academia Sinica for the hospitality. 1 2 T. X. He, J. H.-C. Liao, and P. J.-S. Shiue 1 Introduction A large literature scatters widely in books and journals on Bernoulli numbers Bn, and Bernoulli polynomials Bn(x). They can be studied by means of the binomial expression connecting them, n X n B (x) = B xn−k; n ≥ 0: (1) n k k k=0 The study brings consistent attention of researchers working in combi- natorics, number theory, etc.
    [Show full text]
  • A Numerical Method of Characteristics for Solving Hyperbolic Partial Differential Equations David Lenz Simpson Iowa State University
    Iowa State University Capstones, Theses and Retrospective Theses and Dissertations Dissertations 1967 A numerical method of characteristics for solving hyperbolic partial differential equations David Lenz Simpson Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/rtd Part of the Mathematics Commons Recommended Citation Simpson, David Lenz, "A numerical method of characteristics for solving hyperbolic partial differential equations " (1967). Retrospective Theses and Dissertations. 3430. https://lib.dr.iastate.edu/rtd/3430 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. This dissertation has been microfilmed exactly as received 68-2862 SIMPSON, David Lenz, 1938- A NUMERICAL METHOD OF CHARACTERISTICS FOR SOLVING HYPERBOLIC PARTIAL DIFFERENTIAL EQUATIONS. Iowa State University, PluD., 1967 Mathematics University Microfilms, Inc., Ann Arbor, Michigan A NUMERICAL METHOD OF CHARACTERISTICS FOR SOLVING HYPERBOLIC PARTIAL DIFFERENTIAL EQUATIONS by David Lenz Simpson A Dissertation Submitted to the Graduate Faculty in Partial Fulfillment of The Requirements for the Degree of DOCTOR OF PHILOSOPHY Major Subject: Mathematics Approved: Signature was redacted for privacy. In Cijarge of Major Work Signature was redacted for privacy. Headead of^ajorof Major DepartmentDepartmen Signature was redacted for privacy. Dean Graduate Co11^^ Iowa State University of Science and Technology Ames, Iowa 1967 ii TABLE OF CONTENTS Page I. INTRODUCTION 1 II. DISCUSSION OF THE ALGORITHM 3 III. DISCUSSION OF LOCAL ERROR, EXISTENCE AND UNIQUENESS THEOREMS 10 IV.
    [Show full text]
  • Analysis of Finite Difference Discretization Schemes For
    Computers and Chemical Engineering 71 (2014) 241–252 Contents lists available at ScienceDirect Computers and Chemical Engineering j ournal homepage: www.elsevier.com/locate/compchemeng Analysis of finite difference discretization schemes for diffusion in spheres with variable diffusivity ∗ Ashlee N. Ford Versypt, Richard D. Braatz Department of Chemical Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139, USA a r t i c l e i n f o a b s t r a c t Article history: Two finite difference discretization schemes for approximating the spatial derivatives in the diffusion Received 28 April 2014 equation in spherical coordinates with variable diffusivity are presented and analyzed. The numerical Accepted 27 May 2014 solutions obtained by the discretization schemes are compared for five cases of the functional form Available online 27 August 2014 for the variable diffusivity: (I) constant diffusivity, (II) temporally dependent diffusivity, (III) spatially dependent diffusivity, (IV) concentration-dependent diffusivity, and (V) implicitly defined, temporally Keywords: and spatially dependent diffusivity. Although the schemes have similar agreement to known analytical Finite difference method or semi-analytical solutions in the first four cases, in the fifth case for the variable diffusivity, one scheme Variable coefficient Diffusion produces a stable, physically reasonable solution, while the other diverges. We recommend the adoption of the more accurate and stable of these finite difference discretization schemes to numerically approxi- Spherical geometry Method of lines mate the spatial derivatives of the diffusion equation in spherical coordinates for any functional form of variable diffusivity, especially cases where the diffusivity is a function of position. © 2014 Elsevier Ltd.
    [Show full text]
  • Numerical Stability & Numerical Smoothness of Ordinary Differential
    NUMERICAL STABILITY & NUMERICAL SMOOTHNESS OF ORDINARY DIFFERENTIAL EQUATIONS Kaitlin Reddinger A Thesis Submitted to the Graduate College of Bowling Green State University in partial fulfillment of the requirements for the degree of MASTER OF ARTS August 2015 Committee: Tong Sun, Advisor So-Hsiang Chou Kimberly Rogers ii ABSTRACT Tong Sun, Advisor Although numerically stable algorithms can be traced back to the Babylonian period, it is be- lieved that the study of numerical methods for ordinary differential equations was not rigorously developed until the 1700s. Since then the field has expanded - first with Leonhard Euler’s method and then with the works of Augustin Cauchy, Carl Runge and Germund Dahlquist. Now applica- tions involving numerical methods can be found in a myriad of subjects. With several centuries worth of diligent study devoted to the crafting of well-conditioned problems, it is surprising that one issue in particular - numerical stability - continues to cloud the analysis and implementation of numerical approximation. According to professor Paul Glendinning from the University of Cambridge, “The stability of solutions of differential equations can be a very difficult property to pin down. Rigorous mathemat- ical definitions are often too prescriptive and it is not always clear which properties of solutions or equations are most important in the context of any particular problem. In practice, different definitions are used (or defined) according to the problem being considered. The effect of this confusion is that there are more than 57 varieties of stability to choose from” [10]. Although this quote is primarily in reference to nonlinear problems, it can most certainly be applied to the topic of numerical stability in general.
    [Show full text]