The PFASST project is a C++ implementation of the parallel full approximation scheme in space and time (PFASST) algorithm, which in turn is a time-parallel algorithm for solving ODEs and PDEs. It also contains basic implementations of the spectral deferred correction (SDC) and multi-level spectral deferred correction (MLSDC) algorithms.
See Bibliography .
Doxygen generated documentation can be found on the PinT server. Currently, it features the following content:
v0.5.0 The MPI Bugfix Release (2015/06/01)
A few important fixes to MPI behaviour. DOI: 10.6084/m9.figshare.1431794. See the Changelog for details.
v0.4.0 The Big Improvement (2015/04/17)
A bunch of improvements and usability enhancements. DOI: 10.6084/m9.figshare.1381721. See the Changelog for details.
v0.3.0 The Big Cleanup Release (2014/12/12)
A lot of internal cleanup and usability enhancements. DOI: 10.5281/zenodo.13221. See the Changelog for details.
v0.2.0 MPI-PFASST Release (2014/08/29)
Implementation of PFASST with MPI. DOI: 10.5281/zenodo.11517. See the Changelog for details.
v0.1.0 First Release (2014/07/25)
Initial release with basic implementations of SDC and MLSDC. DOI: 10.5281/zenodo.11047. See the Changelog for details.
Release tags will be signed by one of the following PGP keys:
0xAD9F8DC6 2014-12-12 Torbjörn Klatt <[email protected]> Fingerprint 6277 E9D9 7AA2 DBBE 5DE7 7498 756B F4D7 AD9F 8DC6 1024D/9950EF2E 2001-11-22 Matthew Emmett <[email protected]> Fingerprint B09C 1425 1C47 B58E B3AC 2E74 6F22 8460 9950 EF2E
Branch | Status | Details |
---|---|---|
Master | Jenkins Job | |
Development | Jenkins Job |
Results of static code analysis such as test coverage or SLOCcount metrics can be found at this Jenkins job. Further metrics can be found on Open Hub aka Ohloh.