Numerical Methods in Computational Finance. Daniel J. Duffy

Чтение книги онлайн.

Читать онлайн книгу Numerical Methods in Computational Finance - Daniel J. Duffy страница 29

Numerical Methods in Computational Finance - Daniel J. Duffy

Скачать книгу

alt="k"/>-step method in the form (Henrici (1962), Lambert (1991)):

      where alpha Subscript j and beta Subscript j are constants, j equals 0 comma ellipsis comma k, and normal upper Delta t is the constant step-size.

      Since this is a k-step method, we need to give k initial conditions:

      (2.33)upper X 0 semicolon upper X 1 comma ellipsis comma upper X Subscript k minus 1 Baseline period

      We note that the first initial condition is known from the continuous problem (2.31) while the determination of the other k minus 1 numerical initial conditions is a part of the numerical problem. These k minus 1 numerical initial conditions must be chosen with care if we wish to avoid producing unstable schemes. In general, we compute these values by using Taylor's series expansions or by one-step methods.

      It can be shown that consistency (see Henrici (1962), Dahlquist and Björck (1974)) is equivalent to the following conditions:

      Let us take the explicit Euler method applied to IVP (2.31):

upper X Subscript n Baseline minus upper X Subscript n minus 1 Baseline equals normal upper Delta t mu left-parenthesis t Subscript n Baseline comma upper X Subscript n minus 1 Baseline right-parenthesis comma n equals 1 comma ellipsis comma upper N period

      The reader can check the following:

      (2.36)StartLayout 1st Row 1st Column rho left-parenthesis zeta right-parenthesis 2nd Column equals alpha 0 zeta plus alpha 1 equals zeta minus 1 2nd Row 1st Column sigma left-parenthesis zeta right-parenthesis 2nd Column equals 1 EndLayout

       The one-step () explicit and implicit Euler schemes.

       The two-step () leapfrog scheme.

       The three-step () Adams–Bashforth scheme.

       The one-step trapezoidal () scheme.

      Each of these schemes is consistent with the IVP (2.31), as can be checked by calculating their generating polynomials.

      We now discuss what is meant by the stability of a finite difference scheme. To take a simple counterexample, a scheme whose solution is exponentially increasing or oscillating in time while the exact solution is decreasing in time cannot be stable. In order to define stability, it is common practice to examine model problems (whose solutions are known) and apply various finite difference schemes to them. We then examine the stability properties of the schemes. The model problem in this case is the constant-coefficient scalar IVP in which the coefficient mu is a complex number:

      and whose solution is given by:

      (2.38)upper X left-parenthesis t right-parenthesis equals e Superscript mu t Baseline period

      Thus, the solution is increasing when mu is positive and real and decreasing when mu is negative and real. The corresponding finite difference schemes should have similar properties. We take an example of the one-step trapezoidal method:

Скачать книгу