A Schwarz alternating procedure for singular perturbation problems

Marc Garbey

doi:10.1137/S1064827593258437

A Schwarz alternating procedure for singular perturbation problems

Marc Garbey

Research output: Contribution to journal › Article › peer-review

36 Scopus citations

Abstract

We show that the Schwarz alternating procedure offers a good algorithm for the numerical solution of singular perturbation problems, provided the domain decomposition is properly designed to resolve the boundary and transition layers. We give sharp estimates for the optimal position of the domain boundaries and study the convergence rates of the algorithm for various linear second-order singular perturbation problems. We report on implementation results for a turning-point problem and a combustion problem.

Original language	English (US)
Pages (from-to)	1175-1201
Number of pages	27
Journal	SIAM Journal on Scientific Computing
Volume	17
Issue number	5
DOIs	https://doi.org/10.1137/S1064827593258437
State	Published - Sep 1996

Keywords

Boundary layers
Domain decomposition
Singular perturbations

ASJC Scopus subject areas

Computational Mathematics
Applied Mathematics

Access to Document

10.1137/S1064827593258437

Cite this

@article{e29777918b07405d88c5495f8fde90cd,

title = "A Schwarz alternating procedure for singular perturbation problems",

abstract = "We show that the Schwarz alternating procedure offers a good algorithm for the numerical solution of singular perturbation problems, provided the domain decomposition is properly designed to resolve the boundary and transition layers. We give sharp estimates for the optimal position of the domain boundaries and study the convergence rates of the algorithm for various linear second-order singular perturbation problems. We report on implementation results for a turning-point problem and a combustion problem.",

keywords = "Boundary layers, Domain decomposition, Singular perturbations",

author = "Marc Garbey",

year = "1996",

month = sep,

doi = "10.1137/S1064827593258437",

language = "English (US)",

volume = "17",

pages = "1175--1201",

journal = "SIAM Journal on Scientific Computing",

issn = "1064-8275",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "5",

}

TY - JOUR

T1 - A Schwarz alternating procedure for singular perturbation problems

AU - Garbey, Marc

PY - 1996/9

Y1 - 1996/9

N2 - We show that the Schwarz alternating procedure offers a good algorithm for the numerical solution of singular perturbation problems, provided the domain decomposition is properly designed to resolve the boundary and transition layers. We give sharp estimates for the optimal position of the domain boundaries and study the convergence rates of the algorithm for various linear second-order singular perturbation problems. We report on implementation results for a turning-point problem and a combustion problem.

AB - We show that the Schwarz alternating procedure offers a good algorithm for the numerical solution of singular perturbation problems, provided the domain decomposition is properly designed to resolve the boundary and transition layers. We give sharp estimates for the optimal position of the domain boundaries and study the convergence rates of the algorithm for various linear second-order singular perturbation problems. We report on implementation results for a turning-point problem and a combustion problem.

KW - Boundary layers

KW - Domain decomposition

KW - Singular perturbations

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

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

U2 - 10.1137/S1064827593258437

DO - 10.1137/S1064827593258437

M3 - Article

AN - SCOPUS:0001581261

SN - 1064-8275

VL - 17

SP - 1175

EP - 1201

JO - SIAM Journal on Scientific Computing

JF - SIAM Journal on Scientific Computing

IS - 5

ER -

A Schwarz alternating procedure for singular perturbation problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this