About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Parallel Algorithms and Applications
Paper
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.