Parallel implementation of a monotone domain decomposition algorithm for nonlinear reaction-diffusion problems
暂无分享,去创建一个
Recently, a monotone iterative domain decomposition algorithm has been proposed for the numerical solution of nonlinear singularly perturbed reaction-diffusion problems. This paper describes a parallel implementation of the algorithm on a distributed memory cluster. Interprocess communication is effected by means of the MPI message passing library. For various domain decompositions, we give the convergence iteration count and execution time on up to 16 processors. The parallel scale-up of the algorithm improves as the number of mesh points is increased.
[1] Igor Boglaev. On monotone iterative methods for a nonlinear singularly perturbed reaction-diffusion problem , 2004 .
[2] C. V. Pao,et al. Monotone iterative methods for finite difference system of reaction-diffusion equations , 1985 .
[3] J. J. Miller,et al. Fitted Numerical Methods for Singular Perturbation Problems , 1996 .
[4] Y. Saad,et al. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .