
252 Chapter 7 Evolutionary inverse problems
Theorem 7.5 Let self-adjoint, time-independent and positively defined operators S
and A be mutually permutable operators. Then, the solution of the variational problem
(7.38)–(7.41) satisfies the equation
du
α
dt
− Au
α
= 0, 0 < t ≤ 2T (7.51)
and the non-local conditions (7.50).
Equations (7.50) and (7.51) are the Euler equations for the variational problem
(7.38)–(7.41). The established relation between the non-local problem and the op-
timal control problem is a very useful relation of utmost significance. This statement
can be supported by a line of reasoning similar to that used for the Euler equations in
classical variational problems.
In the above consideration of ill-posed evolutionary problems of type (7.6), (7.7)
we showed the equivalence of the two different approaches to finding the approximate
solution. The methods based, first, on non-local perturbation of initial conditions and,
second, on using the extremum formulation of the problem give rise to the same reg-
ularizing algorithms. A fundamental difference between the two approaches consists
only in the manner in which the approximate solution is obtained, i. e., in the compu-
tational realization.
7.1.6 Non-local difference problems
Let us show that, under certain conditions, statements analogous to Theorems 7.1 and
7.5 are valid for the difference analogues of the non-local problem (7.14), (7.15). Here,
we restrict ourselves to the consideration of time approximations. We routinely ap-
proximate the operator A with a difference operator, self-adjoint and positive in the
corresponding mesh space. We introduce a uniform grid over the variable t,
¯ω
τ
= ω
τ
∪{T }={t
n
= nτ, n = 0, 1,...,N
0
,τN
0
= T },
with a step size τ>0. As usually, we denote the approximate solution of the non-
local problem (7.14), (7.15) at t = t
n
as y
n
. To find this solution, we use the simplest
explicit scheme, often more preferable than implicit schemes for unstable problems.
From (7.14) and (7.15), we obtain:
y
n+1
− y
n
τ
− Ay
n
= 0, n = 0, 1,...,N
0
− 1, (7.52)
y
0
+ αy
N
0
= u
0
. (7.53)
For the solution of the difference equation (7.52), we have the following representa-
tion:
y
n
=
∞
k=1
(1 + τλ
k
)
n
(y
0
,w
k
)w
k
, n = 0, 1,...,N
0
. (7.54)