Do nightly convergence tests
As an initiative for proving and monitoring the correctness of ExaHyPE, we should come up with a series of very simple tests which demonstrate how we debug the code and also give convergence rates.
This is something Sven and Vasco can do.
A problem is that almost all tests require periodic BC, thought.
Collection of problems
We could solve:
- Advection Equations
- With the Initial Data:
- Low order polynomials (
Q(:) = 1 + v0 * x(0) - v0 * t
). Intermediate solver steps are always analytically known - No polynomials (
Q(:) = ICA * SIN(2*pi*(x(0) - t))
et al) - For random matter distributions
- Low order polynomials (
- Implemented as conservative equation (
F(Q) = Q
) - Implemented as nonconservative equation (
F=0, BgradQ = (1,0,0), S=0
)
- With the Initial Data:
- EulerFlow, SRHD, MHD: See the List of Benchmarks
See also: gi26det/ExaHyPE#73 and gi26det/ExaHyPE#64.