Domain decomposition preconditioning for elliptic problems with jumps in coefficients

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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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
Volume68
Issue number12
DOIs
Publication statusPublished - 2014 Dec 1

Fingerprint

Domain Decomposition
Preconditioning
Elliptic Problems
Jump
Additive Schwarz Method
Decomposition
Domain decomposition methods
Domain Decomposition Method
Laplace Operator
Coefficient
Iterative methods
Preconditioner
Computational Cost
Mesh
Numerical Examples
Demonstrate
Costs

All Science Journal Classification (ASJC) codes

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

Cite this

@article{47880534226b42228f01ed0ae800077e,
title = "Domain decomposition preconditioning for elliptic problems with jumps in coefficients",
abstract = "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.",
author = "Sungmin Cho and Nepomnyaschikh, {S. V.} and Park, {Eun Jae}",
year = "2014",
month = "12",
day = "1",
doi = "10.1016/j.camwa.2014.08.011",
language = "English",
volume = "68",
pages = "2292--2313",
journal = "Computers and Mathematics with Applications",
issn = "0898-1221",
publisher = "Elsevier Limited",
number = "12",

}

Domain decomposition preconditioning for elliptic problems with jumps in coefficients. / Cho, Sungmin; Nepomnyaschikh, S. V.; Park, Eun Jae.

In: Computers and Mathematics with Applications, Vol. 68, No. 12, 01.12.2014, p. 2292-2313.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Domain decomposition preconditioning for elliptic problems with jumps in coefficients

AU - Cho, Sungmin

AU - Nepomnyaschikh, S. V.

AU - Park, Eun Jae

PY - 2014/12/1

Y1 - 2014/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84919431019&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84919431019&partnerID=8YFLogxK

U2 - 10.1016/j.camwa.2014.08.011

DO - 10.1016/j.camwa.2014.08.011

M3 - Article

AN - SCOPUS:84919431019

VL - 68

SP - 2292

EP - 2313

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

SN - 0898-1221

IS - 12

ER -