Convergence analysis of domain decomposition algorithms with full overlapping for the advection-diffusion problems |
| |
| Authors: | P. Le Tallec M. D. Tidriri. |
| |
| Affiliation: | INRIA, Domaine de Voluceau Rocquencourt, B.P. 105, Le Chesnay Cedex, France ; Iowa State University, Department of Mathematics, 400 Carver Hall, Ames, IA 50011 |
| |
| 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 described, and theoretical and numerical results that illustrate its convergence properties are then presented. |
| |
| Keywords: | |
|
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 |
|
点击此处可从《Mathematics of Computation》下载全文 |
|
