Published August 29, 2014 | Version v1

The MPI-PFASST Release (v0.2.0)

  • 1. Lawrence Berkeley National Laboratory
  • 2. Juelich Supercomputing Centre, Forschungszentrum Juelich GmbH
  • 3. Institute of Computational Scienc, Universita' della Svizzera Italiana

Description

The PFASST algorithm is a time-parallel algorithm for solving ODEs and PDEs.

The PFASST project is a C++ implementation of the 'parallel full approximation scheme in space and time' (PFASST) algorithm. It also contains basic implementations of the 'spectral deferred correction' (SDC) and 'multi-level spectral deferred correction' (MLSDC) algorithms.

Notable Features

  • Addition of MPI based PFASST.

Details

  • Addition of MPI based PFASST algorithm using the standard predictor stage in a block mode with fixed iterations. (#46, #57, #59)
  • Addition of a simple scalar example and appropriate tests. (#61, #63, #76, #81)
  • Further tests on proper calculation of quadrature nodes and weights (#74)
  • Better handling of 3rd-party dependencies (#53, #55)
  • Various tidying (#56, #60, #77)
  • Basic Profiling support and test coverage report (#78)

Files

PFASST-v0.2.0.zip

Files (92.3 kB)

Name Size Download all
md5:309f2af67c9fef3676e34894fd1f6713
92.3 kB Preview Download

Additional details

Related works