Parallel algorithms for parabolic problems on graphs

Abstract

In this paper two parallel numerical algorithms for solution of parabolic problems on graphs are investigated. The fully implicit and predictor-corrector finite difference schemes are proposed to approximate the differential equations on the given graph. The parallelization of the discrete algorithm is based on the domain decomposition method. Scalability analysis of the parallel algorithms is done. Some results of numerical simulations are presented and the efficiency of the proposed parallel algorithms is investigated. © 2012 Springer-Verlag.