Convergence analysis of domain decomposition algorithms with full overlapping for the advection-diffusion problems
نویسندگان
چکیده
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.
منابع مشابه
Convergence Analysis of Domain Decomposition Algorithms with Full Overlapping for the Advection-Di usion Problems
The aim of this paper is to study the convergence properties of a Time Marching Algorithm solving Advection-Di usion problems on two domains using incompatible discretizations. The basic algorithm is rst presented, and theoretical or numerical results illustrate its convergence properties. This work has been supported by the Hermes Research program under grant number RDAN 86.1/3. The author was...
متن کاملA Domain Decomposition Method Based on Weighted Interior Penalties for Advection-Diffusion-Reaction Problems
We propose a domain decomposition method for advection-diffusionreaction equations based on Nitsche’s transmission conditions. The advection dominated case is stabilized using a continuous interior penalty approach based on the jumps in the gradient over element boundaries. We prove the convergence of the finite element solutions of the discrete problem to the exact solution and we propose a pa...
متن کاملThe Interface Control Domain Decomposition (ICDD) Method for Elliptic Problems
Interface controls are unknown functions used as Dirichlet or Robin boundary data on the interfaces of an overlapping decomposition designed for solving second order elliptic boundary value problems. The controls are computed through an optimal control problem with either distributed or interface observation. Numerical results show that, when interface observation is considered, the resulting i...
متن کاملA Balancing Domain Decomposition Method by Constraints for Advection-diffusion Problems
The balancing domain decomposition methods by constraints are extended to solving nonsymmetric, positive definite linear systems resulting from the finite element discretization of advection-diffusion equations. A preconditioned GMRES iteration is used to solve a Schur complement system of equations for the subdomain interface variables. In the preconditioning step of each iteration, a partiall...
متن کاملA Finite Volume Ventcell-Schwarz Algorithm for Advection-Diffusion Equations
This paper provides a new fully discrete domain decomposition algorithm for the advection diffusion reaction equation. It relies on the optimized Ventcell–Schwarz algorithm with a finite volume discretization of the subdomain problems. The scheme includes a wide range of advection fluxes with a special treatment on the boundary. A complete analysis of the scheme is presented, and the convergenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 68 شماره
صفحات -
تاریخ انتشار 1999