Convergence Analysis of Domain Decomposition algorithms with full overlapping for the advection-diffusion problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

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

Abstract

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 .
Fichier principal
Vignette du fichier
RR-2435.pdf (585.31 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00074239 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074239 , version 1

Cite

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⟩
54 View
199 Download

Share

Gmail Facebook Twitter LinkedIn More