Communications in Applied Mathematics and Computational Science
- Commun. Appl. Math. Comput. Sci.
- Volume 3, Number 1 (2008), 25-60.
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 partially subassembled interface problem is solved. A convergence rate estimate for the GMRES iteration is established for the cases where the advection is not strong, under the condition that the mesh size is small enough. The estimate deteriorates with a decrease of the viscosity and for fixed viscosity it is independent of the number of subdomains and depends only slightly on the subdomain problem size. Numerical experiments for several two-dimensional advection-diffusion problems illustrate the fast convergence of the proposed algorithm for both diffusion-dominated and advection-dominated cases.
Commun. Appl. Math. Comput. Sci., Volume 3, Number 1 (2008), 25-60.
Received: 6 June 2007
Revised: 27 December 2007
Accepted: 4 January 2008
First available in Project Euclid: 20 December 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Tu, Xuemin; Li, Jing. A balancing domain decomposition method by constraints for advection-diffusion problems. Commun. Appl. Math. Comput. Sci. 3 (2008), no. 1, 25--60. doi:10.2140/camcos.2008.3.25. https://projecteuclid.org/euclid.camcos/1513798560