Multiwavelet-based grid adaptation with discontinuous Galerkin schemes for shallow water equations

We provide an adaptive strategy for solving shallow water equations with dynamic grid adaptation including a sparse representation of the bottom topography. A challenge in computing approximate solutions to the shallow water equations including wetting and drying is to achieve the positivity of the water height and the well-balancing of the approximate solution. A key property of our adaptive strategy is that it guarantees that these properties are preserved during the refinement and coarsening steps in the adaptation process.The underlying idea of our adaptive strategy is to perform a multiresolution analysis using multiwavelets on a hierarchy of nested grids. This provides difference information between successive refinement levels that may become negligibly small in regions where the solution is locally smooth. Applying hard thresholding the data are highly compressed and local grid adaptation is triggered by the remaining significant coefficients. Furthermore we use the multiresolution analysis of the underlying data as an additional indicator of whether the limiter has to be applied on a cell or not. By this the number of cells where the limiter is applied is reduced without spoiling the accuracy of the solution.By means of well-known 1D and 2D benchmark problems, we verify that multiwavelet-based grid adaptation can significantly reduce the computational cost by sparsening the computational grids, while retaining accuracy and keeping well-balancing and positivity

Performance study of the multiwavelet discontinuous Galerkin approach for solving the Green‐Naghdi equations

This paper presents a multiresolution discontinuous Galerkin scheme for the adaptive solution of Boussinesq‐type equations. The model combines multiwavelet‐based grid adaptation with a discontinuous Galerkin (DG) solver based on the system of fully nonlinear and weakly dispersive Green‐Naghdi (GN) equations. The key feature of the adaptation procedure is to conduct a multiresolution analysis using multiwavelets on a hierarchy of nested grids to improve the efficiency of the reference DG scheme on a uniform grid by computing on a locally refined adapted grid. This way the local resolution level will be determined by manipulating multiwavelet coefficients controlled by a single user‐defined threshold value. The proposed adaptive multiwavelet discontinuous Galerkin solver for GN equations (MWDG‐GN) is assessed using several benchmark problems related to wave propagation and transformation in nearshore areas. The numerical results demonstrate that the proposed scheme retains the accuracy of the reference scheme, while significantly reducing the computational cost

Adaptive multiresolution computations applied to detonations

A space-time adaptive method is presented for the reactive Euler equations describing chemically reacting gas flow where a two species model is used for the chemistry. The governing equations are discretized with a finite volume method and dynamic space adaptivity is introduced using multiresolution analysis. A time splitting method of Strang is applied to be able to consider stiff problems while keeping the method explicit. For time adaptivity an improved Runge--Kutta--Fehlberg scheme is used. Applications deal with detonation problems in one and two space dimensions. A comparison of the adaptive scheme with reference computations on a regular grid allow to assess the accuracy and the computational efficiency, in terms of CPU time and memory requirements.Comment: Zeitschrift f\"ur Physicalische Chemie, accepte

Automated parameters for troubled-cell indicators using outlier detection

In Vuik and Ryan (2014) we studied the use of troubled-cell indicators for discontinuity detection in nonlinear hyperbolic partial differential equations and introduced a new multiwavelet technique to detect troubled cells. We found that these methods perform well as long as a suitable, problem-dependent parameter is chosen. This parameter is used in a threshold which decides whether or not to detect an element as a troubled cell. Until now, these parameters could not be chosen automatically. The choice of the parameter has impact on the approximation: it determines the strictness of the troubled-cell indicator. An inappropriate choice of the parameter will result in detection (and limiting) of too few or too many elements. The optimal parameter is chosen such that the minimal number of troubled cells is detected and the resulting approximation is free of spurious oscillations. In this paper we will see that for each troubled-cell indicator the sudden increase or decrease of the indicator value with respect to the neighboring values is important for detection. Indication basically reduces to detecting the outliers of a vector (one dimension) or matrix (two dimensions). This is done using Tukey's boxplot approach to detect which coefficients in a vector are straying far beyond others (Tukey, 1977). We provide an algorithm that can be applied to various troubled-cell indication variables. Using this technique the problem-dependent parameter that the original indicator requires is no longer necessary as the parameter will be chosen automatically