Infinitesimal symmetries of a partial differential equation (PDE) can be defined algebraically as the solutions of the linearisation (Frechet derivative) equation holding on the space of solutions to the PDE, and they are well-known to comprise a linear space having the structure of a Lie algebra. Solutions of the adjoint linearisation equation holding on the space of solutions to the PDE are called adjoint-symmetries. Their algebraic structure for general PDE systems is studied herein. This is motivated by the correspondence between variational symmetries and conservation laws arising from Noether’s theorem, which has a modern generalisation to non-variational PDEs, where infinitesimal symmetries are replaced by adjoint-symmetries, and variational symmetries are replaced by multipliers (adjoint-symmetries satisfying a certain Euler-Lagrange condition). Several main results are obtained. Symmetries are shown to have three different linear actions on the linear space of adjoint-symmetries. These linear actions are used to construct bilinear adjoint-symmetry brackets, one of which is a pull-back of the symmetry commutator bracket and has the properties of a Lie bracket. The brackets do not use or require the existence of any local variational structure (Hamiltonian or Lagrangian) and thus apply to general PDE systems. One of the symmetry actions is shown to encode a pre-symplectic (Noether) operator, which leads to the construction of symplectic 2-form and Poisson bracket for evolution systems. The generalised KdV equation in potential form is used to illustrate all of the results.

In this paper, the problem of restoration of cloud contaminated optical images is studied in the case when we have no information about brightness of such images in the damage region. We propose a new variational approach for exact restoration of optical multi-band images utilising Synthetic Aperture Radar (EOS – Spatial Data Analytics, GIS Software, Satellite Imagery – is a cloud-based platform to derive remote sensing data and analyse satellite imagery for business and science purposes) images of the same regions. We prove existence of solutions, propose an alternating minimisation method for computing them, prove convergence of this method to weak solutions of the original problem and derive optimality conditions.

Steel corrosion plays a central role in different technological fields. In this article, we consider a simple case of a corrosion phenomenon which describes a pure iron dissolution in sodium chloride. This article is devoted to prove rigorously that under rather general hypotheses on the initial data, the solution of this iron dissolution model converges to a self-similar profile as $t\rightarrow +\infty$. We will do so for an equivalent formulation as presented in the book of Avner Friedman about parabolic equations (Friedman (1964) Partial Differential Equations of Parabolic Type, Prentice-Hall, Inc., Englewood Cliffs, NJ.). In order to prove the convergence result, we apply a comparison principle together with suitable upper and lower solutions.

We consider steady states with mass constraint of the fourth-order thin-film equation with van der Waals force in a bounded domain which leads to a singular elliptic equation for the thickness with an unknown pressure term. By studying second-order nonlinear ordinary differential equation,

\begin{equation*}h_{rr}+\frac{1}{r}h_{r}=\frac{1}{\alpha}h^{-\alpha}-p\end{equation*}

We introduce novel multi-agent interaction models of entropic spatially inhomogeneous evolutionary undisclosed games and their quasi-static limits. These evolutions vastly generalise first- and second-order dynamics. Besides the well-posedness of these novel forms of multi-agent interactions, we are concerned with the learnability of individual payoff functions from observation data. We formulate the payoff learning as a variational problem, minimising the discrepancy between the observations and the predictions by the payoff function. The inferred payoff function can then be used to simulate further evolutions, which are fully data-driven. We prove convergence of minimising solutions obtained from a finite number of observations to a mean-field limit, and the minimal value provides a quantitative error bound on the data-driven evolutions. The abstract framework is fully constructive and numerically implementable. We illustrate this on computational examples where a ground truth payoff function is known and on examples where this is not the case, including a model for pedestrian movement.

It is standard in chemistry to represent a sequence of reactions by a single overall reaction, often called a complex reaction in contrast to an elementary reaction. Photosynthesis $6 \text{CO}_2+6 \text{H}_2\text{O} \longrightarrow \text{C}_6\text{H}_{12}\text{O}_6 + 6 \text{O}_2$ is an example of such complex reaction. We introduce a mathematical operation that corresponds to summing two chemical reactions. Specifically, we define an associative and non-communicative operation on the product space ${\mathbb{N}}_0^n\times {\mathbb{N}}_0^n$ (representing the reactant and the product of a chemical reaction, respectively). The operation models the overall effect of two reactions happening in succession, one after the other. We study the algebraic properties of the operation and apply the results to stochastic reaction networks (RNs), in particular to reachability of states, and to reduction of RNs.

Loss functions with a large number of saddle points are one of the major obstacles for training modern machine learning (ML) models efficiently. First-order methods such as gradient descent (GD) are usually the methods of choice for training ML models. However, these methods converge to saddle points for certain choices of initial guesses. In this paper, we propose a modification of the recently proposed Laplacian smoothing gradient descent (LSGD) [Osher et al., arXiv:1806.06317], called modified LSGD (mLSGD), and demonstrate its potential to avoid saddle points without sacrificing the convergence rate. Our analysis is based on the attraction region, formed by all starting points for which the considered numerical scheme converges to a saddle point. We investigate the attraction region’s dimension both analytically and numerically. For a canonical class of quadratic functions, we show that the dimension of the attraction region for mLSGD is $\lfloor (n-1)/2\rfloor$, and hence it is significantly smaller than that of GD whose dimension is $n-1$.

We introduce an approach and a software tool for solving coupled energy networks composed of gas and electric power networks. Those networks are coupled to stochastic fluctuations to address possibly fluctuating demand due to fluctuating demands and supplies. Through computational results, the presented approach is tested on networks of realistic size.

Symmetries and adjoint-symmetries are two fundamental (coordinate-free) structures of PDE systems. Recent work has developed several new algebraic aspects of adjoint-symmetries: three fundamental actions of symmetries on adjoint-symmetries; a Lie bracket on the set of adjoint-symmetries given by the range of a symmetry action; a generalised Noether (pre-symplectic) operator constructed from any non-variational adjoint-symmetry. These results are illustrated here by considering five examples of physically interesting nonlinear PDE systems – nonlinear reaction-diffusion equations, Navier-Stokes equations for compressible viscous fluid flow, surface-gravity water wave equations, coupled solitary wave equations and a nonlinear acoustic equation.

In this paper, we consider the existence and stability of singular patterns in a fractional Ginzburg–Landau equation with a mean field. We prove the existence of three types of singular steady-state patterns (double fronts, single spikes, and double spikes) by solving their respective consistency conditions. In the case of single spikes, we prove the stability of single small spike solution for sufficiently large spatial period by studying an explicit non-local eigenvalue problem which is equivalent to the original eigenvalue problem. For the other solutions, we prove the instability by using the variational characterisation of eigenvalues. Finally, we present the results of some numerical computations of spike solutions based on the finite difference methods of Crank–Nicolson and Adams–Bashforth.

While the quasilinear isothermal Euler equations are an excellent model for gas pipeline flow, the operation of the pipeline flow with high pressure and small Mach numbers allows us to obtain approximate solutions by a simpler semilinear model. We provide a derivation of the semilinear model that shows that the semilinear model is valid for sufficiently low Mach numbers and sufficiently high pressures. We prove an existence result for continuous solutions of the semilinear model that takes into account lower and upper bounds for the pressure and an upper bound for the magnitude of the Mach number of the gas flow. These state constraints are important both in the operation of gas pipelines and to guarantee that the solution remains in the set where the model is physically valid. We show the constrained exact boundary controllability of the system with the same pressure and Mach number constraints.

This paper investigates the stability of a fully parabolic–parabolic-fluid (PP-fluid) system of the Keller–Segel–Navier–Stokes type in a bounded planar domain under the natural volume-filling hypothesis. In the limit of fast signal diffusion, we first show that the global classical solutions of the PP-fluid system will converge to the solution of the corresponding parabolic–elliptic-fluid (PE-fluid) system. As a by-product, we obtain the global well-posedness of the PE-fluid system for general large initial data. We also establish some new exponential time decay estimates for suitable small initial cell mass, which in particular ensure an improvement of convergence rate on time. To further explore the stability property, we carry out three numerical examples of different types: the nontrivial and trivial equilibriums, and the rotating aggregation. The simulation results illustrate the possibility to achieve the optimal convergence and show the vanishment of the deviation between the PP-fluid system and PE-fluid system for the equilibriums and the drastic fluctuation of error for the rotating solution.

New classes of conditionally integrable systems of nonlinear reaction–diffusion equations are introduced. They are obtained by extending a well-known nonclassical symmetry of a scalar partial differential equation to a vector equation. New exact solutions of nonlinear predator–prey systems with cross-diffusion are constructed. Infinite dimensional classes of exact solutions are made available for such nonlinear systems. Some of these solutions decay towards extinction and some oscillate or spiral around an interior fixed point. It is shown that the conditionally integrable systems are closely related to the standard diffusive Lotka–Volterra system, but they have additional features.

Narrow escape and narrow capture problems which describe the average times required to stop the motion of a randomly travelling particle within a domain have applications in various areas of science. While for general domains, it is known how the escape time decreases with the increase of the trap sizes, for some specific 2D and 3D domains, higher-order asymptotic formulas have been established, providing the dependence of the escape time on the sizes and locations of the traps. Such results allow the use of global optimisation to seek trap arrangements that minimise average escape times. In a recent paper (Iyaniwura (2021) SIAM Rev. 63(3), 525–555), an explicit size- and trap location-dependent expansion of the average mean first passage time (MFPT) in a 2D elliptic domain was derived. The goal of this work is to systematically seek global minima of MFPT for $1\leq N\leq 50$ traps in elliptic domains using global optimisation techniques and compare the corresponding putative optimal trap arrangements for different values of the domain eccentricity. Further, an asymptotic formula for the average MFPT in elliptic domains with N circular traps of arbitrary sizes is derived, and sample optimal configurations involving non-equal traps are computed.

The systematic development of coarse-grained (CG) models via the Mori–Zwanzig projector operator formalism requires the explicit description of a deterministic drift term, a dissipative memory term and a random fluctuation term. The memory and fluctuating terms are related by the fluctuation–dissipation relation and are more challenging to sample and describe than the drift term due to complex dependence on space and time. This work proposes a rational basis for a Markovian data-driven approach to approximating the memory and fluctuating terms. We assumed a functional form for the memory kernel and under broad regularity hypothesis, we derived bounds for the error committed in replacing the original term with an approximation obtained by its asymptotic expansions. These error bounds depend on the characteristic time scale of the atomistic model, representing the decay of the autocorrelation function of the fluctuating force; and the characteristic time scale of the CG model, representing the decay of the autocorrelation function of the momenta of the beads. Using appropriate parameters to describe these time scales, we provide a quantitative meaning to the observation that the Markovian approximation improves as they separate. We then proceed to show how the leading-order term of such expansion can be identified with the Markovian approximation usually considered in the CG theory. We also show that, while the error of the approximation involving time can be controlled, the Markovian term usually considered in CG simulations may exhibit significant spatial variation. It follows that assuming a spatially constant memory term is an uncontrolled approximation which should be carefully checked. We complement our analysis with an application to the estimation of the memory in the CG model of a one-dimensional Lennard–Jones chain with different masses and interactions, showing that even for such a simple case, a non-negligible spatial dependence for the memory term exists.

The classic game of Battleship involves two players taking turns attempting to guess the positions of a fleet of vertically or horizontally positioned enemy ships hidden on a $10\times 10$ grid. One variant of this game, also referred to as Battleship Solitaire, Bimaru or Yubotu, considers the game with the inclusion of X-ray data, represented by knowledge of how many spots are occupied in each row and column in the enemy board. This paper considers the Battleship puzzle problem: the problem of reconstructing an enemy fleet from its X-ray data. We generate non-unique solutions to Battleship puzzles via certain reflection transformations akin to Ryser interchanges. Furthermore, we demonstrate that solutions of Battleship puzzles may be reliably obtained by searching for solutions of the associated classical binary discrete tomography problem which minimise the discrete Laplacian. We reformulate this optimisation problem as a quadratic unconstrained binary optimisation problem and approximate solutions via a simulated annealer, emphasising the future practical applicability of quantum annealers to solving discrete tomography problems with predefined structure.

In this contribution, we present a modelling and simulation framework for parametrised lithium-ion battery cells. We first derive a continuum model for a rather general intercalation battery cell on the basis of non-equilibrium thermodynamics. In order to efficiently evaluate the resulting parameterised non-linear system of partial differential equations, the reduced basis method is employed. The reduced basis method is a model order reduction technique on the basis of an incremental hierarchical approximate proper orthogonal decomposition approach and empirical operator interpolation. The modelling framework is particularly well suited to investigate and quantify degradation effects of battery cells. Several numerical experiments are given to demonstrate the scope and efficiency of the modelling framework.

The frameworks of Baikov–Gazizov–Ibragimov (BGI) and Fushchich–Shtelen (FS) approximate symmetries are used to study symmetry properties of partial differential equations with a small parameter. In general, it is shown that unlike the case of ordinary differential equations (ODEs), unstable BGI point symmetries of unperturbed partial differential equations (PDEs) do not necessarily yield local approximate symmetries for the perturbed model. While some relations between the BGI and FS approaches can be established, the two methods yield different approximate symmetry classifications. Detailed classifications are presented for two nonlinear PDE families. The second family includes a one-dimensional wave equation describing the wave motion in a hyperelastic material with a single family of fibers. For this model, approximate symmetries can be used to compute approximate closed-form solutions. Wave breaking times are found numerically and using the approximate solutions, which yield comparable results.

Flow fields are determined from image sequences obtained in an experiment in which benthic macrofauna, Arenicola marina, causes water flow and the images depict the distribution of a tracer that is carried with the flow. The experimental setup is such that flow is largely two-dimensional, with a localised region where the Arenicola resides, from which flow originates. Here, we propose a novel parametric framework that quantifies such flow that is dominant along the image plane. We adopt a Bayesian framework so that we can impart certain physical constraints on parameters into the estimation process via prior distribution. The primary aim is to approximate the mean of the posterior distribution to present the parameter estimate via Markov Chain Monte Carlo. We demonstrate that the results obtained from the proposed method provide more realistic flows (in terms of divergence magnitude) than those computed from classical approaches such as the multi-resolution Horn–Schunk method. This highlights the usefulness of our approach if motion is largely constrained to the image plane with localised fluid sources.

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.