A rigorous analysis of time domain parallelism

Abstract

Time dependent partial differential equations are often solved using algorithms which parallelize the solution process in the spatial domain. However, as the number of processors increases, the parallel efficiency is limited by the increasing communication/computation ratio. Recently, several researchers have proposed algorithms incorporating time domain parallelism in order to increase efficiency. In this paper we discuss a class of such algorithms and analyze it rigorously. © 1995, Taylor & Francis Group, LLC. All rights reserved.