Nonoverlapping domain decomposition methods with a simple coarse space for elliptic problems

  • Hu Q
  • Shu S
  • Wang J
8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We propose a substructuring preconditioner for solving three-dimensional elliptic equations with strongly discontinuous coefficients. The new preconditioner can be viewed as a variant of the classical substructuring preconditioner proposed by Bramble, Pasiack and Schatz (1989), but with much simpler coarse solvers. Though the condition number of the preconditioned system may not have a good bound, we are able to show that the convergence rate of the PCG method with such substructuring preconditioner is nearly optimal, and also robust with respect to the (possibly large) jumps of the coefficient in the elliptic equation.

Cite

CITATION STYLE

APA

Hu, Q., Shu, S., & Wang, J. (2010). Nonoverlapping domain decomposition methods with a simple coarse space for elliptic problems. Mathematics of Computation, 79(272), 2059–2078. https://doi.org/10.1090/s0025-5718-10-02361-6

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