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 present an extension of vendor-managed inventory (VMI) problems by considering advertising and pricing policies. Unlike the results available in the literature, the demand is supposed to depend on the retail price and advertising investment policies of the manufacturer and retailers, and is a random variable. Thus, the constructed optimization model for VMI supply chain management is a stochastic bi-level programming problem, where the manufacturer is the upper level decision-maker and the retailers are the lower-level ones. By the expectation method, we first convert the stochastic model into a deterministic mathematical program with complementarity constraints (MPCC). Then, using the partially smoothing technique, the MPCC is transformed into a series of standard smooth optimization subproblems. An algorithm based on gradient information is developed to solve the original model. A sensitivity analysis has been employed to reveal the managerial implications of the constructed model and algorithm: (1) the market parameters of the model generate significant effects on the decision-making of the manufacturer and the retailers, (2) in the VMI mode, much attention should be paid to the holding and shortage costs in the decision-making.
Developed from three decades' worth of lecture notes which the author used to teach at the Massachusetts Institute of Technology, this unique textbook presents a comprehensive treatment of structural dynamics and mechanical vibration. The chapters in this book are self-contained so that instructors can choose to be selective about which topics they teach. Written with an application-based focus, the text covers topics such as earthquake engineering, soil dynamics, and relevant numerical methods techniques that use MATLAB. Advanced topics such as the Hilbert transform, gyroscope forces, and spatially periodic structures are also treated extensively. Concise enough for an introductory course yet rigorous enough for an advanced or graduate-level course, this textbook is also a useful reference manual - even after the final exam - for professional and practicing engineers.
Finding the intersection of $n$-dimensional spheres in $\mathbb{R}^{n}$ is an interesting problem with applications in trilateration, global positioning systems, multidimensional scaling and distance geometry. In this paper, we generalize some known results on finding the intersection of spheres, based on QR decomposition. Our main result describes the intersection of any number of $n$-dimensional spheres without the assumption that the centres of the spheres are affinely independent. A possible application in the interval distance geometry problem is also briefly discussed.
We provide a qualitative analysis of a system of nonlinear differential equations that model the spread of alcoholism through a population. Alcoholism is viewed as an infectious disease and the model treats it within a sir framework. The model exhibits two generic types of steady-state diagram. The first of these is qualitatively the same as the steady-state diagram in the standard sir model. The second exhibits a backwards transcritical bifurcation. As a consequence of this, there is a region of bistability in which a population of problem drinkers can be sustained, even when the reproduction number is less than one. We obtain a succinct formula for this scenario when the transition between these two cases occurs.
Mealybug is an important pest of cassava plant in Thailand and tropical countries, leading to severe damage of crop yield. One of the most successful controls of mealybug spread is using its natural enemies such as green lacewings, where the development of mathematical models forecasting mealybug population dynamics improves implementation of biological control. In this work, the Sharpe–Lotka–McKendrick equation is extended and combined with an integro-differential equation to study population dynamics of mealybugs (prey) and released green lacewings (predator). Here, an age-dependent formula is employed for mealybug population. The solutions and the stability of the system are considered. The steady age distributions and their bifurcation diagrams are presented. Finally, the threshold of the rate of released green lacewings for mealybug extermination is investigated.
Semi-analytical solutions are derived for the Brusselator system in one- and two-dimensional domains. The Galerkin method is processed to approximate the governing partial differential equations via a system of ordinary differential equations. Both steady-state concentrations and transient solutions are obtained. Semi-analytical results for the stability of the model are presented for the identified critical parameter value at which a Hopf bifurcation occurs. The impact of the diffusion coefficients on the system is also considered. The results show that diffusion acts to stabilize the systems better than the equivalent nondiffusive systems with the increasing critical value of the Hopf bifurcation. Comparison between the semi-analytical and numerical solutions shows an excellent agreement with the steady-state transient solutions and the parameter values at which the Hopf bifurcations occur. Examples of stable and unstable limit cycles are given, and Hopf bifurcation points are shown to confirm the results previously calculated in the Hopf bifurcation map. The usefulness and accuracy of the semi-analytical results are confirmed by comparison with the numerical solutions of partial differential equations.
A direct search quasi-Newton algorithm is presented for local minimization of Lipschitz continuous black-box functions. The method estimates the gradient via central differences using a maximal frame around each iterate. When nonsmoothness prevents progress, a global direction search is used to locate a descent direction. Almost sure convergence to Clarke stationary point(s) is shown, where convergence is independent of the accuracy of the gradient estimates. Numerical results show that the method is effective in practice.
A numerical comparison of the Monte Carlo (MC) simulation and the finite-difference method for pricing European options under a regime-switching framework is presented in this paper. We consider pricing options on stocks having two to four volatility regimes. Numerical results show that the MC simulation outperforms the Crank–Nicolson (CN) finite-difference method in both the low-frequency case and the high-frequency case. Even though both methods have linear growth, as the number of regimes increases, the computational time of CN grows much faster than that of MC. In addition, for the two-state case, we propose a much faster simulation algorithm whose computational time is almost independent of the switching frequency. We also investigate the performances of two variance-reduction techniques: antithetic variates and control variates, to further improve the efficiency of the simulation.
We prove that the probability substitution matrices obtained from a continuous-time Markov chain form a multiplicatively closed set if and only if the rate matrices associated with the chain form a linear space spanning a Lie algebra. The key original contribution we make is to overcome an obstruction, due to the presence of inequalities that are unavoidable in the probabilistic application, which prevents free manipulation of terms in the Baker–Campbell–Haursdorff formula.
This book has been in preparation for over a decade. Hassan Aref and I had been making substantial additions and revisions each year, in our desire to reach the perfect book for a first course in Computational Fluid Dynamics (CFD). I sincerely wish that we had completed the book a few years ago, so that Hassan was there when the book was published. Unfortunately this was not the case. September 9th 2011 was a tragic day for fluid mechanics. We lost an intellectual leader, a fearless pioneer and for me an inspirational mentor. It is quite amazing how my academic career intersected with Hassan's over the years. He was my Masters Thesis advisor at Brown University. But when Hassan left for the University of California at San Diego, I decided to stay and finish my PhD at Brown. A few years later, when I was an assistant professor at the Theoretical and Applied Mechanics Department at the University of Illinois at Urbana– Champaign, he was appointed as the head of the department. This is when he asked me to join him in this project of writing a non-traditional introductory book on CFD. The project was delayed when Hassan moved to Virginia Tech as the Dean and I moved to the University of Florida as the Chair of the Mechanical and Aerospace Engineering Department. His passing away a few years ago made me all the more determined to finish the book as a way to honor his memory. I am very glad that the book is now finished and can be a monument to his far-sighted vision. Decades ago when CFD was in its infancy he foresaw how powerful computers and numerical methods would dominate the field of fluid mechanics.
Hassan and I shared a vision for this book. Our objective was to write something that would introduce CFD from the perspective of exploring and understanding the fascinating aspects of fluid flows. We wanted to target senior undergraduate students and beginning graduate students. We envisioned the student to have already taken a first level course in fluid mechanics and to be familiar with the mathematical foundations of differential equations.
In the previous chapter we considered initial value ODEs, where the interest was in the computation of time evolution of one or more variables given their starting value at some initial time. There is no inherent upper time limit in integrating these initial value ODEs. Therefore numerical methods for their solution must be capable of accurate and stable long time integration. By contrast, in the case of two-point boundary value and eigenvalue problems for ODEs arising in fluid mechanics, the independent space variable has two well-defined end points with boundary conditions specified at both ends. The spatial domain between the two boundary points can be infinite, as in the case of Blasius boundary layer: see (1.6.5), where the spatial domain extends from the wall (η = 0) out to infinity (η → ∞). For such a problem it is possible to treat the space variable much like time in an initial value problem, and proceed with integration from one boundary to the other and then subsequently verify the boundary conditions at the other end. We shall consider numerical methods of this sort in the next chapter.
An alternative approach is to discretize the entire domain between the two boundaries into a finite number of grid points and to approximate the dependent variables by their grid point values. This leads to a system of equations that can be solved simultaneously. Much like the time integration error considered in the previous chapter, here one encounters a discretization error. The discretization error arises from several sources: interpolation errors arise from approximating the function between grid points; differentiation errors arise in the approximation of first-, second- and higher-order derivatives; and integration errors arise from the numerical integration of a function based on its discretized values at the grid points. These errors are indeed interrelated and depend on the discretization scheme. This chapter will consider various discretization schemes. In particular, discrete approximations to the first- and second-derivative operators will be obtained. Errors arising from the different discretization schemes will be considered. The concept of discrete approximation to the first and second derivatives as matrix operators will be introduced. Finally, we will consider spatial discretization as a means to numerically integrate functions. The actual solution methodologies for two-point boundary value and eigenvalue problems for ODEs, using the tools developed in this chapter, are treated in Chapter 5.
We will begin this chapter with a discussion of two-point boundary value ODEs and then move on to two-point eigenvalue problems. The Blasius equation in Example 1.6.4 is one of the most celebrated two-point boundary value problems in fluid dynamics. Two-point boundary value problems form a challenging class of numerical computations with a wide literature. For an exposition of the theoretical ideas on two-point boundary value problems see Press et al. (1986), Chapter 16, or Keller (1968). Broadly speaking there are two classes of methods for such problems, shooting methods and relaxation methods. Shooting methods are related to integration schemes for initial value problems, while relaxation methods are based on discrete approximations to derivative operators. Thus, we are ready to tackle both these methods. In a shooting method you start from one end as in an initial value calculation using the actual boundary conditions specified at that boundary supplemented with a few other assumed (or guessed) ones which replace the actual boundary conditions of the ODE specified at the other end, and integrate (or “shoot”) towards the other boundary. In general when you eventually reach the other boundary, the boundary conditions there will not be satisfied (in other words you “miss” the target). Hence, you modify your guessed boundary conditions at the starting boundary (“aim” again) and integrate forward (“shoot” again). In this way you have in effect generated a mapping of initially guessed boundary conditions onto errors in matching the actual boundary conditions to be enforced at the other end point. Iterative procedures can now be invoked to converge to the desired value of the boundary conditions at the other end.
In a relaxation method you write the ODE(s) as a system of finite difference equations, guess a solution, and then iteratively improve it by using a root finding procedure for a system of coupled nonlinear equations. This can obviously be a rather formidable task. Often a good initial guess is needed to converge towards the correct answer. Press et al. (1986) give the whimsical recommendation for dealing with two-point boundary value problems to “shoot first and relax later.” As we shall see below, in most problems of interest in fluid dynamics the relaxation method is very powerful, exhibiting rapid convergence towards the correct answer. Furthermore, unlike the shooting method, the relaxation method is easily extendible to boundary value problems in multi-dimensions.