The Big Improvement

DOI: 10.6084/m9.figshare.1381721

$ git diff --stat v0.3.0..v0.4.0
> 131 files changed, 15182 insertions(+), 6940 deletions(-)

Notable Features

• 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)
• Improved code organization.
  (#156, #157, #158, #170, #181)
• Rewamped documentation.
  (#149, #160, [#179][], #183)
• Examples: Boris supports multiple particles and multi-level coarsening
  (#152, #172, #180)

Details

• 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 as pfasst::VERSION
  (#185)
• script to generate and compile test coverage report was rewritten in Python 3.x
  (#154)

Contributors

• 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)