Difference Equations : From Rabbits to Chaos

Difference Equations : From Rabbits to Chaos


Difference equations are models of the world around us. From clocks to computers to chromosomes, processing discrete objects in discrete steps is a common theme. Difference equations arise naturally from such discrete descriptions and allow us to pose and answer such questions as: How much? How many? How long? Difference equations are a necessary part of the mathematical repertoire of all modern scientists and engineers.The book cover the basics of difference equations and some of their applications in computing and in population biology. Each chapter leads to techniques that can be applied by hand to small examples or programmed for larger problems. Along the way, the reader will use linear algebra and graph theory, develop formal power series, solve combinatorial problems, visit Perron—Frobenius theory, discuss pseudorandom number generation and integer factorization, and apply the Fast Fourier Transform to multiply polynomials quickly.



Related Books

img

Malliavin Calculus for Lévy Processes with Applications to Finance

While the original works on Malliavin calculus aimed to study the smoothness of densities of solutions to stochastic differential equations, this book has another goal. It portrays the most important and innovative applications in stochastic control and finance, such as hedging in complete and incomplete markets, optimisation in the presence of asymmetric information and also pricing and sensitivity analysis. In a self-contained fashion, both the Malliavin calculus with respect to Brownian motion and general Lévy type of noise are treated. Besides, forward integration is included and indeed extended to general Lévy processes. The forward integration is a recent development within anticipative stochastic calculus that, together with the Malliavin calculus, provides new methods for the study of insider trading problems.

img

Basic Probability Theory with Applications

This book presents elementary probability theory with interesting and well-chosen applications that illustrate the theory. An introductory chapter reviews the basic elements of differential calculus which are used in the material to follow. The theory is presented systematically, beginning with the main results in elementary probability theory. This is followed by material on random variables. Random vectors, including the all important central limit theorem, are treated next. The last three chapters concentrate on applications of this theory in the areas of reliability theory, basic queuing models, and time series. Examples are elegantly woven into the text and over 400 exercises reinforce the material and provide students with ample practice.

img

Numerical solution of Variational Inequalities by Adaptive Finite Elements

Franz-Theo Suttmeier describes a general approach to a posteriori error estimation and adaptive mesh design for finite element models where the solution is subjected to inequality constraints. This is an extension to variational inequalities of the so-called Dual-Weighted-Residual method (DWR method) which is based on a variational formulation of the problem and uses global duality arguments for deriving weighted a posteriori error estimates with respect to arbitrary functionals of the error. In these estimates local residuals of the computed solution are multiplied by sensitivity factors which are obtained from a numerically computed dual solution. The resulting local error indicators are used in a feed-back process for generating economical meshes which are tailored according to the particular goal of the computation.

img

Numerical Methods for Controlled Stochastic Delay Systems

The Markov chain approximation methods are widely used for the numerical solution of nonlinear stochastic control problems in continuous time. This book extends the methods to stochastic systems with delays. Because such problems are infinite-dimensional, many new issues arise in getting good numerical approximations and in the convergence proofs. Useful forms of numerical algorithms and system approximations are developed in this work, and the convergence proofs are given. All of the usual cost functions are treated as well as singular and impulsive controls. A major concern is on representations and approximations that use minimal memory.