The Parallel Full Approximation Scheme in Space and Time (PFASST) algorithm is a method for parallelizing ODEs and PDEs in time. The maths behind the PFASST algorithm are breifly described on the Maths page.

This work was supported by the Director, DOE Office of Science, Office of Advanced Scientific Computing Research, Office of Mathematics, Information, and Computational Sciences, Applied Mathematical Sciences Program, under contract DE-SC0004011. This work is currently authored by Michael L. Minion and Matthew Emmett. Contributions are welcome – please contact Matthew Emmett.


LIBPFASST is a Fortran implementation of the PFASST algorithm.

Main parts of the documentation

  • Download - download and installation instructions.
  • Tutorial - getting started and basic usage.
  • Overview - design and interface overview.
  • Reference - information about the internals of LIBPFASST.
  • Communicators - information about the various communicators available.


LIBPFASST is released under the GNU GPL, please see the LICENSE file in the source code repository for more information.

If you would like to contribute to the development of LIBPFASST, please, dive right in by visiting the LIBPFASST project page.