BDDC for nonsymmetric positive definite and symmetric indefinite problems
Conference
·
OSTI ID:945051
The balancing domain decomposition methods by constraints are extended to solving both nonsymmetric, positive definite and symmetric, indefinite linear systems. In both cases, certain nonstandard primal constraints are included in the coarse problems of BDDC algorithms to accelerate the convergence. Under the assumption that the subdomain size is small enough, a convergence rate estimate for the GMRES iteration is established that the rate is independent of the number of subdomains and depends only slightly on the subdomain problem size. Numerical experiments for several two-dimensional examples illustrate the fast convergence of the proposed algorithms.
- Research Organization:
- Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US)
- Sponsoring Organization:
- Computational Research Division
- DOE Contract Number:
- AC02-05CH11231
- OSTI ID:
- 945051
- Report Number(s):
- LBNL-1316E
- Country of Publication:
- United States
- Language:
- English
Similar Records
A balancing domain decomposition method by constraints for advection-diffusion problems
Uniform convergence of multigrid v-cycle iterations for indefinite and nonsymmetric problems
Iterative schemes for nonsymmetric and indefinite elliptic boundary value problems
Journal Article
·
Tue Dec 09 23:00:00 EST 2008
· Communications in Applied Mathematics and Computational Science
·
OSTI ID:944569
Uniform convergence of multigrid v-cycle iterations for indefinite and nonsymmetric problems
Journal Article
·
Wed Nov 30 23:00:00 EST 1994
· SIAM Journal on Numerical Analysis (Society for Industrial and Applied Mathematics); (United States)
·
OSTI ID:6835604
Iterative schemes for nonsymmetric and indefinite elliptic boundary value problems
Journal Article
·
Thu Dec 31 23:00:00 EST 1992
· Mathematics of Computation; (United States)
·
OSTI ID:6647075