Overlapping Nonmatching Grid Method for the Ergodic Control Quasi Variational Inequalities ()

H. Mécheri, S. Saadi

Department of Mathematics, Badji Mokhtar University, Annaba, Algeria.

**DOI: **10.4236/ajcm.2013.31A005
PDF
HTML
4,009
Downloads
6,698
Views
Citations

Department of Mathematics, Badji Mokhtar University, Annaba, Algeria.

In this paper, we provide a maximum norm analysis of an overlapping Schwarz method on nonmatching grids for a quasi-variational inequalities related to ergodic control problems studied by M. Boulbrachene [1], where the “discount factor” (*i.e.*, the zero order term) is set to 0, we use an overlapping Schwarz method on nonmatching grid which consists in decomposing the domain in two sub domains, where the discrete alternating Schwarz sequences in sub domains converge to the solution of the ergodic control IQV for the zero order term. For and under a discrete maximum principle we show that the discretization on each sub domain converges quasi-optimally in the norm to 0.

Share and Cite:

Mécheri, H. and Saadi, S. (2013) Overlapping Nonmatching Grid Method for the Ergodic Control Quasi Variational Inequalities. *American Journal of Computational Mathematics*, **3**, 27-31. doi: 10.4236/ajcm.2013.31A005.

1. Introduction

The Schwarz alternating method can be used to solve elliptic boundary value problems on domains which consist of two or more overlapping sub domains.

The solution is approximated by an infinite sequence of functions which results from solving a sequence of elliptic boundary value problems in each of the sub domain.

In this paper, we are interested in the error analysis in the maximum norm for the obstacle problem in the context of overlapping nonmatching grids: we consider a domain Ω which is the union of two overlapping subdoains where each sub domain has its own triangulation. This kind of discretizations is very interesting as they can be applied to solving many practical problems which cannot be handled by global discretizations. They are earning particular attention of computational experts and engineers as they allow the choice of different mesh sizes and different orders of approximate polynomials in different sub domains according to the different properties of the solution and different requirements of the practical problems.

We study a new approach for the finite element approximation for the ergodic problem where the obstacle is related to a solution. We consider a domain which the union of two overlapping sub-domains where each sub domain has its own generated triangulation. The grid points on the sub-domain boundaries need not much the grid points from the other sub-domains. Under a discrete maximum principle, we show that the discretization on each sub-domain converges quasi-optimally in the norm.

In the first section we study the Schwarz method for the ergodic control Quasi-variational inequalities; we state the continuous alternating Schwarz sequence for quasivariational inequalities, and define their respective finite element counterparts in the context of overlapping grids.

In Section 2, we give a simple proof for the main result concerning error estimates in the norm for the problem studied, taking into account the combination of Jinping Zeng & Shuzi Zhou [2] geometrical convergence and P. L. Lions, B. Perthame [3] quasi-variational inequalities and ergodic impulse control.

2. Schwarz Method for the Ergodic Control Quasi-Variational Inequalities

We begin by down a classical results related to ergodic control quasi-variational inequalities [1-18].

It is well known that impulse control problems for reflected diffusion process may be solved by considering the solution of quasi variational inequalities (QVI) (see Bensoussan [4], A. Bensoussan and J. L. Lions [5]). A typical example is the following:

(1)

where Ω is given bounded smooth open set in, , f is given function, the cost function represents the obstacle of impulse control defined by:

(2)

where k is a positive number, M is an operator defined on and assumed to map into itself, that is,

whenever (3)

; and (.,.) denotes the inner product on Ω.

It has been proved that the long run average cost for this problem solves the ergodic QVI. More precisely, denoting by:

and.

P. L. Lions and B. Perthame [3] proved that the solution of the QVI :

(4)

converges to the solution of the ergodic control QVI :

(5)

As stated in the following theorem.

Theorem 1 [1]: As goes to, converges uniformly in to some constant, and converges uniformly in and strongly in to. Moreover is the unique solution of the quasi variational inequality of the ergodic control problem (5).

Problem Position

Let be fixed in the open interval and set. Then, one can easily see that problem (1) is equivalent to the following QVI:

(6)

where

, and (7)

Thanks to [5], (1) or (6) has a unique solution. Also, notice that, as the bilinear form (7) is independent of, the left hand side of (6) is independent of too.

3. The Schwarz Method for the Obstacle

We decompose into two overlapping polygonal sub domains and, such that

(8)

and satisfies the local regularity condition

(9)

We denote by the boundary condition of and the intersection of and is assumed to be empty.

3.1. The Schwarz Sequences for Problem (4)

We denote by:

and (10)

Choosing such that the unique solution of:

(11)

We respectively define the alternating Schwarz sequences on such that:

(12)

where.

3.2. The Continuous Schwarz Sequences for Principal Problem

We consider the following problem:

(13)

Choosing, solution of:

(14)

We respectively define the alternating Schwarz sequences on such that: and;

(15)

(16)

(17)

Lemma 1 [3]: for each

4. The Discret Problem

We suppose for simplicity that is polyhedral. Let be a regular, quasi uniform triangulation of into nsimplexes of diameter less than h.

We denote by the standard piecewise linear finite element espace, we consider the discrete variational inequality:

(18)

Thanks to ([6]), QVI (18) has a unique solution.

4.1. The Discrete Maximum Principle [7]

We assume that the matrix A with generic coefficient is a M-matrix.

(19)

As for the continuous problem, it is easy to see that, the solution of (18), is also solution to the following (QVI):

(20)

Theorem 2 [1]: Let and (the discrete solution). Then, there exists a constant independent of the both and h such that

Theorem 3 [1]: Under conditions of theorem 1 and 2, we have

Note that and is the finite element approximation of and respectively.

4.2. The Discrete Schwarz Sequences

Let be the space of continuous piecewise linear function on which vanish on.

For, we define

where denotes the interpolation operator on.

For. Let be a standard regular finite element triangulation in, being the mesh size.

We suppose that the two triangulations are mutually independent on a triangle belonging to one triangulation does not necessarily belong to the other.

Choosing, such that is a solution of the following inequation:

(21)

We define the alternating Schwarz sequences on such that:

(22)

And on such that:

(23)

Notation: We will adapt the following notations:

(24)

5. -Error Analysis

Lemma 2 [8]: is M-matrix such that

then exists constants such that

and

(25)

Theorem 4 [8]: produced by Schwarz alternating method converges geometrically to the solution of obstacle problem, more precisely, there exist which depend only respectively of and, such that

(26)

Theorem 5: Let Then, there exist two constants C and, independent of both h and n such that:

and

.

Proof:

We obtain

.

The case i = 2 is similar.

Theorem 6: Let and, the discretes alternating Schwarz sequences, we have:

Proof:

1)

For: and.

The case i = 2 is similar.

.

2)

Hence: for

, For: and.

The case i = 2 is similar.

.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] | M. Boulbrachène, “On Numerical Analysis of the Ergodic Control Quasi-Variational Inequalities,” International Mathematical Forum, No. 42, 2009, pp. 2051-2057. |

[2] | J. P. Zeng and S. Z. Zhou, “Schwarz Algorithm for the Solution of Variational Inequalities with Nonlinear Source Terms,” Applied Mathematics and Computation, Vol. 97, No. 1, 1998, pp. 23-35. doi:10.1016/S0096-3003(97)10129-1 |

[3] | P. L. Lions and B. Perthame, “Quasi-Variational Inequalities and Ergodic Impulse Control,” SIAM Journal on Control and Optimization, Vol. 24, No. 4, 1986, pp. 604-615. |

[4] | A. Bensoussan, “Stochastic Control by Functional Analysis Methods,” North-Holland Publishing Company, Amsterdam, 1982. |

[5] | A. Bensoussan and J. L. Lions, “Impulse Control and Quasi-Variational Inequalities,” Gauthiers Villars, Paris, 1984. |

[6] | P. Cortey-Dumont, “Approximation numérique d’une IQV liée a des problèmes de gestion de stock,” RAIRO, Anal. Numer, Vol. 14, 1980, pp. 335-346. |

[7] | P. G. Ciarlet and P. A. Raviart, “Maximum Principle and Uniform Convergence for the Finite Element Method,” Computer Methods in Applied Mechanics and Engineering, Vol. 2, No. 1, 1973, pp. 17-31. |

[8] | M. Haiour and S. Boulaaras, “Overlapping Domain Decomposition Methods for Elliptic Quasi-Variational Ine- qualities Related to Impulse Control Problem with Mixed Boundary Conditions,” Proceedings—Mathematical Sciences, Vol. 121, No. 4, 2011, pp. 481-493. |

[9] | B. Perthame, “Some Remarks on Quasi-Variational Inequalities and the Associated Impulsive Control Problem,” Annales de l’I. H. P., Section C, Vol. 2, No. 3, 1985, pp. 237-260. |

[10] | C. Xiao-Chuan, T. P. Matew and M. Vsakis, “Maximum nom Analysis of Ovelapping Non-Matching Grid Discretisations of Elliptic Equation,” SIAM Journal on Numerical Analysis, Vol. 5, 2000, pp. 1709-1728. |

[11] | J. Bramble, J. Pascial, J. wang and J. xu, “Convergence Estimates for Product Iterative Methods with Applications to Domain Decomposition,” Mathematics of Computation, Vol. 57, 1991, pp. 1-21. doi:10.1090/S0025-5718-1991-1090464-8 |

[12] | M. Boulbrachène, P. Cortey-Dumont and J. C. Miellou, “Approximation Convergence for a Subdomain Decomposition Method,” 1er Symposium International sur la Méthode de Sous-Domaine, Paris, 1987. |

[13] | M. Boulbrachène and S. Saadi, “Maximum Norm Analysis of an Overlapping Nonmatching Grids Method for the Obstacle Problem,” Hindawi Publishing Corporation, Cairo, 2006, pp. 1-10. |

[14] | M. Dryja, “An Additive Schwarz Algorithm for Two-and Three-Dimensional Finite Element Elliptic Problems, In: T. Chan, et al., Eds., Domain Decomposition Methods, Philadephia, SIAM, 1989, pp. 168-172. |

[15] | M. Dryja and O. Widlund, “Some Domain Decomposition Algorithms for Elliptic Problems,” In: L. Hayes and D. Kincaid, Eds, Iterative Methods for Large Systems, Academic Press, Boston, 1990, pp. 273-291. |

[16] | P. Cortey-Dumont, “Sur les inéquations variationnelles a opérateurs non coercifs,” M2AN, Vol. 19, 1985, pp. 195-212. |

[17] | P. Cortey-Dumont, “On Finite Element Approximation in the L-Norm of Variational Inequalities with Nonlinear Operators,” Numerische Mathematik, Vol. 47, No. 1, 1985, pp. 45-57. doi:10.1007/BF01389875 |

[18] | T. Chan, T. Hou and P. Lions, “Geometry Related Convergence Results for Domain Decomposition Algorithms,” SIAM Journal on Numerical Analysis, Vol. 28, No. 2, 1991, pp. 378-391. doi:10.1137/0728021 |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.