Band 33, Heft 2

We propose an efficient approach for time integration of Klein–Gordon equations with highly oscillatory in time input terms. The new methods are highly accurate in the entire range, from slowly varying up to highly oscillatory regimes. Our approach is based on splitting methods tailored to the structure of the input term which allows us to resolve the oscillations in the system uniformly in all frequencies, while the error constant does not grow as the oscillations increase. Numerical experiments highlight our theoretical findings and demonstrate the efficiency of the new schemes.

We analyze a goal-oriented adaptive algorithm that aims to efficiently compute the quantity of interest G ( u ⋆ ) with a linear goal functional G and the solution u ⋆ to a general second-order nonsymmetric linear elliptic partial differential equation. The current state of the analysis of iterative algebraic solvers for nonsymmetric systems lacks the contraction property in the norms that are prescribed by the functional analytic setting. This seemingly prevents their application in the optimality analysis of goal-oriented adaptivity. As a remedy, this paper proposes a goal-oriented adaptive iteratively symmetrized finite element method (GOAISFEM). It employs a nested loop with a contractive symmetrization procedure, e.g., the Zarantonello iteration, and a contractive algebraic solver, e.g., an optimal multigrid solver. The various iterative procedures require well-designed stopping criteria such that the adaptive algorithm can effectively steer the local mesh refinement and the computation of the inexact discrete approximations. The main results consist of full linear convergence of the proposed adaptive algorithm and the proof of optimal convergence rates with respect to both degrees of freedom and total computational cost (i.e., optimal complexity). Numerical experiments confirm the theoretical results and investigate the selection of the parameters.

We study the stability and convergence properties of a semi-implicit time stepping scheme for the incompressible Navier–Stokes equations with variable density and viscosity. The density is assumed to be approximated in a way that conserves the minimum-maximum principle. The scheme uses a fractional time-stepping method and the momentum, which is equal to the product of the density and velocity, as a primary unknown. The semi-implicit algorithm for the coupled momentum-pressure is shown to be conditionally stable and the velocity is shown to converge in L 2 norm with order one in time. Numerical illustrations confirm that the algorithm is stable and convergent under classic CFL condition even for sharp density profiles.

The Poisson–Boltzmann equation, which incorporates the source of the Dirac distribution, has been widely applied in predicting the electrostatic potential of biomolecular systems in solution. In this paper we discuss and analyse the virtual element method for the Poisson–Boltzmann equation on general polyhedral meshes. Nearly optimal error estimates, approaching the best possible accuracy, are achieved for the virtual element approximation in both the L 2 -norm and H 1 -norm, even when the solution of the entire domain has low regularity. The efficiency of the virtual element method and the validity of the proposed theoretical prediction are confirmed through numerical experiments conducted on various polyhedral meshes.