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.
In this paper, we derive simple analytical bounds for solutions of $x - \ln x = y -\ln y$, and use them for estimating trajectories following Lotka–Volterra-type integrals. We show how our results give estimates for the Lambert W function as well as for trajectories of general predator–prey systems, including, for example, Rosenzweig–MacArthur equations.
This study explores the dynamics of a simple mechanical oscillator involving a magnet on a spring constrained to an axis; this magnet is additionally subject to the attractive force from a second magnet, which is placed on a parallel offset axis. The moments of both magnets remain aligned. The dynamics of the first magnet is first analysed in isolation for an unforced situation in which the second magnet is static and its position is taken as a parameter. We find codimension-1 saddle-node bifurcations, as well as a codimension-2 cusp bifurcation. The system has a region of bistability which increases in size with increasing force ratio. Next, the parametrically forced situation is considered, in which the second magnet moves sinusoidally. A comprehensive analysis of the forced oscillator behaviour is presented from the dynamical-systems standpoint. The solutions are shown to include periodic, quasiperiodic and chaotic trajectories. Resonances are shown to exist and the effect of weak damping is explored. Layered stroboscopic maps are used to produce cross-sections of the chaotic attractor as the parametric forcing frequency is varied. The strange attractor is found to disappear for a narrow window of forcing frequencies near the natural frequency of the spring.
While constructing mathematical models, scientists usually consider biotic factors, but it is crystal-clear that abiotic factors, such as wind, are also important as biotic factors. From this point of view, this paper is devoted to the investigation of some bifurcation properties of a fractional-order prey–predator model under the effect of wind. Using fractional calculus is very popular in modelling, since it is more effective than classical calculus in predicting the system’s future state and also discretization is one of the most powerful tools to study the behaviour of the models. In this paper, first of all, the model is discretized by using a piecewise discretization approach. Then, the local stability of fixed points is considered. We show using the centre manifold theorem and bifurcation theory that the system experiences a flip bifurcation and a Neimark–Sacker bifurcation at a positive fixed point. Finally, numerical simulations are given to demonstrate our results.
We conduct a theoretical analysis of the performance of $\beta $-encoders. The $\beta $-encoders are A/D (analogue-to-digital) encoders, the design of which is based on the expansion of real numbers with noninteger radix. For the practical use of such encoders, it is important to have theoretical upper bounds of their errors. We investigate the generating function of the Perron–Frobenius operator of the corresponding one-dimensional map and deduce the invariant measure of it. Using this, we derive an approximate value of the upper bound of the mean squared error of the quantization process of such encoders. We also discuss the results from a numerical viewpoint.
We are concerned with the micro-macro Parareal algorithm for the simulation of initial-value problems. In this algorithm, a coarse (fast) solver is applied sequentially over the time domain and a fine (time-consuming) solver is applied as a corrector in parallel over smaller chunks of the time interval. Moreover, the coarse solver acts on a reduced state variable, which is coupled with the fine state variable through appropriate coupling operators. We first provide a contribution to the convergence analysis of the micro-macro Parareal method for multiscale linear ordinary differential equations. Then, we extend a variant of the micro-macro Parareal algorithm for scalar stochastic differential equations (SDEs) to higher-dimensional SDEs.
This study aims to formulate a highly accurate numerical method, specifically a seventh-order Hermite technique with an error term of sixth order, to solve the Fisher and Burgers–Fisher equations. This technique employs a combination of orthogonal collocation on the finite element method and hepta Hermite basis functions. By ensuring continuity of the dependent variable and its first three derivatives across the entire solution domain, it achieves a remarkable level of accuracy and smoothness. The space discretization is handled through the application of hepta Hermite polynomials, while the time discretization is managed by the Crank–Nicholson scheme. The stability and convergence analysis of the scheme are discussed in detail. To validate the accuracy of the proposed technique, three examples are taken. The results obtained from these examples are thoroughly analysed and compared against the exact solutions and reliable data from the existing literature. It is established that the proposed technique is easy to implement and gives better results as compared with existing ones.
Conformal image registration has always been an area of interest among modern researchers, particularly in the field of medical imaging. The idea of image registration is not new. In fact, it was coined nearly 100 years ago by the pioneer D’Arcy Wentworth Thompson, who conjectured the idea of image registration among the biological forms. According to him, several images of different species are related by a conformal transformations. Thompson’s examples motivated us to explore his claim using image registration. In this paper, we present a conformal image registration (for the two-dimensional grey scaled images) along with a penalty term. This penalty term, which is based on the Cauchy–Riemann equations, aims to enforce the conformality.
This chapter covers the basics from real analysis to linear algebra and the theory of computation that is foundational for the rest of the book. A careful discussion of different models of computation is taken up, which discusses several issues that are often ignored in other presentations of optimization theory and algorithms.
A careful exposition of the conceptual underpinnings of algorithmic or computational optimization is presented. Computation in continuous optimization has its origins in the traditions of scientific computing and numerical analysis, whereas discrete optimization broadly views computation via the Turing machine model. The different views lead to some friction. In the continuous world, one often designs algorithms assuming one can perform exact operations with real numbers (consider, for example, Newton’s method), which is impossible in the Turing machine model. In the discrete world, the “input" to a Turing machine becomes a tricky question when dealing with general nonlinear functions and sets. The question of “complexity" of an optimization algorithm is also treated in somewhat different ways in the two communities. This chapter, combined with the careful discussion of computation models in Chapter 1, shows how all these issues can be handled in a unified, coherent way making no distinction whatsoever between "continuous" and "discrete" optimization.
This chapter deals with the important question of certifying optimality of a solution to a mixed-integer convex optimization problem. The classical duality theory for continuous optimization, including Lagrangian relaxations, KKT and general optimality conditions, and Slater type conditions for strong duality, is rigorously covered in complete detail. Recent work on duality for mixed-integer convex optimization is succinctly summarized.
In the early part of the 20th century, Hermann Minkowski developed a novel geometric approach to several questions in number theory. This approach developed into a field called the geometry of numbers and it had an influence on fields outside number theory as well, particularly functional analysis and the study of Banach spaces, and more recently on cryptography and discrete optimization. This chapter covers those aspects of the geometry of numbers that are most relevant for the second part of the book on optimization. Topics include the basic theory of lattices (including Minkowski’s convex body theorem), packing and covering radii, shortest and closest lattice vector problems (SVPs and CVPs), Dirichlet-Voronoi cells, Khinchine’s flatness theorem, and maximal lattice-free convex sets. Several topics like lattice basis reduction and SVP/CVP algorithms are presented without making a rationality assumption as is common in other expositions. This presents a slightly more general perspective on these topics that contains the rational setting as a special case.
This chapter introduces the concept of a convex function and develops the basic theory of convex functions. Standard continuity and differentiability properties are established. Fundamental notions like subgradients and subdifferentials are introduced and their properties are investigated in detail. Sublinear functions get particular focus, given their recent importance in optimization theory and practice. Some new results on sublinear functions that have never before appeared outside specialized research articles are presented with clean, textbook-style proofs. Elementary Brunn-Minkowski theory is covered, including important consequences like the concavity principle and the Rogers-Shepard inequality.
This chapter introduces the fundamental notion of a convex set. It establishes basic structural properties of convex sets, illustrated via examples throughout. The chapter gives equal emphasis on the analytic as well as discrete or combinatorial aspects of convexity. Topics include foundational results like the Separating and Supporting Hyperplane theorems, polarity, the combinatorial theorems of Caratheodory, Radon and Helly, and the basic theory of polyhedra and ellipsoids.