Wavelets and adaptive grids for the discontinuous Galerkin method

In this paper, space adaptivity is introduced to control the error in the numerical solution of hyperbolic systems of conservation laws. The reference numerical scheme is a new version of the discontinuous Galerkin method, which uses an implicit diffusive term in the direction of the streamlines, for stability purposes. The decision whether to refine or to unrefine the grid in a certain location is taken according to the magnitude of wavelet coefficients, which are indicators of local smoothness of the numerical solution. Numerical solutions of the nonlinear Euler equations illustrate the efficiency of the method.     

Fully adaptive multiresolution finite volume schemes for conservation laws

The use of multiresolution decompositions in the context of finite volume schemes for conservation laws was first proposed by A. Harten for the purpose of accelerating the evaluation of numerical fluxes through an adaptive computation. In this approach the solution is still represented at each time step on the finest grid, resulting in an inherent limitation of the potential gain in memory space and computational time. The present paper is concerned with the development and the numerical analysis of fully adaptive multiresolution schemes, in which the solution is represented and computed in a dynamically evolved adaptive grid. A crucial problem is then the accurate computation of the flux without the full knowledge of fine grid cell averages. Several solutions to this problem are proposed, analyzed, and compared in terms of accuracy and complexity.

     

An adaptive enrichment algorithm for advection‐dominated problems

We are interested in developing a numerical framework well suited for advection–diffusion problems when the advection part is dominant. In that case, given Dirichlet type boundary condition, it is well known that a boundary layer develops. To resolve correctly this layer, standard methods consist in increasing the mesh resolution and possibly increasing the formal accuracy of the numerical method. In this paper, we follow another path: we do not seek to increase the formal accuracy of the scheme but, by a careful choice of finite element, to lower the mesh resolution in the layer. Indeed the finite element representation we choose is locally the sum of a standard one plus an enrichment. This paper proposes such a method and with several numerical examples, we show the potential of this approach. In particular, we show that the method is not very sensitive to the choice of the enrichment and develop an adaptive algorithm to automatically choose the enrichment functions.Copyright © 2012 John Wiley & Sons, Ltd.     

A meshless finite point method for three‐dimensional analysis of compressible flow problems involving moving boundaries and adaptivity

A finite point method for solving compressible flow problems involving moving boundaries and adaptivity is presented. The numerical methodology is based on an upwind‐biased discretization of the Euler equations, written in arbitrary Lagrangian–Eulerian form and integrated in time by means of a dual‐time steeping technique. In order to exploit the meshless potential of the method, a domain deformation approach based on the spring network analogy is implemented, and h‐adaptivity is also employed in the computations. Typical movable boundary problems in transonic flow regime are solved to assess the performance of the proposed technique. In addition, an application to a fluid–structure interaction problem involving static aeroelasticity illustrates the capability of the method to deal with practical engineering analyses. The computational cost and multi‐core performance of the proposed technique is also discussed through the examples provided. Copyright © 2013 John Wiley & Sons, Ltd.     

Compressive advection and multi‐component methods for interface‐capturing

This paper develops methods for interface‐capturing in multiphase flows. The main novelties of these methods are as follows: (a) multi‐component modelling that embeds interface structures into the continuity equation; (b) a new family of triangle/tetrahedron finite elements, in particular, the P₁DG‐P₂(linear discontinuous between elements velocity and quadratic continuous pressure); (c) an interface‐capturing scheme based on compressive control volume advection methods and high‐order finite element interpolation methods; (d) a time stepping method that allows use of relatively large time step sizes; and (e) application of anisotropic mesh adaptivity to focus the numerical resolution around the interfaces and other areas of important dynamics. This modelling approach is applied to a series of pure advection problems with interfaces as well as to the simulation of the standard computational fluid dynamics benchmark test cases of a collapsing water column under gravitational forces (in two and three dimensions) and sloshing water in a tank. Two more test cases are undertaken in order to demonstrate the many‐material and compressibility modelling capabilities of the approach. Numerical simulations are performed on coarse unstructured meshes to demonstrate the potential of the methods described here to capture complex dynamics in multiphase flows. Copyright © 2015 John Wiley & Sons, Ltd.     

A posteriori error estimation and adaptivity for degenerate parabolic problems

Two explicit error representation formulas are derived for degenerate parabolic PDEs, which are based on evaluating a parabolic residual in negative norms. The resulting upper bounds are valid for any numerical method, and rely on regularity properties of solutions of a dual parabolic problem in nondivergence form with vanishing diffusion coefficient. They are applied to a practical space-time discretization consisting of piecewise linear finite elements over highly graded unstructured meshes, and backward finite differences with varying time-steps. Two rigorous a posteriori error estimates are derived for this scheme, and used in designing an efficient adaptive algorithm, which equidistributes space and time discretization errors via refinement/coarsening. A simulation finally compares the behavior of the rigorous a posteriori error estimators with a heuristic approach, and hints at the potentials and reliability of the proposed method.

     

Can a finite element method perform arbitrarily badly?

In this paper we construct elliptic boundary value problems whose standard finite element approximations converge arbitrarily slowly in the energy norm, and show that adaptive procedures cannot improve this slow convergence. We also show that the -norm and the nodal point errors converge arbitrarily slowly. With the -norm two cases need to be distinguished, and the usual duality principle does not characterize the error completely. The constructed elliptic problems are one dimensional.

     

An approximate waves-bordering algorithm for adaptive finite elements analysis

In this paper an Approximate Waves-Bordering algorithm (AWB) is presented. It computes the finite elements linear system solution-update after a refinement/unrefinement step. This is done taking into consideration only the equations that correspond to the nodes whose solution is modified above a certain tolerance and it appears to be very efficient. The algorithm considers an increasing set of equations that updates recursively and stops when the norm of the residual has gone under a user-defined threshold. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Stokes model with cavitation for the numerical simulation of hydrodynamic lubrication

We present a cavitation model based on the Stokes equation and formulate adaptive finite element methods for its numerical solution. A posteriori error estimates and adaptive algorithms are derived, and numerical examples illustrating the theory are supplied, in particular with comparison to the simplified Reynolds model of lubrication. Copyright © 2010 John Wiley & Sons, Ltd.