APPROXIMATION OF THE ZAKAI EQUATION IN A NONLINEAR FILTERING PROBLEM WITH DELAY
K
RYSTYNATWARDOWSKA
∗, T
OMASZMARNIK
∗∗M
ONIKAPASŁAWSKA-POŁUDNIAK
∗∗∗
Faculty of Mathematics and Information Science Warsaw University of Technology Plac Politechniki 1, 00–661 Warsaw, Poland e-mail:
tward@alpha.mini.pw.edu.pl∗∗
Department of Mathematics Technical University of Rzeszów ul. W. Pola 2, 35–959 Rzeszów, Poland e-mail:
ma_poludniak@poczta.onet.plA nonlinear filtering problem with delays in the state and observation equations is considered. The unnormalized conditional probability density of the filtered diffusion process satisfies the so-called Zakai equation and solves the nonlinear filtering problem. We examine the solution of the Zakai equation using an approximation result. Our theoretical deliberations are illustrated by a numerical example.
Keywords: nonlinear filtering, stochastic differential equations with delay, Zakai’s equation
1. Introduction
We study a nonlinear filtering problem with delay using an approximation result of the Wong-Zakai type for the corresponding Zakai equation with delay. The nonlin- ear filtering problem was considered in the literature, e.g., by Bucy (1965), Kushner (1967), Zakai (1969), Liptser and Shiryayev (1977), Pardoux (1979; 1989), Kallianpur (1980), and others. Their studies concentrated mainly on finding an equation for the conditional probability density of an unobserved process given an observed path. It is known that the conditional expectation gives the best es- timate in the mean square sense. The conditional density can be computed by two methods. The first method gives the so-called Kushner equation (Kushner, 1967), which is a nonlinear stochastic partial differential equation. The second method gives the so-called Zakai equation (Bucy, 1965; Zakai, 1969), which is a linear stochastic partial differential equation for the unnormalized density. There- fore, the problem of constructing solutions of the Zakai equation is more important for practical applications be- cause of the linearity.
In recent years, the Zakai equation has been exam- ined by many authors, e.g., by Bensoussan et al. (1990) using a splitting method, by Lototsky et al. (1997) us-
ing a spectral approach, by Crisan et al. (1998) using a branching particle method, by Cohen de Lara (1998) using invariance group techniques, by Elliot and Moore (1998) in Hilbert spaces, and by Atar et al. (1999) using the Feynman-Kac formula.
In our study we apply the approximation problem of the Wong-Zakai type for stochastic partial differential equations. It was considered by Gyöngy (1989), Gyöngy and Pröhle (1990), Brze´zniak and Flandoli (1995), and Twardowska (1995). They showed that if in the Zakai equation we replace the disturbance by its good approxi- mations, then the approximations converge to a limit equa- tion with the so-called Itô correction term. The above problems were considered without delays.
The well-known result for the existence and unique- ness of a filtering problem with delays but in the lin- ear case belongs to Kolmanovsky (1973), see also (Kol- manovsky et al., 2002). The approximation result is not considered.
In this paper, the Zakai equation is a linear stochas-
tic parabolic partial differential equation with delay. It
corresponds to our nonlinear filtering problem with de-
lay. We prove the existence and uniqueness theorem for
this equation. Also, we establish the approximation result
using the correction term derived in (Twardowska, 1991;
1993; 1995) in the approximation theorems of the Wong- Zakai type.
An important part of the present paper contains a nu- merical example showing that a good stability result is achieved because in the approximation sequence of equa- tions we have added the appropriate correction term for stochastic linear differential equations with delay. Us- ing the Galerkin technique and some numerical schemes (Kloeden and Platen, 1992; Sobczyk, 1991) we transform the Zakai equation to a simpler finite-multidimensional form. We solve this equation without any correction term and with a correction term in the approximation sequence.
It is evident that the correction term has a crucial role and improves our approximation results.
In the paper by Ahmed and Radaideh (1997), a nu- merical method for the approximation of a nonlinear fil- tering problem was developed. Using the Galerkin tech- nique, the solution of Zakai’s equation was approximated by a sequence of nonstandard basis functions given by a parameterized family of Gaussian densities. We take some ideas from that paper. Other numerical techniques for the Zakai equation can be found in the papers by Beneš (1981), Elliot and Głowi´nski (1989), Florchinger and Le Gland (1995), and Itô (1996).
2. Definitions and Notation
We consider the probability space (Ω, F , F
t∈[0,∞), P ) such that it is the cannonical space of a process {(X(t), Y (t)), t ∈ [0, ∞)} ∈ R
M× R
N, where
Ω = Ω
1× Ω
2,
Ω
1= C(R
+, R
M), Ω
2= C(R
+, R
N), X(t, ω) = ω
1(t), Y (t, ω) = ω
2(t),
F
t= σ{(X(s), Y (s)), 0 ≤ s ≤ t} ∪ N, F is a σ-algebra of Borel sets on Ω ∪ N, where N is a class of subsets with the P -measure equal to zero, P is the probability law of the process (X, Y ), C(R
+, R
M) is the class of continuous functions, and C
b(R
+, R
M) de- notes the class of bounded continuous functions.
For the stochastic process X(t, ω) and for a fixed t ∈ [0, ∞) we define
X
t(θ, ω) = X(t + θ, ω), θ ∈ I = [−r, 0].
Therefore X
t(·, ω) denotes the segment of the trajectory X(·, ω) on [t − r, t].
Let {(X(t), Y (t)), t ∈ [0, ∞)} be the solution to the following system of stochastic equations with delay:
X(t, ω) = X
0(ω) + Z
t0
b(s, Y
s(·, ω), X
s(·, ω)) ds
+ Z
t0
f s, Y
s(·, ω), X
s(·, ω) dV (s)
+ Z
t0
g s, Y
s(·, ω), X
s(·, ω) dW (s), (1)
Y (t, ω) = Y
0(ω) + Z
t0
h s, Y
s(·, ω), X
s(·, ω) ds
+ W (t), (2)
where X
0(ω) is an initial constant random vari- able independent of the standard Wiener processes {(V (t), W (t)), t ∈ [0, ∞)} with values in R
M× R
N, Y
0(ω) = 0. Moreover, b, f, g and h are measurable map- pings from R
+× C(I, R
N) × C(I, R
M) with values in R
M, R
M, R
M ×Nand R
N, respectively. We assume that they satisfy Lipschitz and growth conditions (see §4 below). Then the system of equations (1)–(2) has exactly one solution. The uniqueness is understood in the sense of trajectories. We shall call X(t) the state and Y (t) the observation process.
We define
a(t, y, x) = f ◦ f
∗(t, y, x) + g ◦ g
∗(t, y, x) (3) for t ∈ R
+, y ∈ C(I, R
N) and x ∈ C(I, R
M), where f
∗and g
∗are the transpose matrices of f and g, respec- tively. Moreover,
Z(t) = exp
Z
t 0h(s, Y
s(·, ω), X
s(·, ω) dY (s, ω)
− 1 2
Z
t 0h s, Y
s(·, ω), X
s(·, ω)
2
ds (4)
for t ∈ [0, T ].
We make the following assumptions:
(A1) For t > 0, n ∈ N and for a measurable function ρ : Ω
2→ [0, 1] such that
ρ(y) = 0 if sup
0≤t≤s
| y(s) |> n,
we have E h
ρ(Y ) Z
t0
h s, Y
s(·, ω), X
s(·, ω)
2
ds i
< ∞.
(A2) E[Z(t)
−1] = 1 for each t ≥ 0.
(A3) The coefficients b, f, g and h are uniformly
bounded by a constant c.
Having Assumption (A2), we define a new probabil- ity law P
0on (Ω, F ) by
dP
0dP
Ft
= Z(t)
−1, t ≥ 0. (5) We know (Pardoux, 1989, p. 13) that for each t ≥ 0, ξ ∈ L
1(Ω, F
t, P ) we then have ξZ(t) ∈ L
1(Ω, F
t, P
0) and
E(ξ | Y
t) = E
0(ξZ(t) | Y
t) E
0(Z(t) | Y
t) ,
where Y
t= σ{Y (s) : 0 ≤ s ≤ t}, E
0being the condi- tional expectation operator under P
0.
Let M
+(R
M) denote the space of finite measures on R
M. We define the processes {ζ(t), t ≥ 0} and {Π(t), t ≥ 0} with values in M
+(R
M) by
ζ(t)(ϕ) = E
0ϕ(X(t))Z(t) | Y
t(6) and
Π(t)(ϕ) = E ϕ(X(t)) | Y
t(7)
for t ≥ 0, and ϕ ∈ C
b(R
+, R
M). The space C
b(R
+, R
M) is endowed with the topology of the uni- form convergence.
Let us remark that ζ(0) = Π(0) = law of X(0).
We introduce some families of partial differential opera- tors indexed by (t, y) ∈ R
+× Ω
2for ϕ ∈ C
b2(R
+, R
M), y ∈ C(I, R
N), x ∈ C(I, R
M):
L
(t,y)ϕ(x) = 1
2 a
ij(t, y, x) ∂
2ϕ
∂x
i∂x
j(x) + b
i(t, y, x) ∂ϕ
∂x
i(x), (8) A
j(t,y)ϕ(x) = f
lj(t, y, x) ∂ϕ
∂x
l(x), (9) B
(t,y)iϕ(x) = g
li(t, y, x) ∂ϕ
∂x
l(x) (10) and
L
i(t,y)ϕ(x) = h
i(t, y, x)ϕ(x) + B
(t,y)iϕ(x) (11) for i = 1, . . . , N and j = 1, . . . , M . We have used here the convention of repeated indices summation.
Now we are in a position to formulate the so-called Zakai equation in §3 (see Theorem 2.2.3 in (Pardoux, 1989; Chaleyat-Maurel, 1990) for the case without delay):
ζ(t)(ϕ) = ζ(0)(ϕ) + Z
t0
ζ(s) L
(s,Y )ϕ ds
+ Z
t0
ζ(s) L
i(s,Y )ϕ dY
i(s) (12)
for every ϕ ∈ C
b2(R
+, R
M) if all coefficients of Eqns. (1)–(2) are bounded.
Note that this is a stochastic linear parabolic partial differential equation because of the form of the operator L
(t,y)ϕ(x).
Let us introduce the normalized law by
µ(t)(ϕ) = E e
0ϕ(X(t))Z(1) | Y
t. (13) The corresponding equation for the densities of the con- ditional probabilities Π cf. (7) can also be established.
For the case without delay it is called the Kushner- Stratonovich equation (see, e.g., Pardoux, 1989).
3. Zakai Equation
Theorem 1. Let all coefficients in (1)–(2) be bounded.
Then for every ϕ ∈ C
b2(R
+, R
M) the solution of (1)–(2) satisfies the Zakai equation (12).
Proof. From (1) and (2) we have
dW (t) = dY (t) − h t, Y
t(·), X
t(·)dt.
From this we obtain the following relation:
Z
t 0g s, Y
s(·, ω), X
s(·, ω) dW (s)
= Z
t0
g s, Y
s(·, ω), X
s(·, ω) dY (s)
− Z
t0
g
s, Y
s(·, ω), X
s(·, ω)
× h s, Y
s(·, ω), X
s(·, ω)
ds. (14) Using (14) we get
X(t) = X
0+ Z
t0
h
b s, Y
s(·, ω), X
s(·, ω)
− g s, Y
s(·, ω), X
s(·, ω)
× h s, Y
s(·, ω), X
s(·, ω) i ds
+ Z
t0
f s, Y
s(·, ω), X
s(·, ω) dV (s)
+ Z
t0
g s, Y
s(·, ω), X
s(·, ω) dY (s). (15)
Using the Itô formula for the multidimensional case (see Liptser and Shiryayev, 1977), we obtain
dϕ(X(t))
= h ϕ
0xb t, Y
t(·), X
t(·) − g t, Y
t(·, ω), X
t(·, ω)
× h t, Y
t(·, ω), X
t(·, ω)
+ 1 2 ϕ
00xxf ◦ f
∗t, Y
t(·), X
t(·) + g ◦ g
∗t, Y
t(·), X
t(·)
Big] dt + ϕ
0xf t, Y
t(·), X
t(·) dV (t) + ϕ
0xg t, Y
t(·), X
t(·) dY (t)
= L
(t,Yt)ϕ X(t) dt − h
it, Y
t(·, ω), X
t(·, ω)
× B
(t,Yit)
ϕ X(t) dt + A
l(t,Yt)ϕ X(t) dV
l(t) + B
(t,Yit)
ϕ X(t) dY
i(t). (16) Writing the above equation in an integral form we have
ϕ(X(t)) = ϕ(X
0) + Z
t0
L
(s,Ys)ϕ X(s) ds
− Z
t0
h
is, Y
s(·), X
s(·)B
(s,Yi s)ϕ X(s) dt
+ Z
t0
A
l(s,Ys)
ϕ X(s) dV
l(s) +
Z
t 0B
i(s,Ys)
ϕ X(s) dY
i(s).
From the Girsanov theorem (see Liptser and Shiryayev, 1977), we have
Z(t) = 1 + Z
t0
Z(s)h
is, Y
s(·), X
s(·) dY
i(s).
Using once more the Itô formula for the multidimensional case for f (t, x
1, x
2) = x
1· x
2, we get
Z(t)ϕ(X(t)) = ϕ(X
0) + Z
t0
Z(s)L
(s,Ys)ϕ X(s) ds
+ Z
t0
Z(s)A
l(s,Ys)
ϕ X(s) dV
l(s) +
Z
t 0Z(s)L
i(s,Ys)
ϕ X(s) dY
i(s).
Taking the expected value E
0(· | Y) of both the sides and using Lemma 2.2.4 from (Pardoux, 1989), we have
E
0Z
t 0U (s) dY
i(s) | Y
= Z
t0
E
0U (s) | Y dY
i(s)
and
E
0Z
t 0U (s) dY
j(s) | Y
= 0
for t ≥ 0, i = 1, . . . , N , j = 1, . . . , M and for a pro- gressively measurable process {U (t), t ≥ 0}. From the definition of ζ(t)(ϕ) we get
ζ(t)(ϕ) = ζ(0)(ϕ) + Z
t0
ζ(s)(L
(s,Y )ϕ) ds
+ Z
t0
ζ(s)(L
i(s,Y )ϕ) dY
i(s).
The existence and uniqueness of the solution of (12) follows, e.g., from the classical result of (Pardoux, 1979;
Bensoussan et al., 1990).
4. Approximation Results of the Wong-Zakai Type
We recall that for our numerical computations we shall need the approximation result of the Wong-Zakai type (Wong and Zakai, 1965) of our filtering problem when the noise in our Zakai equation is replaced by its polygonal approximations. In practice we obtain the “real observa- tions” as a result of measurements of the process Y (t).
But then, instead of the observations {Y (t) : s ≤ t}, we obtain the paths {Y
n(t) : s ≤ t}, where the processes Y
n(t) have bounded variations and they are approxima- tions of Y (t). Using real Y
n(t) instead of Y (t), we solve the approximate equations with the operator (11), i.e., we solve the equations
ζ
n(t)(ϕ) = ζ
n(0)(ϕ) + Z
t0
ζ
n(s)(L
(s,Yn)ϕ) ds
+ Z
t0
ζ
n(s)(L
i(s,Yn)
ϕ) dY
ni(s). (17) So we obtain ζ
n(t)(ϕ) as the solutions and, consequently, we obtain the densities p
n(t)(ϕ) = dζ
n(t)(ϕ)/dx.
In our theorem we shall show that if W
n(t) → W (t) and so Y
n(t) → Y (t), in a certain sense, as n → ∞, then also ζ
n(t)(ϕ) → ζ(t)(ϕ) in an appro- priate sense.
We shall further see that applying the Galerkin tech- nique we shall obtain from (12) a finite multidimensional system of stochastic ordinary differential equations with delay (Ahmed and Radaideh, 1997).
So now we start from the investigation of a stochastic
ordinary differential equation with delay (in a more gen-
eral form, i.e., the stochastic functional differential equa-
tion when the delay is not constant with respect to time).
Let us restrict our deliberations to t ∈ [0, T ].
For J = (−∞, 0] we introduce some metric spaces C
−= C(J, R
d), C
1= C((−∞, T ], R
d) and C
20= C((−∞, T ], R
m) = e Ω of continuous functions. The space C
−is endowed with the metric
(f, g)
C−=
∞
X
n=1
2
−nkf − gk
n1 + kf − gk
nfor f, g ∈ C
−, khk
n= max
−n≤t≤0h(t).
For further consideration we also set I = [−r, 0], 0 < r < ∞, and we introduce the norm spaces C
−= C(I, R
d), C
1= C([−r, T ], R
d) and C
20= C([−r, T ], R
m) = e Ω of continuous functions with the usual norms of the uniform convergence.
Here d is the dimension of the state space and m is the dimension of the Wiener process; in the space C
20all functions are equal to zero at zero.
Below we denote by X one of the above spaces. Let F(X ) denote the Borel σ -algebra of the space X . It is obvious that C
20is identical with the σ -algebra generated by the family of all Borel cylinder sets in X (see Ikeda and Watanabe, 1991). So we construct the Wiener space (C
20, B(C
20), P
w), where P
wis a Wiener measure. The coordinate process B(t, w) = w(t), w ∈ C
20, is an m- dimensional Wiener process.
The smallest Borel algebra that contains B
1, B
2, . . . is denoted by B
1∨B
2∨. . . ; B
u,v(X) denotes the small- est Borel σ−algebra for which a given stochastic process X(t) is measurable for every t ∈ [u, v], and B
u,v(dB) denotes the smallest Borel algebra for which B(s)−B(t) is measurable for every (t, s) with u ≤ t ≤ s ≤ v.
Let B
n(t, w) = w
n(t) be the following piecewise linear approximation of B(t, w) = w(t):
B
n,p(t, w) = w
pk 2
n+ 2
nt − k
2
n×
w
pk + 1 2
n− w
pk 2
n(18)
for each p = 1, . . . , m and kT /2
n≤ t < (k + 1)T /2
nfor k = 0, 1, . . . , 2
n− 1.
Now we consider e Ω = C
20. Let X be a contin- uous stochastic process X(t, w): [−r, T ] × Ω → R
d, i.e., X: e Ω → X =C
1. We take some fixed initial con- stant stochastic processes for θ ∈ J for i = 1, . . . , d:
X
i(0 + θ, w) = X
0i(w) = X
0n,i(w) = Y
0i(w).
We also consider operators b : C
−→ R
d, σ : C
−→ L(R
m, R
d) (where L(R
m, R
d) is the Banach space of linear functions from R
mto R
dwith the uni- form operator norm | · |
L).
In order to give a meaning to the stochastic integrals in (19) below, we introduce the following condition:
(A4) for every t ∈ (−∞, T ] the algebra B
−∞,t(X) ∨ B
−∞,t(dB) is independent of B
t,T(dB).
We consider the following stochastic functional dif- ferential equation:
X
i(t, w) = X
0i+ Z
t0
b
iX
s(·, w) ds
+
m
X
p=1
Z
t 0σ
ipX
s(·, w) dw
p(s) (19)
for i = 1, . . . , d.
Replacing the Wiener process by B
n, we obtain the following approximations of (19):
X
n,i(t, w) = X
0n,i+ Z
t0
b
iX
sn(·, w) ds
+
m
X
p=1
Z
t 0σ
ipX
sn(·, w) B ˙
n,p(s, w) ds. (20)
We also introduce another stochastic differential equation:
Y
i(t, w)
= Y
0i(w) + Z
t0
b
iY
s(·, w) ds
+
m
X
p=1
Z
t 0σ
ipY
s(·, w) dw
p(s) (21)
+ 1 2
m
X
p=1 d
X
j=1
Z
t 0D e
jσ
ipY
s(·, w)σ
jpY
s(·, w)ds for every i = 1, . . . , d, where the last term on the right- hand side of (21) is the so-called correction term that is described as follows (Twardowska, 1991; 1993):
Let Dσ
ipdenote the Fréchet derivative from C
−to L(C
−, R) (the necessary assumptions are given below).
From the Riesz theorem it follows that there exists a fam- ily of measures µ = µ
ipjgof bounded variation such that
Dσ
ip(g)(Φ) =
d
X
j=1
Z
0−r
Φ
j(v)µ
ipjg(dv)
is a directional derivative for any Φ, g ∈ C
−. The mea- sure µ has the following decomposition:
µ(A) = µ(A ∩ (−∞, 0)) + µ(A ∩ {0})
= µ(A) + µ({0})δ e
0(A),
where δ
0is the Dirac measure, A ∈ B((−∞, 0)). We denote by e D
jσ
ip(g) the value µ
ipjg({0}), i.e.,
D e
jσ
ipξ
s(·) = µ
ipjg{0}. (22) The second integral in (21) is the Itô integral.
Let us introduce the following conditions:
(A5) The initial stochastic process X
0is F
0- measurable and P (|X
0(w)| < ∞) = 1, where
|X
0(w)| = P
dj=1
|X
0i(w)|, and B
−∞,0(X
0) is indepen- dent of B
0,T(B);
(A6) For any ϕ, ψ ∈ C
−the following Lipschitz condition is satisfied:
b(ϕ) − b(ψ)
2
+
σ(ϕ) − σ(ψ)
2 L
≤ L
1Z
0−∞
ϕ(θ) − ψ(θ)
2
dK(θ)
+L
2ϕ(0) − ψ(0)
2
,
where K(θ) is a certain bounded measure on J, and L
1, L
2are some constants;
(A7) For every ϕ, ψ ∈ C
−the following growth condition is satisfied:
b(ϕ)
2
+ σ(ϕ)
2 L
≤ L
1Z
0−∞
1 + ϕ
2(θ) dK(θ)
+L
21 + ϕ
2(0), where ϕ
2(0) = P
dj=1
ϕ
2i(0);
(A8) We have P Z
T0
b(X
s)
ds < ∞
= 1,
P Z
T 0σ(X
s)
2
L
ds < ∞
= 1;
(A9) Let b
i, σ
ipbe bounded functions and b
i, σ
ip∈ C
1, for all i = 1, . . . , d, p = 1, . . . , m.
We say that a d−dimensional continuous stochastic process X : (−∞, T ] × C
20→ R
dis a strong solution of (19) for a given process w(t) if Conditions (A4), (A5) and (A8) are satisfied and (19) is valid with probability 1 for all t ∈ (−∞, T ]. The uniqueness of strong solutions is understood in the sense of the trajectories:
An absolutely continuous stochastic process X
n: (−∞, T ] × C
20→ R
dis a solution of (20) if Conditions (A4) and (A5) are satisfied and (20) is valid with proba- bility 1 for all t ∈ (−∞, T ].
Notice that our conditions ensure the existence and uniqueness of the strong solution Y of (21) since
D e
jσ
ip(Y
t(·, w)) is a real number (it is a value of a mea- sure). Moreover, for every n ∈ N, there exists exactly one solution of the ordinary differential equation (20).
We have the following approximation theorem of the Wong-Zakai type for stochastic functional differential equations (Twardowska, 1991; 1993):
Theorem 2. Let Conditions (A4)–(A7) be satisfied. Let B
n(t, w) be an approximation of the type (18) of a Wiener process. We assume that X
nand Y are solutions of (20) and (21), respectively, with a constant initial stochastic process. Then Conditions (A4) and (A8) are satisfied and for every ε > 0 we have
n→∞
lim P h sup
0≤t≤T
X
n(t, ω) − Y (t, ω)
H> ε i
= 0. (23) Remark 1. The proof in (Twardowska, 1991; 1993) is given for the interval J = (−∞, 0]. Instead of J = (−∞, 0], we can consider I = [−r, 0], r > 0. Then, instead of considering X
i(t
ni+ s) − X
i(t
ni−1+ s) on the whole interval of the definition of time, we divide it into some parts (see Twardowska, 1993) and we estimate each part separately by expressions converging to zero.
For example, consider the initial equation dX(t) = b(X
t) dt + σ(X
t) dw(t),
X
0(θ, ω) = η(ω) for θ ∈ J, (24) where for some constants b
0, b
1, σ
0, σ
1we define b, σ : C
−→ R as follows:
b(ϕ) = b
0ϕ(0) + b
1ϕ(−r), σ(ϕ) = σ
0ϕ(0) + σ
1ϕ(−r).
We note that ϕ(0) = X
t(0) = X(t), ϕ(−r) = X
t(−r) = X(t − r) and
dX(t) = b
0X(t) + b
1X(t − r) dt
+ σ
0X(t) + σ
1X(t − r) dw(t), (25) X
0= η.
Then the limit equation (21) takes on the form dY (t) = b
0Y (t) + b
1Y (t − r) dt
σ
0Y (t) + σ
1Y (t − r) dw(t) (26) + 1
2 σ
0σ
0Y (t) + σ
1Y (t − r) dt, Y
0= η
because σ
0X(t) is the only term for which the support of
the measure contains zero. Therefore µ({0}) = σ
0.
Now we shall come back to our Zakai stochastic lin- ear parabolic partial differential equation (11). We have the following approximation theorem of the Wong-Zakai type (Twardowska and Pasławska-Południak, 2003).
Theorem 3. Let Conditions (A4)–(A7) be satisfied. Let B
n(t, w) be an approximation of the type (18) of a Wiener process. We assume that ζ and ζ
nare solutions of (12) and (17), respectively, with a constant initial stochastic process, and also
ζ(t)(ϕ) = e e ζ(0)(ϕ) + Z
t0
ζ(s)(L e
(s,Yn)ϕ) ds
+ Z
t0
ζ(s)(L e
i(s,Yn)
ϕ) dY
i(s) + 1
2 Z
t0
ζ(s)( e e DL
i(s,Yn)
ϕ)(L
i(s,Yn)
ϕ) ds, (27) where the last term is the so-called correction term of the form (22). Then for every t ≥ 0 we have
n→∞
lim E
ζ
n(t, ω)(ϕ) − e ζ(t, ω)(ϕ)
2
= 0. (28)
Proof. For a proof of the Wong-Zakai type theorem for stochastic partial differential equations in Hilbert spaces, without delay, see (Twardowska, 1995). The convergence is of the type (28). The case of the nonlinear filter- ing equation (12) without delay is covered by the theo- rem which we can be found in the paper (Pardoux, 1975, pp. 130–131). Now the technique of proving the Wong- Zakai theorem with delay can be copied from (Twar- dowska, 1991; 1993). We get the convergence of the type lim
n→∞E(sup
t|ζ
n(t, ω)(ϕ) − e ζ(t, ω)(ϕ)|
2) = 0 but the convergence in (28) is weaker, so we prove (28) in our the- orem.
5. Approximation Result for the Zakai Equation
From the numerical point of view, it is convenient to con- sider the Zakai equation (12) in the Stratonovich form (Dawidowicz and Twardowska, 1995), i.e., subtracting the correction term appearing in (27). Then, after the Wong- Zakai approximation, we will obtain a limit equation with- out a correction term.
First, to obtain a system of stochastic ordinary dif- ferential equations from our Zakai equation, we apply the Galerkin method. We follow the idea of Ahmed and Radaideh (1997, §3.3). Therefore, using the Galerkin method based on the Fourier coefficients {ψ
iN} and pro- jecting the Zakai equation onto the space spanned by {w
i, 1 ≤ i ≤ N } (see Ahmed and Radaideh, 1997, §3.2,
Eqn. (8)) we can approximate the solution of (12) in the form
ζ
N(t, x) =
N
X
i=1
ζ
N(t)w
i(t)
and then we obtain a system of stochastic ordinary dif- ferential equations in a matrix form. In our case it is a system of linear stochastic ordinary differential equations with delay, so we can use the theory from §4.
6. Numerical Experiments
We start with the following filtering problem:
dX(t) = b
0X
2(t) + b
1X
2(t − 1) dt
+ σ
0X(t) + σ
1X
2(t − 1) dW (t), (29a) dY (t) = a
0X(t) + a
1X
2(t − 1) dt + dW (t), (29b) where a
0, a
1b
0, b
1, σ
0and σ
1are some constants, X(t) ∈ R, Y (t) ∈ R and W (t) is the one-dimensional Wiener process. We transform this problem to the fol- lowing stochastic partial differential equation of the Zakai type (12):
ϕ
t= h 1
2 σ
02X
2(t) + σ
0σ
1X(t)X
2(t − 1) + 1
2 σ
12X
4(t − 1) i ϕ
00xx+ b
0X
2(t) + b
1X
2(t − 1)ϕ
0x+ a
20X
2(t) + 2a
0a
1X(t)X
2(t − 1) + a
21X
4(t − 1)ϕ
+ a
0X(t) + a
1X
2(t − 1) dW (t) (30) and the correction term is of the form (cf. (22))
1
2 a
0a
0X(t) + a
1X
2(t − 1) dt.
After discretization (see §5 and Ahmed and Radaideh, 1997), we can restrict our analysis to the following stochastic ordinary differential equation with delay on the interval [0, 1]:
dX(t) = aX(t) + bX
2(t) + c dt
+ a
0X(t) + a
1dW (t), (31)
X
0(θ) = X(0 + θ) = 1 for θ ∈ [−1, 0],
X(t − 1) = 1 on [0, 1] as t − 1 ∈ [−1, 0],
where
a = σ
0σ
1+ 2a
0a
1, b = 1
2 σ
02+ b
0+ a
0, c = 1
2 σ
12+ b
1+ a
21.
We solve this equation with the following numerical meth- ods: Euler, Milshtein and Runge-Kutta schemes (Kloe- den and Platen, 1992; Sobczyk, 1991). But for our case of stochastic differential equations with delay, we mod- ify the Milshtein scheme. It is well known that the Mil- shtein scheme can be obtained as the Euler scheme for the Stratonovich version of (31) using the relation for the tran- sition between the Itô and Stratonovich integrals (Dawid- owicz and Twardowska, 1995).
Below we present some numerical computations to confirm our theoretical result that the correction term plays a crucial role in numerical schemes, too.
Consider (31) with a
0, a
1, b
0, b
1, σ
0and σ
1given by
a
0= 1, a
1= 1
2 , b
0= −2, b
1= 1 2 , σ
0= √
2, σ
1= −
√ 2 4 .
Then b =
12σ
20+ b
0+ a
0= 0. Equation (31) without the correction term has the following form:
dX(t) = 1
2 X(t) + 13 16
dt
+ (X(t) + 1
2 ) dW (t). (32) Equation (31) with the correction term is
dX(t) = 9
16 dt + X(t) + 1
2 dW (t). (33) First, we obtain an exact analytical formula for t ∈ [0, 1] in the so-called step method (see §4). We use the form of the solution derived for the linear equation (4.9), pp. 119-120 in the book by Kloeden and Platen (1992), i.e., for Eqn. (31) with b = 0. We have
X(t) = Φ(t) h
X(0) + (c − a
0a
1) Z
t0
Φ(s)
−1ds
+ a
1Z
t0
Φ(s)
−1dW (s) i with the fundamental solution
Φ(t) = exp
(a − 1
2 a
20)t + a
0W (t)
.
In our case
Φ(t) = exp W (t)
and X(0) = 1.
So we obtain the following solution to (31) for t ∈ [0, 1]:
X(t) = exp W (t) 1 + 5
16 Z
t0
exp − W (s) ds
+ 1 2
Z
t 0exp − W (s) ds
. (34)
We recall that in the step method we set X(t − 1) = 1 for t ∈ [0, 1], so (t − 1) ∈ [−1, 0]. We have also used the following formula (Kloeden and Platen, 1992, p. 101):
Z
t 0exp − W (s) dW (s)
= U W (t) − U W (0) − 1 2
Z
t 0h
0(W (s)) ds,
where
h(x) = exp(−x), U
0(x) = h(x).
This solution is used to test and compare numerical meth- ods in this paper. We solve the stochastic differential equation numerically by the simulation of the approxima- tion of discrete trajectories in time. To construct a solution for a given discretization t
0= 0 < t
1< · · · < t
N= T we used the Euler and Milshtein methods. We modified the recursive formulae for the Milshtein method taking into consideration the delayed argument.
The Euler approximation for (29) is generated recur- sively by
Y
n+1= Y
n+ (b
0Y
n+ b
1Y
n−k)∆
n+ (σ
0Y
n+ σ
1Y
n−k)∆W
n(35) for n = k + 1, k + 2, . . . , N − 1 with initial values Y
0= Y
1= · · · = Y
k= 1 and ∆
n= T /N (equidistant step size), k = 1/∆
n(an integer parameter related to the delay), ∆W
n= W
tn+1− W
tn.
The random variables ∆W
nare independently N (0, 1)-normally distributed random variables. We have generated such random variables in simulations from in- dependent and uniformly distributed random variables on [0,1] which are provided by a pseudorandom number gen- erator on a computer. The generation of the sample paths of the process W (t) may be realized by W (0) = 0, W (t) = √
∆
n(ξ
1+ · · · + ξ
t∆n