DOI: 10.6084/m9.figshare.1431794
$ git diff --stat v0.4.0..v0.5.0
> 45 files changed, 1109 insertions(+), 758 deletions(-)
-
random deadlocks with various setups due to open and unused MPI request handlers (#210, #212, #216)
-
MPI is now the default when compiling (#197)
-
expected quadrature error now calculated and logged (#206)
-
runtime parameters can now also be read from config file instead of command line (#199)
-
colourful logging can now be disabled via runtime flag (#202)
-
file name for logs can be specified via runtime parameters (#203)
-
VectorEncapsulation
andMPIVectorEncapsulation
merged into one (#176, #200) -
version now set by Python script not requireing recompilation of everything when not changed (#195)
- Matthew Emmett, Lawrence Berkeley National Laboratory (memmett)
- Torbjörn Klatt, Jülich Supercomputing Centre (torbjoernk)
- Daniel Ruprecht, Institute of Computational Science, University of Lugano (danielru)
- Robert Speck, Jülich Supercomputing Centre (pancetta)
- Selman Terzi, Jülich Supercomputing Centre (selmanTerzi)
DOI: 10.6084/m9.figshare.1381721
$ git diff --stat v0.3.0..v0.4.0
> 131 files changed, 15182 insertions(+), 6940 deletions(-)
-
Iteration controll for PFASST via relative and absolute residual tolerances. (#139, #141, #142)
-
Adding an implicit sweeper with support for LU decomposition of quadrature matrix. (#150)
-
General improvements to the logging and configuration functionality. (#144, #145, #146, #148, #163, #168, #169, #177)
-
Successful tests on supercomputers (i.e., JUQUEEN) (#168, #176)
-
Examples: Boris supports multiple particles and multi-level coarsening (#152, #172, #180)
-
logging framework [Easylogging][] has been updated from v9.75 to v9.80. (#163)
-
root finding algorithm for polynomials uses fixed number of iterations or residual tolerance. (#162)
-
reworked how
pfasst::init(...)
is used. (#148) -
minimum CMake version bumped to 2.8.6 (#153)
-
git describe
-based version number aspfasst::VERSION
(#185) -
script to generate and compile test coverage report was rewritten in Python 3.x (#154)
- Matthew Emmett, Lawrence Berkeley National Laboratory (memmett)
- Torbjörn Klatt, Jülich Supercomputing Centre (torbjoernk)
- Daniel Ruprecht, Institute of Computational Science, University of Lugano (danielru)
- Robert Speck, Jülich Supercomputing Centre (pancetta)
- Selman Terzi, Jülich Supercomputing Centre (selmanTerzi)
DOI: 10.5281/zenodo.13221
$ git diff --stat v0.2.0..v0.3.0
> 84 files changed, 7687 insertions(+), 1968 deletions(-)
-
Complete rewrite of quadrature functions. (#103)
-
Addition of iteration control mechanism for SDC and MLSDC. (extention for PFASST is scheduled) (#108)
-
Introduced framework for passing command line parameters to programs using PFASST++. (#88)
-
Versatile and colourful logging framework based on Easylogging++. (#105, #123)
-
New Example: Boris-SDC. (#113)
-
Using Eigen3 matrix data types and functionality instead of Boost's uBLAS. (#82, #83, #85)
-
Introduced callback interception points in sweepers:
post_step
,post_sweep
andpost_predict
. (#107) -
In sweepers:
state(0)
is not assumed to be same asstart_state
. (#132) -
Examples are now in their own namespace
pfasst::examples::
(#138) -
Bunch of CMake-related fixes and extentions. (#83, #96, #101, #109, #112, #119, #121, #131, #133, #135)
-
Example of using PFASST++ with a Makefile project (see advection-diffusion example). (#129)
-
A few corrections and extentions to the documentation. (#117, #120)
- Matthew Emmett, Lawrence Berkeley National Laboratory (memmett)
- Torbjörn Klatt, Jülich Supercomputing Centre (torbjoernk)
- Daniel Ruprecht, Institute of Computational Science, University of Lugano (danielru)
- Robert Speck, Jülich Supercomputing Centre (pancetta)
DOI: 10.5281/zenodo.11517
$ git diff --stat v0.1.0..v0.2.0
> 52 files changed, 3306 insertions(+), 875 deletions(-)
- Addition of MPI based PFASST.
-
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)
-
Basic Profiling support and test coverage report (#78)
- Matthew Emmett, Lawrence Berkeley National Laboratory (memmett)
- Torbjörn Klatt, Jülich Supercomputing Centre (torbjoernk)
- Daniel Ruprecht, Institute of Computational Science, University of Lugano (danielru)
- Robert Speck, Jülich Supercomputing Centre (pancetta)
DOI: 10.5281/zenodo.11047
- Initial release with basic implementations of SDC and MLSDC
- agreed on code style guideline using Astyle tool (#2, #15, #21, #22)
- few test cases for quadrature and advection-diffusion example (#23, #25, #33, #37)
- Matthew Emmett, Lawrence Berkeley National Laboratory (memmett)
- Torbjörn Klatt, Jülich Supercomputing Centre (torbjoernk)