Skip to Main content Skip to Navigation
Reports

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 .
Document type :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00074239
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:50:29 PM
Last modification on : Thursday, February 11, 2021 - 2:50:07 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 4:15:28 PM

Identifiers

  • HAL Id : inria-00074239, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

195

Files downloads

464