Parallel Two-Grid Semismooth Newton-Krylov-Schwarz Method for Nonlinear Complementarity Problems
Journal of Scientific Computing
SIAM Journal on Numerical Analysis
Computational Optimization and Applications
Domain decomposition methods for PDE constrained optimization problems
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
Scalable domain decomposition preconditioners for heterogeneous elliptic problems
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
A restricted additive Schwarz (RAS) preconditioning technique was introduced recently for solving general nonsymmetric sparse linear systems. In this paper, we provide one-level and two-level extensions of RAS for symmetric positive definite problems using the so-called harmonic overlaps (RASHO). Both RAS and RASHO outperform their counterparts of the classical additive Schwarz variants (AS). The design of RASHO is based on a much deeper understanding of the behavior of Schwarz-type methods in overlapping subregions and in the construction of the overlap. In RASHO, the overlap is obtained by extending the nonoverlapping subdomains only in the directions that do not cut the boundaries of other subdomains, and all functions are made harmonic in the overlapping regions. As a result, the subdomain problems in RASHO are smaller than those of AS, and the communication cost is also smaller when implemented on distributed memory computers, since the right-hand sides of discrete harmonic systems are always zero and therefore do not need to be communicated. We also show numerically that RASHO-preconditioned CG takes fewer iterations than the corresponding AS-preconditioned CG. A nearly optimal theory is included for the convergence of RASHO-preconditioned CG for solving elliptic problems discretized with a finite element method.