Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9509461 | Journal of Computational and Applied Mathematics | 2005 | 22 Pages |
Abstract
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αβ,γ(Ï). Here, we use a stepsize h to introduce a discrete version of the problem, along with h-dependent discrete functionals (SËαβ,γh(ÏË)) that simulate Sαβ,γ(Ï). Conditions for a minimum of SËαβ,γh(ÏË) are explored through an analysis of its first variation PËαβ,γh(ÏË), 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 rôle 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
C.T.H. Baker, E.I. Parmuzin,