Convergence Analysis of Domain Decomposition Algorithms with Full Overlapping forthe Advection-Diffusion Problems

摘要

The aim of this paper is to study the convergence properties of a Time MarchingAlgorithm 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.