BDDC for nonsymmetric positive definite and symmetric indefinite problems
Description:
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 …
more
Date:
December 10, 2008
Creator:
Tu, Xuemin & Li, Jing
Partner:
UNT Libraries Government Documents Department