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.
Iterative approximation algorithms are successfully applied in parametric approximation tasks. In particular, reduced basis methods make use of the so-called Greedy algorithm for approximating solution sets of parametrized partial differential equations. Recently, a priori convergence rate statements for this algorithm have been given (Buffa et al. 2009, Binev et al. 2010). The goal of the current study is the extension to time-dependent problems, which are typically approximated using the POD–Greedy algorithm (Haasdonk and Ohlberger 2008). In this algorithm, each greedy step is invoking a temporal compression step by performing a proper orthogonal decomposition (POD). Using a suitable coefficient representation of the POD–Greedy algorithm, we show that the existing convergence rate results of the Greedy algorithm can be extended. In particular, exponential or algebraic convergence rates of the Kolmogorov n-widths are maintained by the POD–Greedy algorithm.
The aim of this paper is to analyze a formulation of the eddy current problem in terms of a time-primitive of the electric field in a bounded domain with input current intensities or voltage drops as source data. To this end, we introduce a Lagrange multiplier to impose the divergence-free condition in the dielectric domain. Thus, we obtain a time-dependent weak mixed formulation leading to a degenerate parabolic problem which we prove is well-posed. We propose a finite element method for space discretization based on Nédélec edge elements for the main variable and standard finite elements for the Lagrange multiplier, for which we obtain error estimates. Then, we introduce a backward Euler scheme for time discretization and prove error estimates for the fully discrete problem, too. Finally, the method is applied to solve a couple of test problems.
We consider here the Interior Penalty Discontinuous Galerkin (IPDG) discretization of the wave equation. We show how to derive the optimal penalization parameter involved in this method in the case of regular meshes. Moreover, we provide necessary stability conditions of the global scheme when IPDG is coupled with the classical Leap–Frog scheme for the time discretization. Numerical experiments illustrate the fact that these conditions are also sufficient.
We propose a modified projected Polak–Ribière–Polyak (PRP) conjugate gradient method, where a modified conjugacy condition and a method which generates sufficient descent directions are incorporated into the construction of a suitable conjugacy parameter. It is shown that the proposed method is a modification of the PRP method and generates sufficient descent directions at each iteration. With an Armijo-type line search, the theory of global convergence is established under two weak assumptions. Numerical experiments are employed to test the efficiency of the algorithm in solving some benchmark test problems available in the literature. The numerical results obtained indicate that the algorithm outperforms an existing similar algorithm in requiring fewer function evaluations and fewer iterations to find optimal solutions with the same tolerance.
Patchy or divided populations can be important to infectious disease transmission. We first show that Lloyd’s mean crowding index, an index of patchiness from ecology, appears as a term in simple deterministic epidemic models of the SIR type. Using these models, we demonstrate that the rate of movement between patches is crucial for epidemic dynamics. In particular, there is a relationship between epidemic final size and epidemic duration in patchy habitats: controlling inter-patch movement will reduce epidemic duration, but also final size. This suggests that a strategy of quarantining infected areas during the initial phases of a virulent epidemic might reduce epidemic duration, but leave the population vulnerable to future epidemics by inhibiting the development of herd immunity.
Endemic infectious diseases constantly circulate in human populations, with prevalence fluctuating about a (theoretical and unobserved) time-independent equilibrium. For diseases for which acquired immunity is not lifelong, the classic susceptible–infectious–recovered–susceptible (SIRS) model provides a framework within which to consider temporal trends in the observed epidemiology. However, in some cases (notably pertussis), sustained multiannual fluctuations are observed, whereas the SIRS model is characterized by damped oscillatory dynamics for all biologically meaningful choices of model parameters. We show that a model that allows for “boosting” of immunity may naturally give rise to undamped oscillatory behaviour for biologically realistic parameter choices. The life expectancy of the population is critical in determining the characteristic dynamics of the system. For life expectancies up to approximately $50$ years, we find that, even with boosting, damped oscillatory dynamics persist. For increasing life expectancy, the system may sustain oscillatory dynamics, or even exhibit bistable behaviour, in which both stable point attractor and limit cycle dynamics may coexist. Our results suggest that rising life expectancy may induce changes in the characteristic dynamics of infections for which immunity is not lifelong, with potential implications for disease control strategies.
Advances in nonlinear dynamics, especially modern multifractal cascade models, allow us to investigate the weather and climate at unprecedented levels of accuracy. Using new stochastic modeling and data analysis techniques, this book provides an overview of the nonclassical, multifractal statistics. By generalizing the classical turbulence laws, emergent higher-level laws of atmospheric dynamics are obtained and are empirically validated over time-scales of seconds to decades and length-scales of millimetres to the size of the planet. In generalizing the notion of scale, atmospheric complexity is reduced to a manageable scale-invariant hierarchy of processes, thus providing a new perspective for modeling and understanding the atmosphere. This synthesis of state-of-the-art data and nonlinear dynamics is systematically compared with other analyses and global circulation model outputs. This is an important resource for atmospheric science researchers new to multifractal theory and is also valuable for graduate students in atmospheric dynamics and physics, meteorology, oceanography and climatology.
Beginning with one of the most remarkable ecological collapses of recent time, that of the passenger pigeon, Hadlock goes on to survey collapse processes across the entire spectrum of the natural and man-made world. He takes us through extreme weather events, technological disasters, evolutionary processes, crashing markets and companies, the chaotic nature of Earth's orbit, revolutionary political change, the spread and elimination of disease, and many other fascinating cases. His key thesis is that one or more of six fundamental dynamics consistently show up across this wide range. These six sources of collapse can all be best described and investigated using fundamental mathematical concepts. They include low probability events, group dynamics, evolutionary games, instability, nonlinearity, and network effects, all of which are explained in readily understandable terms. Almost the entirety of the book can be understood by readers with a minimal mathematical background, but even professional mathematicians are likely to get rich insights from the range of examples. The author tells his story with a warmly personal tone and weaves in many of his own experiences, whether from his consulting career of racing around the world trying to head off industrial disasters to his story of watching collapse after collapse in the evolution of an ecosystem on his New Hampshire farm.
Based on course notes from over twenty years of teaching engineering and physical sciences at Michigan Technological University, Tomas Co's engineering mathematics textbook is rich with examples, applications and exercises. Professor Co uses analytical approaches to solve smaller problems to provide mathematical insight and understanding, and numerical methods for large and complex problems. The book emphasises applying matrices with strong attention to matrix structure and computational issues such as sparsity and efficiency. Chapters on vector calculus and integral theorems are used to build coordinate-free physical models with special emphasis on orthogonal co-ordinates. Chapters on ODEs and PDEs cover both analytical and numerical approaches. Topics on analytical solutions include similarity transform methods, direct formulas for series solutions, bifurcation analysis, Lagrange–Charpit formulas, shocks/rarefaction and others. Topics on numerical methods include stability analysis, DAEs, high-order finite-difference formulas, Delaunay meshes, and others. MATLAB® implementations of the methods and concepts are fully integrated.