2005Unpublished venueRequires access

Domain decomposition algorithms for parabolic partial differential equations

Tsun‐Zee Mai, Younbae Jun

Open publisher page 0 citations

Abstract

Domain decomposition methods are considered to solve large systems of equations arising from the discretization of parabolic partial differential equations by finite difference methods. Domain decomposition methods can be classified into two classes, overlapping and non-overlapping methods with respect to the decomposition of the domain. We focus on non-overlapping unconditionally stable domain decomposition methods for solving parabolic partial differential equations with Dirichlet boundary conditions, Dirichlet-Neumann boundary conditions, and pure Neumann boundary conditions. In this dissertation, we propose an Implicit Prediction and Implicit Correction (IPIC) method, a Modified Implicit Prediction (MIP) method, and a Modified Alternating Direction Implicit (MADI) method. In order to maintain unconditional stability, the IPIC method uses a correction procedure on the interface line. However, the correction procedure is not necessary in the MIP method, which is proved in the dissertation. The MADI method is considered as the extreme case of the domain decomposition method without interior points being solved. Numerical results with five different model problems show that the IPIC, MIP, and MADI methods are unconditionally stable and efficient.

About this research paper

What this paper is about

Domain decomposition methods are considered to solve large systems of equations arising from the discretization of parabolic partial differential equations by finite difference methods. Domain decomposition methods can be classified into two classes, overlapping and non-overlapping methods with respect to the decomposition of the domain. We focus on non-overlapping unconditionally stable domain decomposition methods for solving parabolic partial differential equations with Dirichlet boundary conditions, Dirichlet-Neumann boundary conditions, and pure Neumann boundary conditions. In this dissertation, we propose an Implicit Prediction and Implicit Correction (IPIC) method, a Modified Implicit Prediction (MIP) method, and a Modified Alternating Direction Implicit (MADI) method. In order to maintain unconditional stability, the IPIC method uses a correction procedure on the interface line. However, the correction procedure is not necessary in the MIP method, which is proved in the dissertation. The MADI method is considered as the extreme case of the domain decomposition method without interior points being solved. Numerical results with five different model problems show that the IPIC, MIP, and MADI methods are unconditionally stable and efficient.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Domain decomposition methods are considered to solve large systems of equations arising from the discretization of parabolic partial differential equations by finite difference methods. Domain decomposition methods can be classified into two classes, overlapping and non-overlapping methods with respect to the decomposition of the domain. We focus on non-overlapping unconditionally stable domain decomposition methods for solving parabolic partial differential equations with Dirichlet boundary conditions, Dirichlet-Neumann boundary conditions, and pure Neumann boundary conditions. In this dissertation, we propose an Implicit Prediction and Implicit Correction (IPIC) method, a Modified Implicit Prediction (MIP) method, and a Modified Alternating Direction Implicit (MADI) method. In order to maintain unconditional stability, the IPIC method uses a correction procedure on the interface line. However, the correction procedure is not necessary in the MIP method, which is proved in the dissertation. The MADI method is considered as the extreme case of the domain decomposition method without interior points being solved. Numerical results with five different model problems show that the IPIC, MIP, and MADI methods are unconditionally stable and efficient.

Key concepts: Domain decomposition methods, Mathematics, Partial differential equation, Boundary value problem, Discretization, Domain (mathematical analysis), Neumann boundary condition, Decomposition method (queueing theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
Domain decomposition algorithms for parabolic partial differential equations — Research Paper | ScholarLens