The discontinuous Galerkin (DG) method provides a robust and flexible technique for the time integration of fractional diffusion problems. However, a practical implementation uses coefficients defined by integrals that are not easily evaluated. We describe specialized quadrature techniques that efficiently maintain the overall accuracy of the DG method. In addition, we observe in numerical experiments that known superconvergence properties of DG time stepping for classical diffusion problems carry over in a modified form to the fractional-order setting.

Image registration is the process of finding an alignment between two or more images so that their appearances match. It has been widely studied and applied to several fields, including medical imaging and biology, where it is related to morphometrics. In this paper, we present a construction of conformal diffeomorphisms which is based on constrained optimization. We consider a set of different penalty terms that aim to enforce conformality, based on discretizations of the Cauchy–Riemann equations and geometric principles, and demonstrate them experimentally on a variety of images.

We consider an extension of the classical Fisher–Kolmogorov equation, called the “Fisher–Stefan” model, which is a moving boundary problem on $0<x<L(t)$. A key property of the Fisher–Stefan model is the “spreading–vanishing dichotomy”, where solutions with $L(t)>L_{\text{c}}$ will eventually spread as $t\rightarrow \infty$, whereas solutions where $L(t)\ngtr L_{\text{c}}$ will vanish as $t\rightarrow \infty$. In one dimension it is well known that the critical length is $L_{\text{c}}=\unicode[STIX]{x1D70B}/2$. In this work, we re-formulate the Fisher–Stefan model in higher dimensions and calculate $L_{\text{c}}$ as a function of spatial dimensions in a radially symmetric coordinate system. Our results show how $L_{\text{c}}$ depends upon the dimension of the problem, and numerical solutions of the governing partial differential equation are consistent with our calculations.

Motivated by the manufacture of carbon fibre components, this paper considers the smooth draping of loosely woven fabric over rigid obstacles, both smooth and nonsmooth. The draped fabric is modelled as the continuum limit of a Chebyshev net of two families of short rigid rods that are freely pivoted at their joints. This approach results in a system of nonlinear hyperbolic partial differential equations whose characteristics are the fibres in the fabric. The analysis of this system gives useful information about the drapability of obstacles of many shapes and also poses interesting theoretical questions concerning well-posedness, smoothness and computability of the solutions.

We propose two linearly implicit energy-preserving schemes for the complex modified Korteweg–de Vries equation, based on the invariant energy quadratization method. First, a new variable is introduced and a new Hamiltonian system is constructed for this equation. Then the Fourier pseudospectral method is used for the space discretization and the Crank–Nicolson leap-frog schemes for the time discretization. The proposed schemes are linearly implicit, which is only needed to solve a linear system at each time step. The fully discrete schemes can be shown to conserve both mass and energy in the discrete setting. Some numerical examples are also presented to validate the effectiveness of the proposed schemes.

The population dynamics for the replicator equation has been well studied in continuous time, but there is less work that explicitly considers the evolution in discrete time. The discrete-time dynamics can often be justified indirectly by establishing the relevant evolutionary dynamics for the corresponding continuous-time system, and then appealing to an appropriate approximation property. In this paper we study the discrete-time system directly, and establish basic stability results for the evolution of a population defined by a positive definite system matrix, where the population is disrupted by random perturbations to the genotype distribution either through migration or mutation, in each successive generation.

Rumours have become part of our daily lives, and their spread has a negative impact on a variety of human affairs. Therefore, how to control the spread of rumours is an important topic. In this paper, we extend the classic Maki–Thompson model from a deterministic framework to a stochastic framework with a forgetting mechanism, because real-world person-to-person communications are inevitably affected by random factors. By constructing suitable stochastic Lyapunov functions, we show that the asymptotic behaviour of the stochastic rumour model is governed by the basic reproductive number. If this number is less than one, then the solution of the stochastic rumour model oscillates around the rumour-free equilibrium under extra mild conditions, indicating the extinction of the rumour with a probability of one. Otherwise, the solution always fluctuates around the endemic equilibrium under certain parametric restrictions, implying that the rumour will continually persist. In addition, we discuss a possible intervention strategy that stops the spread of rumours by strengthening the intensity of white noise, which is very different from the deterministic rumour model without white noise. Also, numerical simulations are conducted to support our analytical results.

Neodymium magnets were independently discovered in 1984 by General Motors and Sumitomo. Today, they are the strongest type of permanent magnets commercially available. They are the most widely used industrial magnets with many applications, including in hard disk drives, cordless tools and magnetic fasteners. We use a vector potential approach, rather than the more usual magnetic potential approach, to derive the three-dimensional (3D) magnetic field for a neodymium magnet, assuming an idealized block geometry and uniform magnetization. For each field or observation point, the 3D solution involves 24 nondimensional quantities, arising from the eight vertex positions of the magnet and the three components of the magnetic field. The only unknown in the model is the value of magnetization, with all other model quantities defined in terms of field position and magnet location. The longitudinal magnetic field component in the direction of magnetization is bounded everywhere, but discontinuous across the magnet faces parallel to the magnetization direction. The transverse magnetic fields are logarithmically unbounded on approaching a vertex of the magnet.

We define and solve classes of sparse matrix problems that arise in multilevel modelling and data analysis. The classes are indexed by the number of nested units, with two-level problems corresponding to the common situation, in which data on level-1 units are grouped within a two-level structure. We provide full solutions for two-level and three-level problems, and their derivations provide blueprints for the challenging, albeit rarer in applications, higher-level versions of the problem. While our linear system solutions are a concise recasting of existing results, our matrix inverse sub-block results are novel and facilitate streamlined computation of standard errors in frequentist inference as well as allowing streamlined mean field variational Bayesian inference for models containing higher-level random effects.

Let $\boldsymbol{f}$ be a square-integrable, zero-mean, random vector with observable realizations in a Hilbert space H, and let $\boldsymbol{g}$ be an associated square-integrable, zero-mean, random vector with realizations which are not observable in a Hilbert space K. We seek an optimal filter in the form of a closed linear operator X acting on the observable realizations of a proximate vector $\boldsymbol{f}_{\epsilon } \approx \boldsymbol{f}$ that provides the best estimate $\widehat{\boldsymbol{g}}_{\epsilon} = X \boldsymbol{f}_{\epsilon}$ of the vector $\boldsymbol{g}$ . We assume the required covariance operators are known. The results are illustrated with a typical example.

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 Kirchhoff approximation is widely used to describe the scatter of elastodynamic waves. It simulates the scattered field as the convolution of the free-space Green’s tensor with the geometrical elastodynamics approximation to the total field on the scatterer surface and, therefore, cannot be used to describe nongeometrical phenomena, such as head waves. The aim of this paper is to demonstrate that an alternative approximation, the convolution of the far-field asymptotics of the Lamb’s Green’s tensor with incident surface tractions, has no such limitation. This is done by simulating the scatter of a critical Gaussian beam of transverse motions from an infinite plane. The results are of interest in ultrasonic nondestructive testing.

We propose a variation of the pointwise residual method for solving primal and dual ill-posed linear programming with approximate data, sensitive to small perturbations. The method leads to an auxiliary problem, which is also a linear programming problem. Theorems of existence and convergence of approximate solutions are established and optimal estimates of approximation of initial problem solutions are achieved.

This paper investigates asset-liability management problems in a continuous-time economy. When the financial market consists of cointegrated risky assets, institutional investors attempt to make profit from the cointegration feature on the one hand, while on the other hand they need to maintain a stable surplus level, that is, the company’s wealth less its liability. Challenges occur when the liability is random and cannot be fully financed or hedged through the financial market. For mean–variance investors, an additional concern is the rational time-consistency issue, which ensures that a decision made in the future will not be restricted by the current surplus level. By putting all these factors together, this paper derives a closed-form feedback equilibrium control for time-consistent mean–variance asset-liability management problems with cointegrated risky assets. The solution is built upon the Hamilton–Jacobi–Bellman framework addressing time inconsistency.

Online retailers are increasingly adding buy-online and pick-up-in-store (BOPS) modes to order fulfilment. In this paper, we study a system of BOPS by developing a stochastic Nash equilibrium model with incentive compatibility constraints, where the online retailer seeks optimal online sale prices and an optimal delivery schedule in an order cycle, and the offline retailer pursues a maximal rate of sharing the profit owing to the consignment from the online retailer. By an expectation method and optimality conditions, the equilibrium model is first transformed into a system of constrained nonlinear equations. Then, by a case study and sensitivity analysis, the model is validated and the following practical insights are revealed. (I) Our method can reliably provide an equilibrium strategy for the online and offline retailers under BOPS mode, including the optimal online selling price, the optimal delivery schedule, the optimal inventory and the optimal allocation of profits. (II) Different model parameters, such as operational cost, price sensitivity coefficient, cross-sale factor, opportunity loss ratio and loss ratio of unsold goods, generate distinct impacts on the equilibrium solution and the profits of the BOPS system. (III) Optimization of the delivery schedule can generate greater consumer surplus, and makes the offline retailer share less sale profit from the online retailer, even if the total profit of the BOPS system becomes higher. (IV) Inventory subsidy is an indispensable factor to improve the applicability of the game model in BOPS mode.

We consider the numerical solution of competitive exothermic and endothermic reactions in the presence of a chaotic advection flow. The resulting behaviour is characterized by a strong dependence on the competitive reaction history. The burnt temperature is not immediately connected to simple enthalpy calculations, so there is a subtlety in the interplay between the major parameters, notably the Damköhler number, the ratio of the heats of exothermic and endothermic reactions, as well as the ratio of their respective activation energies. This paper seeks to explore the way these parameters affect the steady states of these reaction fronts and their stability.

We assume that human carrying capacity is determined by food availability. We propose three classes of human population dynamical models of logistic type, where the carrying capacity is a function of the food production index. We also employ an integration-based parameter estimation technique to derive explicit formulas for the model parameters. Using actual population and food production index data, numerical simulations of our models suggest that an increase in food availability implies an increase in carrying capacity, but the carrying capacity is “self-limiting” and does not increase indefinitely.