In domain decomposition methods, coarse spaces are traditionally added to make the method scalable. Coarse spaces can however do much more: they can act on other error components that the subdomain iteration has difficulties with, and thus accelerate the overall solution process. We identify here the optimal coarse space for RAS, where optimal does not refer to scalable, but to best possible. This coarse space leads to convergence of the subdomain iterative method in two steps. Since this coarse space is very rich, we propose an approximation which turns out to be also very effective for multiscale problems.
CITATION STYLE
Gander, M. J., & Loneland, A. (2017). SHEM: An optimal coarse space for RAS and its multiscale approximation. In Lecture Notes in Computational Science and Engineering (Vol. 116, pp. 313–321). Springer Verlag. https://doi.org/10.1007/978-3-319-52389-7_32
Mendeley helps you to discover research relevant for your work.