Numerical Methods in Computational Finance. Daniel J. Duffy

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

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

Numerical Methods in Computational Finance - Daniel J. Duffy

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

      In Chapter 3 we continue with our discussion of ODEs, including code examples in C++ and Python.

      Consider a bounded interval left-bracket 0 comma upper T right-bracket where upper T greater-than 0. This interval could represent time or distance, for example. In most cases we shall view this interval as representing time values. In the interval we define the initial value problem (IVP) for an ODE:

      where upper L is a first-order linear differential operator involving the derivative with respect to the time variable and a equals a left-parenthesis t right-parenthesis is a strictly positive function in left-bracket 0 comma upper T right-bracket. The term f left-parenthesis t right-parenthesis is called the inhomogeneous forcing term, and it is independent of u. Finally, the solution to the IVP must be specified at t equals 0; this is the so-called initial condition.

      (See Hochstadt (1964), where the so-called integration factor is used to determine a solution.)

      A special case of (2.1) is when the right-hand term f left-parenthesis t right-parenthesis is zero and a left-parenthesis t right-parenthesis is constant; in this case the solution becomes a simple exponential term without any integrals, and this will be used later when we examine difference schemes to determine their feasibility. In particular, a scheme that behaves badly for the above special case will be unsuitable for more general or more complex problems unless some modifications are introduced.

      2.2.1 Qualitative Properties of the Solution and Maximum Principle

      Before we introduce difference schemes for (2.1), we discuss a number of results that allow us to describe how the solution u behaves. First, we wish to conclude that if the initial value upper A and inhomogeneous term f left-parenthesis t right-parenthesis are positive, then the solution u left-parenthesis t right-parenthesis should also be positive for any value t in left-bracket 0 comma upper T right-bracket. This so-called positivity or monotonicity result should be reflected in our difference schemes (not all schemes possess this property). Second, we wish to know how the solution u left-parenthesis t right-parenthesis grows or decreases as a function of time. The following two results deal with these issues.

      Lemma 2.1 (Positivity). Let the operator upper L be defined in Equation (2.1), and let w be a well-behaved function satisfying the inequalities:

StartLayout 1st Row 1st Column Blank 2nd Column upper L w left-parenthesis t right-parenthesis greater-than-or-equal-to 0 for-all t element-of left-bracket 0 comma upper T right-bracket 2nd Row 1st Column Blank 2nd Column w left-parenthesis 0 right-parenthesis greater-than-or-equal-to 0 period EndLayout w left-parenthesis t right-parenthesis greater-than-or-equal-to 0 for-all t element-of left-bracket 0 comma upper T right-bracket period

      Roughly speaking, this lemma states that you cannot get a negative solution from positive input.

      The following result gives bounds on the growth of u left-parenthesis t right-parenthesis.

      Theorem 2.1 Let u left-parenthesis t right-parenthesis be the solution of Equation

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