Application of Maximum Principles to the Analysis of a Coupling Time Marching Algorithm

In this paper we study the convergence properties of a coupling time marching algorithm solving convection–diffusion problems on two domains using incompatible approximations. Convergence properties are obtained using local and global estimates of the solutions of convection–diffusion problems