Identification of the initial function for discretized delay differential equations

  • Authors:

  • C. T. H. Baker;E. I. Parmuzin

  • Affiliations:

  • Mathematics Department, University College Chester, Chester, UK and School of Mathematics, The University of Manchester, Oxford Road, Manchester M13 9PL, UK;School of Mathematics, The University of Manchester, Oxford Road, Manchester M13 9PL, UK and Institute of Numerical Mathematics, RAS, Moscow, Russia

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2005

Quantified Score

Hi-index 7.29

Visualization

Abstract

In the present work, we analyze a discrete analogue for the problem of the identification of the initial function for a delay differential equation (DDE) discussed by Baker and Parmuzin in 2004. The basic problem consists of finding an initial function that gives rise to a solution of a discretized DDE, which is a close fit to observed data. In the continuous problem (finding an initial function that gives rise to a solution of a DDE) studied in 2004 by Baker and Parmuzin, the function is obtained by minimizing a functional S"@a^@b^,^@c(@f). Here, we use a stepsize h to introduce a discrete version of the problem, along with h-dependent discrete functionals (S@?@a@b,@ch(@f@?)) that simulate S"@a^@b^,^@c(@f). Conditions for a minimum of S@?@a@b,@ch(@f@?) are explored through an analysis of its first variation P@?@a@b,@ch(@f@?), and an iterative technique for obtaining the minimum is written down. In order to explore the properties of this iteration, it is convenient to relate it to an iterative algorithm for the solution of a discretized integral equation (a summation equation), for which the properties of the ''kernel'' can be obtained. A role for adjoint equations and fundamental solutions in the discrete case is established. The final part of the paper consists of a report of numerical experiments that demonstrate the performance of the algorithm.