E-Book, Englisch, 384 Seiten
Meerschaert Mathematical Modeling
4. Auflage 2013
ISBN: 978-0-12-386996-8
Verlag: Elsevier Science & Techn.
Format: EPUB
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
E-Book, Englisch, 384 Seiten
ISBN: 978-0-12-386996-8
Verlag: Elsevier Science & Techn.
Format: EPUB
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
Mark M. Meerschaert is Chairperson of the Department of Statistics and Probability at Michigan State University and Adjunct Professor in the Department of Physics at the University of Nevada, having previously worked in government and industry roles on a wide variety of modeling projects. Holding a doctorate in Mathematics from the University of Michigan, Professor Meerschaert's expertise spans the areas of probability, statistics, statistical physics, mathematical modeling, operations research, partial differential equations, and hydrology. In addition to his current appointments, he has taught at the University of Michigan, Albion College, and the University of Otago, New Zealand. His current research interests include limit theorems and parameter estimation for infinite variance probability models, heavy tail models in finance, modeling river flows with heavy tails and periodic covariance structure, anomalous diffusion, continuous time random walks, fractional derivatives and fractional partial differential equations, and ground water flow and transport. For more, see http://www.stt.msu.edu/-mcubed
Autoren/Hrsg.
Weitere Infos & Material
1;Front Cover;1
2;Mathematical Modeling;4
3;Copyright
;5
4;Contents;6
5;Preface;8
6;Part I: Optimization Models;14
6.1;Chapter 1: One Variable Optimization;16
6.1.1;1.1 The five-step Method;16
6.1.2;1.2 Sensitivity Analysis;22
6.1.3;1.3 Sensitivity and Robustness;27
6.1.4;1.4 Exercises;29
6.1.5;Further Reading;32
6.2;Chapter 2: Multivariable Optimization;34
6.2.1;2.1 Unconstrained Optimization;34
6.2.2;2.2 Lagrange Multipliers;44
6.2.3;2.3 Sensitivity Analysis and Shadow Prices;54
6.2.4;2.4 Exercises;63
6.2.5;Further Reading;68
6.3;Chapter 3: Computational Methods For Optimization;70
6.3.1;3.1 One Variable Optimization;70
6.3.2;3.2 Multivariable Optimization;79
6.3.3;3.3 Linear Programming;87
6.3.4;3.4 Discrete Optimization;104
6.3.5;3.5 Exercises;115
6.3.6;Further Reading;124
7;Part II: Dynamic Models;126
7.1;Chapter 4: Introduction to Dynamic Models;128
7.1.1;4.1 Steady State Analysis;128
7.1.2;4.2 Dynamical Systems;133
7.1.3;4.3 Discrete Time Dynamical Systems;139
7.1.4;4.4 Exercises;145
7.1.5;Further Reading;150
7.2;Chapter 5: Analysis of Dynamic Models;152
7.2.1;5.1 Eigenvalue Methods;152
7.2.2;5.2 Eigenvalue Methods for Discrete Systems;157
7.2.3;5.3 Phase Portraits;163
7.2.4;5.4 Exercises;177
7.2.5;Further Reading;182
7.3;Chapter 6: Simulation of Dynamic Models;184
7.3.1;6.1 Introduction to Simulation;184
7.3.2;6.2 Continuous–Time Models;191
7.3.3;6.3 The Euler Method;199
7.3.4;6.4 Chaos and Fractals;204
7.3.5;6.5 Exercises;219
7.3.6;Further Reading;232
8;Part III: Probability Models;234
8.1;Chapter 7: Introduction to Probability Models;236
8.1.1;7.1 Discrete Probability Models;236
8.1.2;7.2 Continuous Probability Models;241
8.1.3;7.3 Introduction to Statistics;244
8.1.4;7.4 Diffusion;249
8.1.5;7.5 Exercises;254
8.1.6;Further Reading;263
8.2;Chapter 8: Stochastic Models;264
8.2.1;8.1 Markov Chains;264
8.2.2;8.2 Markov Processes;274
8.2.3;8.3 Linear Regression;284
8.2.4;8.4 Time Series;293
8.2.5;8.5 Exercises;303
8.2.6;Further Reading;312
8.3;Chapter 9: Simulation of Probability Models;314
8.3.1;9.1 Monte Carlo Simulation;314
8.3.2;9.2 The Markov Property;321
8.3.3;9.3 Analytic Simulation;330
8.3.4;9.4 Particle Tracking;336
8.3.5;9.5 Fractional Diffusion;348
8.3.6;9.6 Exercises;360
8.3.7;Further Reading;370
9;Afterword;372
10;Index
;376
Preface
Mark M. Meerschaert, Department of Statistics and Probability, Michigan State University, C430 Wells Hall, East Lansing, MI 48824-1027 USA, Phone: (517) 353-8881, Fax: (517) 432-1405, mcubed@stt.msu.edu http://www.stt.msu.edu/users/mcubed
Mathematical modeling is the link between mathematics and the rest of the world. You ask a question. You think a bit, and then you refine the question, phrasing it in precise mathematical terms. Once the question becomes a mathematics question, you use mathematics to find an answer. Then finally (and this is the part that too many people forget), you have to reverse the process, translating the mathematical solution back into a comprehensible, no-nonsense answer to the original question. Some people are fluent in English, and some people are fluent in calculus. We have plenty of each. We need more people who are fluent in both languages and are willing and able to translate. These are the people who will be influential in solving the problems of the future.
This text, which is intended to serve as a general introduction to the area of mathematical modeling, is aimed at advanced undergraduate or beginning graduate students in mathematics and closely related fields. Formal prerequisites consist of the usual freshman-sophomore sequence in mathematics, including one-variable calculus, multivariable calculus, linear algebra, and differential equations. Prior exposure to computing and probability and statistics is useful, but is not required.
Unlike some textbooks that focus on one kind of mathematical model, this book covers the broad spectrum of modeling problems, from optimization to dynamical systems to stochastic processes. Unlike some other textbooks that assume knowledge of only a semester of calculus, this book challenges students to use of the mathematics they know (because that is what it takes to solve real problems).
The overwhelming majority of mathematical models fall into one of three categories: optimization models; dynamic models; and probability models. The type of model used in a real application might be dictated by the problem at hand, but more often, it is a matter of choice. In many instances, more than one type of model will be used. For example, a large Monte Carlo simulation model may be used in conjunction with a smaller, more tractable deterministic dynamic model based on expected values.
This book is organized into three parts, corresponding to the three main categories of mathematical models. We begin with optimization models. A five-step method for mathematical modeling is introduced in Section 1 of Chapter 1, in the context of one-variable optimization problems. The remainder of the first chapter is an introduction to sensitivity analysis and robustness. These fundamentals of mathematical modeling are used in a consistent way throughout the rest of the book. Exercises at the end of each chapter require students to master them as well. Chapter 2, on multivariable optimization, introduces decision variables, feasible and optimal solutions, and constraints. A review of the method of Lagrange multipliers is provided for the benefit of those students who were not exposed to this important technique in multivariable calculus. In the section on sensitivity analysis for problems with constraints, we learn that Lagrange multipliers represent shadow prices (some authors call them dual variables). This sets the stage for our discussion of linear programming later in Chapter 3. At the end of Chapter 3 is a section on discrete optimization that was added in the second edition. Here we give a practical introduction to integer programming using the branch-and-bound method. We also explore the connection between linear and integer programming problems, which allows an earlier introduction to the important issue of discrete versus continuous models. Chapter 3 covers some important computational techniques, including Newton’s method in one and several variables, and linear and integer programming.
In the next part of the book, on dynamic models, students are introduced to the concepts of state and equilibrium. Later discussions of state space, state variables, and equilibrium for stochastic processes are intimately connected to what is done here. Nonlinear dynamical systems in both discrete and continuous time are covered. There is very little emphasis on exact analytical solutions in this part of the book, since most of these models admit no analytic solution. At the end of Chapter 6 is a section on chaos and fractals that was added in the second edition. We use both analytic and simulation methods to explore the behavior of discrete and continuous dynamic models, to understand how they can become chaotic under certain conditions. This section provides a practical and accessible introduction to the subject. Students gain experience with sensitive dependence to initial conditions, period doubling, and strange attractors that are fractal sets. Most important, these mathematical curiosities emerge from the study of real-world problems.
Finally, in the last part of the book, we introduce probability models. No prior knowledge of probability is assumed. Instead we build upon the material in the first two parts of the book, to introduce probability in a natural and intuitive way as it relates to real-world problems. Chapter 7 introduces the basic notions of random variables, probability distributions, the strong law of large numbers, and the central limit theorem. At the end of Chapter 7, Introduction to Probability Models, is a section on diffusion, which was added in the third edition. Here we give a gentle introduction to partial differential equations by focusing on the diffusion equation. We provide a simple derivation of the point source solution to this partial differential equation, using Fourier transforms, to arrive at the normal density. Then we connect the diffusion model to the central limit theorem introduced in the previous Section 7.3, Introduction to Statistics. This new section on diffusion grew out of a class taught at the University of Nevada for beginning graduate students in the earth sciences. The applications are to contaminant migration in the atmosphere and ground water. Chapter 8 covers the basic models of stochastic processes, including Markov chains, Markov processes, and linear regression. At the end of Chapter 8, Stochastic Models, a new section on time series was added in the third edition. This section also serves as an introduction to multivariate regression models with more than one predictor. As a natural follow-up to the discussion in Section 8.3, Linear Regression, the new section on time series introduces the important idea of correlation. It also shows how to recognize correlated variables and include the dependence structure in a time series model. The discussion is focused on autoregressive models, since these are the most generally useful time series models. They are also the most convenient, in that they can be handled using widely available linear regression software. For the benefit of students with access to a statistical package, this section illustrates the proper application and interpretation of advanced methods including autocorrelation plots and sequential sums of squares. However, the entire section can also be covered using only a basic implementation of regression that allows multiple predictors and outputs the two basic measures: 2 and the residual standard deviation s. This can all be done with a good spreadsheet or hand calculator. Chapter 9 treats simulation methods for stochastic models. The Monte Carlo method is introduced, and Markov property is applied to create efficient simulation algorithms. Analytic simulation methods are also explored, and compared to the Monte Carlo method. In the fourth edition, two new sections were added to the end of Chapter 9. The first new section covers particle tracking methods, for solving partial differential equations via Monte carlo simulation of the underlying stochastic process. The final section of the book introduces fractional calculus in the context of anomalous diffusion. The fractional diffusion equation is solved by particle tracking, and applied to a problem in ground water pollution. This section ties together the concepts of fractals, fractional derivatives, and probability distributions with heavy tails.
Each chapter in this book is followed by a set of challenging exercises. These exercises require significant effort, as well as a certain amount of creativity, on the part of the student. I did not invent the problems in this book. They are real problems. They were not designed to illustrate the use of any particular mathematical technique. Quite the opposite. We will occasionally go over some new mathematical techniques in this book . I was determined that there would be no place in this book where a student could look up and ask, "What is all of this for?" Although typically oversimplified or grossly unrealistic, story problems embody the fundamental challenge in applying mathematics to solve real problems. For most students, story problems present plenty of challenge. This book teaches students how to solve story problems. There is a general method that can be applied successfully by any reasonably capable student to solve any story problem. It appears in Chapter 1, Section 1. This same general method is applied to problems of all kinds throughout the text.
Following the exercises in each chapter is a list of suggestions for further reading. This list includes references to a number of UMAP modules in applied mathematics that are...




