A First Course in Harmonic Analysis
This book is a primer in harmonic analysis using an elementary approach. Its first aim is to provide an introduction to Fourier analysis, leading up to the Poisson Summation Formula. Secondly, it makes the reader aware of the fact that both, the Fourier series and the Fourier transform, are special cases of a more general theory arising in the context of locally compact abelian groups. The third goal of this book is to introduce the reader to the techniques used in harmonic analysis of noncommutative groups. There are two new chapters in this new edition. One on distributions will complete the set of real variable methods introduced in the first part. The other on the Heisenberg Group provides an example of a group that is neither compact nor abelian, yet is simple enough to easily deduce the Plancherel Theorem.
Related Books
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.
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.
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.
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.
