Domain decomposition preconditioning for elliptic problems with jumps in coefficients

Sungmin Cho, S. V. Nepomnyaschikh, Eun Jae Park

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


We propose an effective iterative preconditioning method to solve elliptic problems with jumps in coefficients. The algorithm is based on the additive Schwarz method (ASM). First, we consider a domain decomposition method without cross points on the interfaces between subdomains and next, we treat the cross points case. In both cases the main computational cost is an implementation of preconditioners for the Laplace operator in whole domain and in subdomains. Iterative convergence is independent of jumps in coefficients and mesh size. Several numerical examples are given to demonstrate the performance of proposed algorithm and theory developed in the paper.

Original languageEnglish
Pages (from-to)2292-2313
Number of pages22
JournalComputers and Mathematics with Applications
Issue number12
Publication statusPublished - 2014 Dec 1

Bibliographical note

Funding Information:
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology NRF-2012R1A2A2A01046471 .

Publisher Copyright:
© 2014 Elsevier Ltd. All rights reserved.

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'Domain decomposition preconditioning for elliptic problems with jumps in coefficients'. Together they form a unique fingerprint.

Cite this