To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
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.
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 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.
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.
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.
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.
There are no silver bullets in algorithm design, and no single algorithmic idea is powerful and flexible enough to solve every computational problem. Nor are there silver bullets in algorithm analysis, as the most enlightening method for analyzing an algorithm often depends on the problem and the application. However, typical algorithms courses rely almost entirely on a single analysis framework, that of worst-case analysis, wherein an algorithm is assessed by its worst performance on any input of a given size. The purpose of this book is to popularize several alternatives to worst-case analysis and their most notable algorithmic applications, from clustering to linear programming to neural network training. Forty leading researchers have contributed introductions to different facets of this field, emphasizing the most important models and results, many of which can be taught in lectures to beginning graduate students in theoretical computer science and machine learning.
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.
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.
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.