Domain decomposition method for parabolic problems with Neumann conditions

DOI10.1016/J.AMC.2006.06.008MaRDI QIDQ858841zbMATH OpenOpenAlexFDO

Publication date 11 January 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.06.008

domain decomposition method modified implicit prediction Neumann problem numerical examples parabolic problem parallel algorithm

Mathematics Subject Classification ID

Initial value problems for second-order parabolic equations (35K15) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Parallel numerical computation (65Y05)

Review text

Domain decomposition is a parallel algorithm to speed up the computations for solving partial differential equations. In this paper the authors consider a second order parabolic equation in two space dimensions on a Cartesian grid on the unit square. Both Dirichlet, Neumann and mixed boundary conditions are considered. The computational domain is divided into the same number of strips as the number of processes which will be used for the parallel computation. Within each strip a fully implicit scheme is used (BTCS, backward time central space). On the interfaces between the strips the \textit{modified implicit prediction} (MIP, a technique derived by the authors in a previous paper for Dirichlet boundary conditions) is used. In the test section of the paper the authors compare the spectral radii, the number of iterations and the speed up when the problem is solved with different numbers of processors.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: Domain decomposition method for parabolic problems with Neumann conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858841)