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.


PyPFASST is a Python 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 - reference and API documentation.


PyPFASST is released under the simplified BSD license, and is free for all uses as long as the copyright notices remain intact.

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