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 pre-conditioned 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 sub-assembled finite element problem is solved. A convergence rate estimate for the GMRES iteration is established, under the condition that the diameters of subdomains are small enough. It is independent of the number of subdomains and grows only slowly with the subdomain problem size. Numerical experiments for several two-dimensional advection-diffusion problems illustrate the fast convergence of the proposed algorithm.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- Computational Research Division
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 944569
- Report Number(s):
- LBNL-1301E; TRN: US200902%%813
- Journal Information:
- Communications in Applied Mathematics and Computational Science, Vol. 3; Related Information: Journal Publication Date: 2008
- Country of Publication:
- United States
- Language:
- English
Similar Records
Domain decomposition methods for advection dominated linear-quadratic elliptic optimal control problems.
Incomplete domain decomposition preconditioning for coarse mesh neutron diffusion problems