Convergence Analysis of Domain Decomposition algorithms with full overlapping for the advection-diffusion problems

Patrick Le Tallec (1) , Moulay D. Tidriri

1 MENUSIN - MEthodes NUmériques pour les Sciences de l'INgénieur

The aim of this paper is to study the convergence properties of a Time Marching Algorithm solving Advection-Diffusion problems on two domains using incompatible discretizations. The basic algorithm is first presented, and theoretical or numerical results illustrate its convergence properties. This study is based on spectral theory, a priori estimates and a Di-Giorgi-Nash maximum principle .

Mots clés: NON SYMMETRIC ELLIPTIC OPERATORS; DOMAIN DECOMPOSITION; INCOMPATIBLE GRIDS; ADVECTION-DIFFUSION; TIME MARCHING ALGORITHMS; OVERLAPPING; MAXIMUN PRINCIPLE

Domaines: Autre [cs.OH]

Patrick Le Tallec, Moulay D. Tidriri. Convergence Analysis of Domain Decomposition algorithms with full overlapping for the advection-diffusion problems. [Research Report] RR-2435, INRIA. 1994. ⟨inria-00074239⟩