2006Unpublished venueRequires access

Rectangular Domain Decomposition Method for Parabolic Problems

Younbae Jun, Tsun‐Zee Mai

Open publisher page 3 citations

Abstract

Many partial differential equations defined on a rectangular domain can be solved numerically by using a domain decomposition method. The most commonly used decompositions are the domain being decomposed in stripwise and rectangular way. Theories for non-overlapping domain decomposition(in which two adjacent subdomains share an interface) were often focused on the stripwise decomposition and claimed that extensions could be made to the rectangular decomposition without further discussions. In this paper we focus on the comparisons of the two ways of decompositions. We consider the unconditionally stable scheme, the MIP algorithm, for solving parabolic partial differential equations. The SOR iterative method is used in the MIP algorithm. Even though the theories are the same but the performances are different. We found out that the stripwise decomposition has better performance.

About this research paper

What this paper is about

Many partial differential equations defined on a rectangular domain can be solved numerically by using a domain decomposition method. The most commonly used decompositions are the domain being decomposed in stripwise and rectangular way. Theories for non-overlapping domain decomposition(in which two adjacent subdomains share an interface) were often focused on the stripwise decomposition and claimed that extensions could be made to the rectangular decomposition without further discussions. In this paper we focus on the comparisons of the two ways of decompositions. We consider the unconditionally stable scheme, the MIP algorithm, for solving parabolic partial differential equations. The SOR iterative method is used in the MIP algorithm. Even though the theories are the same but the performances are different. We found out that the stripwise decomposition has better performance.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Many partial differential equations defined on a rectangular domain can be solved numerically by using a domain decomposition method. The most commonly used decompositions are the domain being decomposed in stripwise and rectangular way. Theories for non-overlapping domain decomposition(in which two adjacent subdomains share an interface) were often focused on the stripwise decomposition and claimed that extensions could be made to the rectangular decomposition without further discussions. In this paper we focus on the comparisons of the two ways of decompositions. We consider the unconditionally stable scheme, the MIP algorithm, for solving parabolic partial differential equations. The SOR iterative method is used in the MIP algorithm. Even though the theories are the same but the performances are different. We found out that the stripwise decomposition has better performance.

Key concepts: Domain decomposition methods, Mathematics, Partial differential equation, Domain (mathematical analysis), Decomposition, Fictitious domain method, Decomposition method (queueing theory), Focus (optics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Rectangular Domain Decomposition Method for Parabolic Problems — Research Paper | ScholarLens