The study applies a two-dimensional adaptive mesh refinement (AMR) method to estimate the coordinates of the locations of the centre of vortices in steady, incompressible flow around a square cylinder placed within a channel. The AMR method is robust and low cost, and can be applied to any incompressible fluid flow. The considered channel has a blockage ratio of $1/8$. The AMR is tested on eight cases, considering flows with different Reynolds numbers ($5\le Re\le 50$), and the estimated coordinates of the location of the centres of vortices are reported. For all test cases, the initial coarse meshes are refined four times, and the results are in good agreement with the literature where a very fine mesh was used. Furthermore, this study shows that the AMR method can capture the location of the centre of vortices within the fourth refined cells, and further confirms an improvement in the estimation with more refinements.

This is a survey of the theory of adaptive finite element methods (AFEMs), which are fundamental to modern computational science and engineering but whose mathematical assessment is a formidable challenge. We present a self-contained and up-to-date discussion of AFEMs for linear second-order elliptic PDEs and dimension d > 1, with emphasis on foundational issues. After a brief review of functional analysis and basic finite element theory, including piecewise polynomial approximation in graded meshes, we present the core material for coercive problems. We start with a novel a posteriori error analysis applicable to rough data, which delivers estimators fully equivalent to the solution error. They are used in the design and study of three AFEMs depending on the structure of data. We prove linear convergence of these algorithms and rate-optimality provided the solution and data belong to suitable approximation classes. We also address the relation between approximation and regularity classes. We finally extend this theory to discontinuous Galerkin methods as prototypes of non-conforming AFEMs, and beyond coercive problems to inf-sup stable AFEMs.

We propose a new fractional Laplacian for bounded domains, expressed as a conservation law and thus particularly suited to finite-volume schemes. Our approach permits the direct prescription of no-flux boundary conditions. We first show the well-posedness theory for the fractional heat equation. We also develop a numerical scheme, which correctly captures the action of the fractional Laplacian and its anomalous diffusion effect. We benchmark numerical solutions for the Lévy–Fokker–Planck equation against known analytical solutions. We conclude by numerically exploring properties of these equations with respect to their stationary states and long-time asymptotics.

Three typical elastic problems, including beam bending, truss extension and compression, and two-rings collision are simulated with smoothed particle hydrodynamics (SPH) using Lagrangian and Eulerian algorithms. A contact-force model for elastic collisions and equation of state for pressure arising in colliding elastic bodies are also analytically derived. Numerical validations, on using the corresponding theoretical models, are carried out for the beam bending, truss extension and compression simulations. Numerical instabilities caused by largely deformed particle configurations in finite/large elastic deformations are analysed. The numerical experiments show that the algorithms handle small deformations well, but only the Lagrangian algorithm can handle large elastic deformations. The numerical results obtained from the Lagrangian algorithm also show a good agreement with the theoretical values.

The present review paper has several objectives. Its primary aim is to give an idea of the general features of virtual element methods (VEMs), which were introduced about a decade ago in the field of numerical methods for partial differential equations, in order to allow decompositions of the computational domain into polygons or polyhedra of a very general shape.

Nonetheless, the paper is also addressed to readers who have already heard (and possibly read) about VEMs and are interested in gaining more precise information, in particular concerning their application in specific subfields such as ${C}^1$ -approximations of plate bending problems or approximations to problems in solid and fluid mechanics.

Low-rank tensor representations can provide highly compressed approximations of functions. These concepts, which essentially amount to generalizations of classical techniques of separation of variables, have proved to be particularly fruitful for functions of many variables. We focus here on problems where the target function is given only implicitly as the solution of a partial differential equation. A first natural question is under which conditions we should expect such solutions to be efficiently approximated in low-rank form. Due to the highly nonlinear nature of the resulting low-rank approximations, a crucial second question is at what expense such approximations can be computed in practice. This article surveys basic construction principles of numerical methods based on low-rank representations as well as the analysis of their convergence and computational complexity.

We consider a local projection stabilization based on biorthogonal systems for convection–diffusion–reaction differential equations with mixed boundary conditions. The approach based on biorthogonal systems is numerically more efficient than other existing approaches to obtain a uniform approximation for convection dominated problems. We prove optimal a priori error estimates for the proposed numerical technique. Numerical examples are presented to demonstrate the performance of the approach.

Finite element methods developed for unfitted meshes have been widely applied to various interface problems. However, many of them resort to non-conforming spaces for approximation, which is a critical obstacle for the extension to $\textbf{H}(\text{curl})$ equations. This essential issue stems from the underlying Sobolev space $\textbf{H}^s(\text{curl};\,\Omega)$, and even the widely used penalty methodology may not yield the optimal convergence rate. One promising approach to circumvent this issue is to use a conforming test function space, which motivates us to develop a Petrov–Galerkin immersed finite element (PG-IFE) method for $\textbf{H}(\text{curl})$-elliptic interface problems. We establish the Nédélec-type IFE spaces and develop some important properties including their edge degrees of freedom, an exact sequence relating to the $H^1$ IFE space and optimal approximation capabilities. We analyse the inf-sup condition under certain assumptions and show the optimal convergence rate, which is also validated by numerical experiments.

The classical model for studying one-phase Hele-Shaw flows is based on a highly nonlinear moving boundary problem with the fluid velocity related to pressure gradients via a Darcy-type law. In a standard configuration with the Hele-Shaw cell made up of two flat stationary plates, the pressure is harmonic. Therefore, conformal mapping techniques and boundary integral methods can be readily applied to study the key interfacial dynamics, including the Saffman–Taylor instability and viscous fingering patterns. As well as providing a brief review of these key issues, we present a flexible numerical scheme for studying both the standard and nonstandard Hele-Shaw flows. Our method consists of using a modified finite-difference stencil in conjunction with the level-set method to solve the governing equation for pressure on complicated domains and track the location of the moving boundary. Simulations show that our method is capable of reproducing the distinctive morphological features of the Saffman–Taylor instability on a uniform computational grid. By making straightforward adjustments, we show how our scheme can easily be adapted to solve for a wide variety of nonstandard configurations, including cases where the gap between the plates is linearly tapered, the plates are separated in time, and the entire Hele-Shaw cell is rotated at a given angular velocity.

We extend the Annually Recalculated Virtual Annuity (ARVA) spending rule for retirement savings decumulation (Waring and Siegel (2015) Financial Analysts Journal, 71(1), 91–107) to include a cap and a floor on withdrawals. With a minimum withdrawal constraint, the ARVA strategy runs the risk of depleting the investment portfolio. We determine the dynamic asset allocation strategy which maximizes a weighted combination of expected total withdrawals (EW) and expected shortfall (ES), defined as the average of the worst 5% of the outcomes of real terminal wealth. We compare the performance of our dynamic strategy to simpler alternatives which maintain constant asset allocation weights over time accompanied by either our same modified ARVA spending rule or withdrawals that are constant over time in real terms. Tests are carried out using both a parametric model of historical asset returns as well as bootstrap resampling of historical data. Consistent with previous literature that has used different measures of reward and risk than EW and ES, we find that allowing some variability in withdrawals leads to large improvements in efficiency. However, unlike the prior literature, we also demonstrate that further significant enhancements are possible through incorporating a dynamic asset allocation strategy rather than simply keeping asset allocation weights constant throughout retirement.

An emerging technique in image segmentation, semi-supervised learning and general classification problems concerns the use of phase-separating flows defined on finite graphs. This technique was pioneered in Bertozzi and Flenner (2012, Multiscale Modeling and Simulation10(3), 1090–1118), which used the Allen–Cahn flow on a graph, and was then extended in Merkurjev et al. (2013, SIAM J. Imaging Sci.6(4), 1903–1930) using instead the Merriman–Bence–Osher (MBO) scheme on a graph. In previous work by the authors, Budd and Van Gennip (2020, SIAM J. Math. Anal.52(5), 4101–4139), we gave a theoretical justification for this use of the MBO scheme in place of Allen–Cahn flow, showing that the MBO scheme is a special case of a ‘semi-discrete’ numerical scheme for Allen–Cahn flow. In this paper, we extend this earlier work, showing that this link via the semi-discrete scheme is robust to passing to the mass-conserving case. Inspired by Rubinstein and Sternberg (1992, IMA J. Appl. Math.48, 249–264), we define a mass-conserving Allen–Cahn equation on a graph. Then, with the help of the tools of convex optimisation, we show that our earlier machinery can be applied to derive the mass-conserving MBO scheme on a graph as a special case of a semi-discrete scheme for mass-conserving Allen–Cahn. We give a theoretical analysis of this flow and scheme, proving various desired properties like existence and uniqueness of the flow and convergence of the scheme, and also show that the semi-discrete scheme yields a choice function for solutions to the mass-conserving MBO scheme.

In this paper, we derive and analyse mean-field models for the dynamics of groups of individuals undergoing a random walk. The random motion of individuals is only influenced by the perceived densities of the different groups present as well as the available space. All individuals have the tendency to stay within their own group and avoid the others. These interactions lead to the formation of aggregates in case of a single species and to segregation in the case of multiple species. We derive two different mean-field models, which are based on these interactions and weigh local and non-local effects differently. We discuss existence and stability properties of solutions for both models and illustrate the rich dynamics with numerical simulations.

This paper presents a new immersed finite volume element method for solving second-order elliptic problems with discontinuous diffusion coefficient on a Cartesian mesh. The new method possesses the local conservation property of classic finite volume element method, and it can overcome the oscillating behaviour of the classic immersed finite volume element method. The idea of this method is to reconstruct the control volume according to the interface, which makes it easy to implement. Optimal error estimates can be derived with respect to an energy norm under piecewise $H^{2}$ regularity. Numerical results show that the new method significantly outperforms the classic immersed finite volume element method, and has second-order convergence in $L^{\infty }$ norm.

The aim of this paper is to provide and numerically test in the presence of measurement noise a procedure for target classification in wave imaging based on comparing frequency-dependent distribution descriptors with precomputed ones in a dictionary of learned distributions. Distribution descriptors for inhomogeneous objects are obtained from the scattering coefficients. First, we extract the scattering coefficients of the (inhomogeneous) target from the perturbation of the reflected waves. Then, for a collection of inhomogeneous targets, we build a frequency-dependent dictionary of distribution descriptors and use a matching algorithm in order to identify a target from the dictionary up to some translation, rotation and scaling.

We present an adaptation of the Monge–Ampère (MA) lattice basis reduction scheme to the MA equation with second boundary value condition, provided the target is a convex set. This yields a fast adaptive method to numerically solve the optimal transport (OT) problem between two absolutely continuous measures, the second of which has convex support. The proposed numerical method actually captures a specific Brenier solution which is minimal in some sense. We prove the convergence of the method as the grid step size vanishes and show with numerical experiments that it is able to reproduce subtle properties of the OT problem.