Volume 28, Issue 3

This paper provides an overview of the new features of the finite element library deal.II, version 9.2.

We consider the numerical approximation of the spectral fractional diffusion problem based on the so called Balakrishnan representation. The latter consists of an improper integral approximated via quadratures. At each quadrature point, a reaction–diffusion problem must be approximated and is the method bottle neck. In this work, we propose to reduce the computational cost using a reduced basis strategy allowing for a fast evaluation of the reaction–diffusion problems. The reduced basis does not depend on the fractional power s for 0 < s min ⩽ s ⩽ s max < 1. It is built offline once for all and used online irrespectively of the fractional power. We analyze the reduced basis strategy and show its exponential convergence. The analytical results are illustrated with insightful numerical experiments.

The focus of this paper is the analysis of families of hybridizable interior penalty discontinuous Galerkin methods for second order elliptic problems. We derive a priori error estimates in the energy norm that are optimal with respect to the mesh size. Suboptimal L 2 -norm error estimates are proven. These results are valid in two and three dimensions. Numerical results support our theoretical findings, and we illustrate the computational cost of the method.

This report presents adaptive artificial compression methods in which the time-step and artificial compression parameter ε are independently adapted. The resulting algorithms are supported by analysis and numerical tests. The first and second-order methods are embedded. As a result, the computational, cognitive, and space complexities of the adaptive ε , k algorithms are negligibly greater than that of the simplest, first-order, constant ε , constant k artificial compression method.