• Aucun résultat trouvé

Geometrization of Monte-Carlo numerical analysis of an elliptic operator: strong approximation

N/A
N/A
Protected

Academic year: 2021

Partager "Geometrization of Monte-Carlo numerical analysis of an elliptic operator: strong approximation"

Copied!
6
0
0

Texte intégral

(1)

Probability Theory

Geometrization of Monte-Carlo numerical analysis of an elliptic operator: strong approximation

Ana Bela Cruzeiro

a

, Paul Malliavin

b

, Anton Thalmaier

c

aGrupo de Física-Matemática UL and Dep. Matemática IST, Av. Rovisco Pais, 1049-001 Lisboa, Portugal b10, rue Saint Louis en l’Isle, 75004 Paris, France

cDépartement de mathématiques, Université de Poitiers, téléport 2, BP 30179, 86962 Futuroscope Chasseneuil, France Received 16 December 2003; accepted 12 January 2004

Presented by Paul Malliavin

Abstract

A one-step scheme is constructed, which, as the Milstein scheme, has the strong approximation property of order 1; in contrast to the Milstein scheme, our scheme does not involve the simulation of iterated Itô integrals of second order. To cite this article:

A.B. Cruzeiro et al., C. R. Acad. Sci. Paris, Ser. I 338 (2004).

2004 Published by Elsevier SAS on behalf of Académie des sciences.

Résumé

Monte-Carlo géométrique pour un opérateur elliptique : approximation numérique forte. On propose un schéma à un pas, qui, comme le schéma de Milstein, possède la propriété d’approximation forte à l’ordre 1 ; contrairement au schéma de Milstein, notre schéma ne nécessite pas la simulation d’intégrales itérées de Itô du second degré. Pour citer cet article : A.B. Cruzeiro et al., C. R. Acad. Sci. Paris, Ser. I 338 (2004).

2004 Published by Elsevier SAS on behalf of Académie des sciences.

1. Introduction

Numerical integration of SDE consists, an SDE being fixed, in producing a discretization scheme leading to a pathwise approximation of its solution. In this work we discuss the related problem of how to establish a Monte-Carlo simulation to a given real strictly elliptic second order operatorL, which leads to good numerical approximations of the fundamental solution to the corresponding heat operator.

Of course many SDE can be associated toL, each choice corresponding to a parametrization by the Wiener space of the Stroock–Varadhan solution of the martingale problem associated toL. For applications to finance all these parametrizations are equivalent. We shall prove that there exists an optimal parametrization for which the one-step Milstein scheme does not involve the computation of iterated stochastic integrals of second order. For our

E-mail addresses: abcruz@math.ist.utl.pt (A.B. Cruzeiro), sli@ccr.jussieu.fr (P. Malliavin), thalmaier@math.univ-poitiers.fr (A. Thalmaier).

1631-073X/$ – see front matter 2004 Published by Elsevier SAS on behalf of Académie des sciences.

doi:10.1016/j.crma.2004.01.007

(2)

search of an optimal parametrization we have to describe the possible parametrizations of the diffusion associated toL; it is sufficient to solve this problem for the Euclidean Laplacian onRd; in this case it is equivalent to replace the standard Brownian motionWonRdby an orthogonal transformWwith an Itô differential of the type

dWk= d

j=1

W(t)k

jdWj(t), (1)

wheretW(t)is an adapted process taking values in the group O(d)of orthogonal matrices. We denote by O(W) the family of all such orthogonal transforms which is isomorphic toP(O(d)), the path space on O(d).

Pointwise multiplication defines a group structure onP(O(d))O(W).

Given onRdthe data ofd+1 smooth vector fieldsA0, A1, . . . , Ad, we consider the Itô SDE dξW(t)=A0

ξW(t) dt+

d

k=1

Ak

ξW(t)

dWk(t), ξW(0)=ξ0. (2)

Throughout this Note we assume ellipticity, that is, for anyξ ∈Rd the vectors A1(ξ ), . . . , Ad(ξ ) constitute a basis ofRd; the components of a vector fieldU in this basis are denotedU, Akξ which gives the decomposition U (ξ )=d

k=1U, AkξAk(ξ ). By change of parametrization we mean the substitution ofWbyW in (2); we then get an Itô process inW. This change of parametrization does not change the infinitesimal generator associated to (2) which has the formL=12

k,α,βAαkAβkDαDβ+

αAα0DαwhereDα=∂/∂ξα. The group O(W)operates on the set of elliptic SDE onRdand the orbits of this action are classified by the corresponding elliptic operatorsL.

2. Definition of the schemeS

Denote bytε:=ε×integer part oft/ε; we define our scheme by ZWε(t)ZWε(tε)=A0

ZWε(tε)

(ttε)+

k

Ak

ZWε(tε)

Wk(t)Wk(tε)

+1 2

k,s

(∂AkAs)

ZWε(tε)

Wk(t)Wk(tε)

Ws(t)Ws(tε)

εηks +1

2

k,s,i

Ai

ZWε(tε)

[As, Ai], Ak

ZW ε(tε)

Wk(t)Wk(tε)

Ws(t)Ws(tε)

εηks , (3) whereW is standard Brownian motion onRd, and ηsk the Kronecker symbol defined by ηks =1 if k=s and zero otherwise. Denote byP(Rd)the path space onRd, that is the Banach space of continuous maps from[0, T] intoRd, endowed with the sup norm:p1p2=supt∈[0,T]|p1(t)p2(t)|Rd. Fixingξ0∈Rd, letPξ0(Rd)be the subspace of paths starting fromξ0. Given Borel measuresρ1, ρ2onP(Rd), denote by M(ρ1, ρ2)the set of measurable mapsΨ:P(Rd)→P(Rd)such thatΨρ1=ρ2; the Monge transport norm (see [8,5]) is defined as

dM1, ρ2):=

inf

Ψ∈M(ρ12)

Ψ (p)2ρ1(dp) 1/2

.

Theorem 2.1. Assume ellipticity and assume the vector fieldsAk along with their first three derivatives to be bounded; fixξ0∈Rd and let ρL be the measure on Pξ0(Rd) defined by the solution of the Stroock–Varadhan martingale problem [7] for the elliptic operatorL; letρS be the measure obtained by the schemeSwith initial valueZWε(0)=ξ0. Then

lim sup

ε→0

1

εdML, ρS)=c <. (4)

(3)

Remark. The proof of Theorem 2.1 will provide an explicit transport functionalΨ0which puts the statement in a constructive setting; the constantcis effective.

3. The Milstein scheme

The Milstein scheme for SDE (2) (cf., for instance, [6], formula(0.23)or [2], p. 345; see also [3]) is based on the following stochastic Taylor expansion ofAk along the diffusion trajectory: AkW(t))=AkW(tε))+

j(∂AjAk)(ξW(tε))(Wj(t)Wj(tε))+O(ε), which leads to ξWε(t)ξWε(tε)=

k

Ak

ξWε(tε)

Wk(t)Wk(tε)

+(ttε)A0

ξWε(tε)

+

i,k

(∂AiAk)

ξWε(tε)t

tε

Wi(s)Wi(tε)

dWk(s); the computation oft

tε(Wi(s)Wi(tε))dWk(s)gives the Milstein scheme ξWε(t)ξWε(tε)=

k

Ak

ξWε(tε)

Wk(t)Wk(tε)

+(ttε)A0

ξWε(tε) +1

2

i,k

(∂AiAk)

ξWε(tε)

Wi(t)Wi(tε)

Wk(t)Wk(tε)

εηki +R, whereR=

i<k[Ai, Ak]Wε(tε))t

tε(Wi(s)Wi(tε))dWk(s)(Wk(s)Wk(tε))dWi(s).

It is well known that the Milstein scheme has the following strong approximation property:

E sup

t∈[0,1]

ξW(t)ξWε(t)2

=O ε2

. (5)

The numerical difficulty related to the Milstein scheme is how to achieve a fast simulation ofR. The purpose of this work is to show that by a change of parametrization this simulation can be avoided.

4. Horizontal parametrization

Givendindependent vector fieldsA1, . . . , AdonRd, we take the vectorsA1(ξ ), . . . , Ad(ξ )as basis at the point ξ; the functionsβk,si , called structural functions, are defined (see [1]) by:

βk, i (ξ )=

[Ak, A ], Ai

ξ, [Ak, A ](ξ )=

i

βk, i (ξ )Ai(ξ ).

The structural functions are antisymmetric with respect to the two lower indices. Consider the connection functions, defined from the structural functions by

Γk,si =1 2

βk,siβs,ik +βi,ks

. (6)

LetΓkbe thed×d matrix obtained by fixing the indexkin the three indices functionsΓk,. Then, by means of the antisymmetry ofβ,in the two lower indices,Γkis an antisymmetric matrix:

2

Γk,si +Γk,is

=βk,siβs,ik +βi,ks +βk,isβi,sk +βs,ki =0.

The matrixΓkoperates on the coordinate vectors of the basisAs(ξ )viaΓk(As)=

iΓk,si Ai. This givesΓk(As)Γs(Ak)= [Ak, As]: theith component of the l.h.s. is 12k,siβs,ik +βi,ksβs,ki +βk,isβi,sk )=βk,si . LetM= Rd×EdwhereEdis the vector space ofd×dmatrices. Define onMvector fieldsA˜k, k=1, . . . , d, as follows:

(4)

A˜k(ξ, e)=

ekA (ξ ),Nk(ξ, e)

, [Nk]sr(ξ, e)= −

,

ekerΓ , s (ξ ), ξ ∈Rd, e∈Ed. (7)

Denoting for a vectorZonMbyZH its projection onRd, we have:

Proposition 4.1. The vector fieldsA˜ksatisfy the relation[ ˜Ak,A˜s]H=0.

Proof. The horizontal component[A˜

kA˜s]His given by [A˜

kA˜s]H=

i

A˜ikiA˜Hs +

q

α,β

[Nk]αβ∂(αβ)eqs

Aq

=

i

ekAi

esiA

α,β

,

ekeβΓ , α

q

ηαqηsβAq

=

i

ekAi

esiA

α, ,

ekesΓ , α Aα,

using the fact that∂(αβ)esq=ηqαηβs. We finally get[A˜

kA˜s]H=

, ekes[A A

αΓ , αAα]. Therefore the horizontal component of the commutator is

[ ˜Ak,A˜s]H=

,

ekes[A , A] −

α, ,

ekes

Γ , α Γα, Aα

which vanishes sinceΓ (A )Γ(A )= [A , A]. ✷

Denote byeTthe transposed of the matrixeand letA˜0(ξ, e)=(A0(ξ ),12eJ ),J :=d

k=1NkTNk. Consider the following Itô SDE on the vector spaceM:

dmW=

k

A˜k(mW)dWk+ ˜A0(mW)dt, mW(0)=0,Id). (8)

Proposition 4.2. DenotemW(t)=(˜ξW(t), eW(t)), theneW(t)is an orthogonal matrix fort0, and ˜W(t)

t

0

(Lf )ξ˜W(s)

dsis a local martingale, for anyfC2 Rd

. (9)

Proof. We compute the stochastic differential ofeTe:

d eTe

=

k

d ekek

= −

m,k,p

u

ekepmeukΓp,u +

v

ekempevkΓp,v

dWm +

k

ek(A˜0)k+ek(A˜0)k+

m,p,q,p,q

epmepkΓp,p eqmeqkΓq,q

dt,

where the last term of the drift comes from the Itô contraction

k dek∗ dek=

k[NkTNk] dt=J dt. The first two terms of the drift are computed by using the definition ofA˜0:

k[ek(A˜0)k+ek(A˜0)k] = −12[(eTeJ ) + (eTeJ ) ]. WriteeTe=Id+σ, then the drift takes the form−(σ J+J σ )/2. We compute the coefficient of dWm:

(5)

k,p

u

ekempeukΓp,u +

v

ekepmekvΓp,v

= −

p

epm

u

eTeu

Γp,u +

v

eTev

Γp,v

.

Using the antisymmetryΓp, = −Γp, we obtain dσ = −

m

dWm

p

epm

u

σuΓp,u +

v

σvΓp,v

−1

2[σ J+J σ] dt. (10)

Eq. (10), together with Eq. (8), gives an SDE with local Lipschitz coefficients for the triple(˜ξ , e, σ ); by uniqueness of the solution, asσ (0)=0, we deduceσ (t)=0 for allt0. ✷

In terms of the newRd-valued Brownian motionWdefined by dWk(t):=

[eW(t)]kdW , we have dξ˜W=

k

Akξ˜W(t)

dWk(t)+A0ξ˜W(t)

dt. (11)

5. Reconstruction of the schemeS

We want to prove that our schemeS is essentially the projection of the Milstein scheme (˜ξWε, eWε)for the solution mW =(˜ξW, eW) of the SDE (8). In order to write the first componentξ˜Wε we have to compute the horizontal part ofA˜

kA˜j, which has been done in the proof to Proposition 4.1: we get ξ˜Wε(t)− ˜ξWε(tε)

=A0

ξ˜Wε(tε)

(ttε)+

k,

eWε(tε)

kA ξ˜Wε(tε) -(Wk)

+1 2

k,j

,

eWε(tε)

k

eWε(tε)

j

A A

i

Γ , i Aiξ˜Wε(tε)

-(Wk)-(Wj)εηjk ,

where-(Wk)=Wk(t)Wk(tε). By (5) E

sup

t∈[0,1]

eW(t)eWε(t)2

2, E

sup

t∈[0,1]

ξ˜W(t)− ˜ξWε(t)2

c ε2. (12)

Consider the new processξW. defined by ξW.(t)ξW.(tε)=A0

ξW.(tε)

(ttε)+

k,

eW(tε)

kA ξW. (tε)

-(Wk)

+1 2

k,j

,

eW(tε)

k

eW(tε)

j

A A

i

Γ , i Ai

ξW.ε(tε)

-(Wk)-(Wj)εηkj .

Lemma 5.1. The processξW. has the same law as the processZWεdefined in (3).

Proof. By Proposition 4.2,W (t)W (tε):=

k[eW(tε)]k(Wk(t)Wk(tε))are the increments of anRd-valued Brownian motionW; we get

ξW.(t)ξW.(tε)=A0 ξW.(tε)

(ttε)+

k

Ak

ξW. (tε) Wk(t)Wk(tε)

+1 2

k,s

AkAs

i

Γk,si Ai

ξW. (tε) Wk(t)Wk(tε) Ws(t)Ws(tε)

εηks .

(6)

By Eq. (6), we have 2

iΓk,si Ai = [Ak, As] +

i([Ai, As], AkAi + [Ai, Ak], AsAi), where the first term is antisymmetric in k, s and does not contribute; the remaining sum is symmetric in k, s. Thus we get

i,k,sΓk,si Ai-(Wk)-(Ws)=

i,k,sAi[As, Ai], Ak-(Wk)-(Ws)which proves Lemma 5.1. ✷ Lemma 5.2. We haveE[supt∈[0,1]ξW.(t)− ˜ξWε(t)2Rd]2.

Proof. The following method of introducing a parameterλand differentiating with respect toλ, is continuously used in [4]. Forλ∈ [0,1], leteλ:=λeW+(1λ)eWε and define the processξWλ by

ξWλ(t)ξWλ(tε)=A0

ξWλ(tε)

(ttε)+

k,

eλW(tε)

kA ξWλ(tε)

-(Wk)

+1 2

k,j

,

eWλ(tε)

k

eλW(tε)

j

A A

i

Γ , i Ai

ξWλε(tε)

-(Wk)-(Wj)(ttεjk .

LetuλW:=∂ξ /∂λ; thenξW.(t)− ˜ξWε(t)=1

0uλW(t)dλ. Denote byAk, (∂A A), , i Ai)the matrices obtained by differentiatingAk, ∂A A , Γ , i Ai with respect toξ, and consider the delayed matrix SDE

dJtt0=

A0 ξWλ(tε)

dt+

k,

eWλ(tε)

kA ξWλ(tε)

dWk+1 2

k,j ,

eλW(tε)

k

eλW(tε)

j

×

(∂A A)

i

Γ , i Ai

ξWλε(tε)

-(Wk)dWj(t)+-(Wj)dWk(t)ηjkdt Jtt0

with initial conditionJt0t0=Id. Then

uλW(T )=JTt0

T

0

Jt1t

0

k,

eW(tε)eWε(tε)

kA ξWλ(tε)

dWk(t)+

k,j

,

eW(tε)eWε(tε)

k

×

eλW(tε)

j

A A

i

Γ , i Ai

ξWλε(tε)

-(Wk)dWj(t)+-(Wj)dWk(t)ηkjdt which along with (12) proves Lemma 5.2. ✷

References

[1] A.-B. Cruzeiro, P. Malliavin, Renormalized differential geometry on path space: structural equation, curvature, J. Funct. Anal. 139 (1996) 119–181.

[2] P.E. Kloeden, E. Platen, Numerical Solution of Stochastic Differential Equations, Springer-Verlag, Berlin, 1992.

[3] P. Malliavin, Paramétrix trajectorielle pour un opérateur hypoelliptique et repère mobile stochastique, C. R. Acad. Sci. Paris, Sér. A-B 281 (1975) A241–A244.

[4] P. Malliavin, A. Thalmaier, Numerical error for SDE: asymptotic expansion and hyperdistributions, C.R. Math. Acad. Sci. Paris, Sér. I 336 (2003) 851–856.

[5] F. Malrieu, Convergence to equilibrium for granular media equations and their Euler schemes, Ann. Appl. Probab. 13 (2003) 540–560.

[6] G.N. Milstein, Numerical Integration of Stochastic Differential Equations, in: Math. Appl., vol. 313, Kluwer Academic, Dordrecht, 1995.

Translated and revised from the 1988 Russian original.

[7] D.W. Stroock, S.R.S. Varadhan, Multidimensional Diffusion Processes, in: Grundlehren Math. Wiss., vol. 233, Springer-Verlag, Berlin, 1979.

[8] C. Villani, Topics in Optimal Transportation, in: Grad. Stud. Math., vol. 58, Americal Mathematical Society, Providence, RI, 2003.

Références

Documents relatifs

It follows from the first assertion of theorm 2 that semi-stable sheaves coincide with isocline sheaves, i.e.. direct sums of

Abstract -— We present a numerical approximation scheme for the infinité horizon problem related to diffusion processes The scheme is based on a discrete version of the

— Error estimâtes are denved for the convergence of a semidiscrete Galerkin approximation scheme for the équation of an extensible beam A modification of the Crank- Nicolson

Figure 12: Relative difference between the computed solution and the exact drift-fluid limit of the resolved AP scheme at time t = 0.1 for unprepared initial and boundary conditions ε

We propose a completely different explicit scheme based on a stochastic step sequence and we obtain the almost sure convergence of its weighted empirical measures to the

., Xy as the ideal of X\ Then a defines a closed subscheme of P^, clearly flat over Z, whose Hilbert polynomial at every point of Z is p, since the Hilbert polynomial of the quotient

The pathwise error analysis of numerical schemes for SDE has been intensively studied [12, 21, 26, 30], whereas the weak error analysis started later with the work of Milstein [24,

We then identify in (2.7) a leading term of size N δt , which corresponds to the statistical error in a Monte-Carlo method for random variables of variance δt, and a remaining