BDDC for nonsymmetric positive definite and symmetric indefinite problems

Conference · Wed Dec 10 00:00:00 EST 2008

OSTI ID:945051

Tu, Xuemin; Li, Jing

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: Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
• Sponsoring Organization: Computational Research Division
• DOE Contract Number: DE-AC02-05CH11231
• OSTI ID: 945051
• Report Number(s): LBNL-1316E; TRN: US200902%%1183
• Resource Relation: Conference: Eighteenth International Conference on Domain Decomposition Methods, 2008
• Country of Publication: United States
• Language: English

Related Subjects

97
ALGORITHMS
CONVERGENCE
LAWRENCE BERKELEY LABORATORY