This work is concerned with the introduction of a new numerical scheme based on the discontinuous Galerkin (DG) method. We propose to follow the methodology of higher order finite volume schemes and introduce a reconstruction operator into the DG scheme. This operator constructs higher order piecewise polynomial reconstructions from the lower order DG scheme. Such a procedure was proposed already in [2] based on heuristic arguments, however we provide a rigorous derivation, which justifies the increased...

A new very high-order finite volume method to solve problems with harmonic and biharmonic operators for onedimensional geometries is proposed. The main ingredient is polynomial reconstruction based on local interpolations of mean values providing accurate approximations of the solution up to the sixth-order accuracy. First developed with the harmonic operator, an extension for the biharmonic operator is obtained, which allows designing a very high-order finite volume scheme where the solution is...

Long time simulations of transport equations raise computational challenges since they require both a large domain of calculation and sufficient accuracy. It is therefore advantageous, in terms of computational costs, to use a time varying adaptive mesh, with small cells in the region of interest and coarser cells where the solution is smooth. Biological models involving cell dynamics fall for instance within this framework and are often non conservative to account for cell division. In that case...

These lecture notes present adaptive multiresolution schemes for evolutionary PDEs in Cartesian geometries. The discretization schemes are based either on finite volume or finite difference schemes. The concept of multiresolution analyses, including Harten’s approach for point and cell averages, is described in some detail. Then the sparse point representation method is discussed. Different strategies for adaptive time-stepping, like local scale dependent time stepping and time step control, are...

The concept of fully adaptive multiresolution finite volume schemes has been developed and investigated during the past decade. Here grid adaptation is realized by performing a multiscale decomposition of the discrete data at hand. By means of hard thresholding the resulting multiscale data are compressed. From the remaining data a locally refined grid is constructed. The aim of the present work is to give a self-contained overview on the construction of an appropriate multiresolution analysis using...

A finite volume method for the simulation of compressible aerodynamic flows is described. Stabilisation and shock capturing is achieved by the use of an HLLC consistent numerical flux function, with acoustic wave improvement. The method is implemented on an unstructured hybrid mesh in three dimensions. A solution of higher order accuracy is obtained by reconstruction, using an iteratively corrected least squares process, and by a new limiting procedure....

We present in this paper a pressure correction scheme for the drift-flux model combining finite element and finite volume discretizations, which is shown to enjoy essential stability features of the continuous problem: the scheme is conservative, the unknowns are kept within their physical bounds and, in the homogeneous case (i.e. when the drift velocity vanishes), the discrete entropy of the system decreases; in addition, when using for the drift velocity a closure law which takes the form of...

We develop gradient schemes for the approximation of the Perona-Malik equations and nonlinear tensor-diffusion equations. We prove the convergence of these methods to the weak solutions of the corresponding nonlinear PDEs. A particular gradient scheme on rectangular meshes is then studied numerically with respect to experimental order of convergence which shows its second order accuracy. We present also numerical experiments related to image filtering by time-delayed Perona-Malik and tensor diffusion...