Open Access
2008 A balancing domain decomposition method by constraints for advection-diffusion problems
Xuemin Tu, Jing Li
Commun. Appl. Math. Comput. Sci. 3(1): 25-60 (2008). DOI: 10.2140/camcos.2008.3.25

Abstract

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.

Citation

Download Citation

Xuemin Tu. Jing Li. "A balancing domain decomposition method by constraints for advection-diffusion problems." Commun. Appl. Math. Comput. Sci. 3 (1) 25 - 60, 2008. https://doi.org/10.2140/camcos.2008.3.25

Information

Received: 6 June 2007; Revised: 27 December 2007; Accepted: 4 January 2008; Published: 2008
First available in Project Euclid: 20 December 2017

zbMATH: 1165.65402
MathSciNet: MR2425545
Digital Object Identifier: 10.2140/camcos.2008.3.25

Subjects:
Primary: 65N30 , 65N55

Keywords: advection-diffusion , BDDC , domain decomposition , nonsymmetric , Robin boundary condition

Rights: Copyright © 2008 Mathematical Sciences Publishers

Vol.3 • No. 1 • 2008
MSP
Back to Top