A paper describes the mathematical basis and some applications of a class of massively parallel algorithms for finite-difference numerical solution of some time-dependent partial differential equations (PDEs) on massively parallel supercomputers. In a radical departure from the traditional spatially parallel but temporally sequential approach to solution of finite-difference equations, the algorithms described in the paper are fully parallelized in time as well as in space: this is achieved via a set of transformations based on eigenvalue/eigenvector decompositions of matrices obtained in discretizing the PDEs. The resulting time-parallel algorithms exhibit highly de-coupled structures, and can therefore be efficiently implemented on emerging, massively parallel, high-performance supercomputers.

This work was done by Nikzad Toomarian, Amir Fijany, and Jacob Barhen of Caltech for NASA's Jet Propulsion Laboratory. NPO-19385


This Brief includes a Technical Support Package (TSP).
Time-parallel solutions of linear PDE's on a supercomputer

(reference NPO19385) is currently available for download from the TSP library.

Don't have an account? Sign up here.



NASA Tech Briefs Magazine

This article first appeared in the December, 1999 issue of NASA Tech Briefs Magazine.

Read more articles from the archives here.