: Pierre L` Ecuyer, Art B. Owen
: Pierre L' Ecuyer, Art B. Owen
: Monte Carlo and Quasi-Monte Carlo Methods 2008
: Springer-Verlag
: 9783642041075
: 1
: CHF 134.60
:
: Arithmetik, Algebra
: English
: 672
: Wasserzeichen
: PC/MAC/eReader/Tablet
: PDF
T is book represents the refereed proceedings of the Eighth International Conference on Monte Carlo (MC)and Quasi-Monte Carlo (QMC) Methods in Scientific Computing, held in Montreal (Canada) in July 2008. It covers the latest theoretical developments as well as important applications of these methods in different areas. It contains two tutorials, eight invited articles, and 32 carefully selected articles based on the 135 contributed presentations made at the conference. This conference is a major event in Monte Carlo methods and is the premiere event for quasi-Monte Carlo and its combination with Monte Carlo. This series of proceedings volumes is the primary outlet for quasi-Monte Carlo research.
Preface5
Contents8
Part I Tutorials12
Monte Carlo and Quasi-Monte Carlo for Statistics13
Introduction13
The Bootstrap14
Permutation Tests18
MCMC21
Least Trimmed Squares23
Other Methods26
References26
Monte Carlo Computation in Finance29
Introduction29
Overview of Financial Simulation Problems30
Financial Simulations in Context33
Multiple Simulation Problems35
Variance Reduction38
Risk Management42
Financial Optimization Problems43
Sensitivity Analysis44
Discretization of Stochastic Differential Equations46
References48
Part II Invited Articles53
Particle Markov Chain Monte Carlo for Efficient Numerical Simulation54
Introduction54
Sequential Monte Carlo Methods55
Particle Independent MH Sampler58
Algorithm59
Extended Proposal and Target Distributions59
Structure of the Invariant Distribution and Alternative Algorithm61
Using All the Particles62
Particle Marginal MH Sampler and Particle Gibbs Sampler62
Particle Marginal MH Sampler63
Particle Gibbs Sampler64
Extensions and Discussion65
Application to Markov Jump Processes66
Conclusion67
References69
Computational Complexity of Metropolis-Hastings Methods in High Dimensions70
Introduction70
Structure of the Target71
Product Target71
Beyond the Product Structure71
Computational Complexity73
The Algorithms74
Complexity75
A Special Result: Diffusion Limit76
Open Questions78
References80
On Quasi-Monte Carlo Rules Achieving Higher Order Convergence81
Introduction81
Higher Order Convergence for Smooth Periodic Functions Using Lattice Rules84
Lattice Rules84
Decay of the Fourier Coefficients of Smooth Periodic Functions84
Numerical Integration85
Preliminaries86
The Digital Construction Scheme86
Walsh Functions87
Higher Order Convergence of Smooth Functions Using Generalized Digital Nets88
Decay of the Walsh Coefficients of Smooth Functions88
Numerical Integration90
Generalized Digital Nets91
Construction of Generalized Digital Nets93
Geometrical Properties of Generalized Digital Nets95
Geometrical Numerical Integration98
References103
Sensitivity Estimates for Compound Sums105
Introduction105
Motivating Applications107
Lévy Processes107
Stochastic Volatility and Squared Bessel Bridges108
Locally Continuous Construction109
Application to the Squared Bessel Bridge116
Globally Continuous Construction118
Concluding Remarks120
References120
New Perspectives on (0,s)-Sequences121
Introduction121
Background Information122
Framework of Generalized Niederreiter Sequences126
New Efficient Scramblings of (0,s)-Sequences128
A Construction Extensible in the Dimension--GF3130
Numerical Results131
Conclusion135
References136
Variable Subspace Sampling and Multi-level Algorithms139
Introduction139
Multi-level Algorithms141
A Cost Model for Variable Subspace Sampling145
Analysis of the Multi-level Algorithm148
General Results148
Lipschitz Continuous Integrands151
Minimal Errors in Different Cost Models156
Optimal Quadrature of Lipschitz Functionals157
Gaussian Measures158
Diffusion Processes160
Concluding Remarks162
References163
Markov Chain Monte Carlo Algorithms: Theory and Practice165
Introduction165
Asymptotic Convergence166
Quantitative Convergence Bounds167
Minorisation Conditions (Small Sets)168
Drift Conditions168
An Explicit Convergence Bound169
A 20-Dimensional Example169
Adaptive MCMC171
A Toy Example171
An Adaptive MCMC Convergence Theorem172
A 100-Dimensional Example173
Connection with QMC?174
Summary175
References176
MinT -- New Features and New Results178
Introduction178
Basic Notations and Concepts179
New Features in MinT183
New Nets based on OOA Propagation Rules188
A Generalized Matrix-Product Construction for Generalized Codes191
References195
Part III Contributed Articles197
Recursive Computation of Value-at-Risk and Conditional Value-at-Risk using MC and QMC198
Introduction199
Design of the VaR-CVaR Stochastic Approximation Algorithm201
Devise of a VaR-CVaR Procedure (First Phase)201
Variance Reduction Using Adaptive Recursive Importance Sampling (Final Phase)204
Quasi-Stochastic Approximation210
Numerical Illustrations211
References213
Adaptive Monte Carlo Algorithms Applied to Heterogeneous Transport Problems214
Introductio