A note on reducing communication costs in explicit time stepping methods on parallel computers (Q756956)

This paper discusses a parallel implementation of the forward Euler method for the heat equation. The idea is that for a given block of data, a processor should compute the solution over the entire domain of dependence before exchanging information. In one spatial dimension the computation proceeds by filling in triangular regions of the (x,t)-strip, and the idea extends naturally to higher dimensions. The result is an increase of parallel efficiency at the expense of some memory.