Additive average schwarz with adaptive coarse spaces: Scalable algorithms for multiscale problems

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We present an analysis of the additive average Schwarz preconditioner with two newly proposed adaptively enriched coarse spaces, which were presented at the twenty-third international conference on domain decomposition methods in Korea, for solving second-order elliptic problems with highly varying and discontinuous coefficients. It is shown that the condition number of the preconditioned system is bounded independently of the variations and the jumps in the coefficient while depending only on a prescribed threshold for the eigenvalues of the coarse space, and it depends linearly on the mesh parameter ratio H/h that is the ratio between the subdomain size and the mesh size thereby retaining the same optimality and scalability of the original additive average Schwarz preconditioner.

Cite

CITATION STYLE

APA

Marcinkowski, L., & Rahman, T. (2018). Additive average schwarz with adaptive coarse spaces: Scalable algorithms for multiscale problems. Electronic Transactions on Numerical Analysis, 49, 28–40. https://doi.org/10.1553/ETNA_VOL49S28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free