Results 1  10
of
107
Parallel Computation of Multivariate Normal Probabilities
"... We present methods for the computation of multivariate normal probabilities on parallel/ distributed systems. After a transformation of the initial integral, an approximation can be obtained using MonteCarlo or quasirandom methods. We propose a metaalgorithm for asynchronous sampling methods and d ..."
Abstract

Cited by 127 (7 self)
 Add to MetaCart
We present methods for the computation of multivariate normal probabilities on parallel/ distributed systems. After a transformation of the initial integral, an approximation can be obtained using MonteCarlo or quasirandom methods. We propose a metaalgorithm for asynchronous sampling methods and derive efficient parallel algorithms for the computation of MVN distribution functions, including a method based on randomized Korobov and Richtmyer sequences. Timing results of the implementations using the MPI parallel environment are given. 1 Introduction The computation of the multivariate normal distribution function F (a; b) = j\Sigmaj \Gamma 1 2 (2) \Gamma n 2 Z b a e \Gamma 1 2 x \Sigma \Gamma1 x dx: (1) often leads to computationalintensive integration problems. Here \Sigma is an n \Theta n symmetric positive definite covariance matrix; furthermore one of the limits in each integration variable may be infinite. Genz [5] performs a sequence of transformations resu...
Computer Experiments
, 1996
"... Introduction Deterministic computer simulations of physical phenomena are becoming widely used in science and engineering. Computers are used to describe the flow of air over an airplane wing, combustion of gasses in a flame, behavior of a metal structure under stress, safety of a nuclear reactor, a ..."
Abstract

Cited by 84 (5 self)
 Add to MetaCart
Introduction Deterministic computer simulations of physical phenomena are becoming widely used in science and engineering. Computers are used to describe the flow of air over an airplane wing, combustion of gasses in a flame, behavior of a metal structure under stress, safety of a nuclear reactor, and so on. Some of the most widely used computer models, and the ones that lead us to work in this area, arise in the design of the semiconductors used in the computers themselves. A process simulator starts with a data structure representing an unprocessed piece of silicon and simulates the steps such as oxidation, etching and ion injection that produce a semiconductor device such as a transistor. A device simulator takes a description of such a device and simulates the flow of current through it under varying conditions to determine properties of the device such as its switching speed and the critical voltage at which it switches. A circuit simulator takes a list of devices and the
Simulation estimation of mixed discrete choice models using randomized and scrambled halton sequences
 Transportation Research Part B
, 2002
"... The use of simulation techniques has been increasing in recent years in the transportation and related fields to accommodate flexible and behaviorally realistic structures for analysis of decision processes. This paper proposes a randomized and scrambled version of the Halton sequence for use in sim ..."
Abstract

Cited by 83 (26 self)
 Add to MetaCart
(Show Context)
The use of simulation techniques has been increasing in recent years in the transportation and related fields to accommodate flexible and behaviorally realistic structures for analysis of decision processes. This paper proposes a randomized and scrambled version of the Halton sequence for use in simulation estimation of discrete choice models. The scrambling of the Halton sequence is motivated by the rapid deterioration of the standard Halton sequence's coverage of the integration domain in high dimensions of integration. The randomization of the sequence is motivated from a need to statistically compute the simulation variance of model parameters. The resulting hybrid sequence combines the good coverage property of quasiMonte Carlo sequences with the ease of estimating simulation error using traditional Monte Carlo methods. The paper develops an evaluation framework for assessing the performance of the traditional pseudorandom sequence, the standard Halton sequence, and the scrambled Halton sequence. The results of computational experiments indicate that the scrambled Halton sequence performs better than the standard Halton sequence and the traditional pseudorandom sequence for simulation estimation of models with high dimensionality of integration.
Valuation of Mortgage Backed Securities Using Brownian Bridges to Reduce Effective Dimension
, 1997
"... The quasiMonte Carlo method for financial valuation and other integration problems has error bounds of size O((log N) k N \Gamma1 ), or even O((log N) k N \Gamma3=2 ), which suggests significantly better performance than the error size O(N \Gamma1=2 ) for standard Monte Carlo. But in hig ..."
Abstract

Cited by 74 (13 self)
 Add to MetaCart
The quasiMonte Carlo method for financial valuation and other integration problems has error bounds of size O((log N) k N \Gamma1 ), or even O((log N) k N \Gamma3=2 ), which suggests significantly better performance than the error size O(N \Gamma1=2 ) for standard Monte Carlo. But in high dimensional problems this benefit might not appear at feasible sample sizes. Substantial improvements from quasiMonte Carlo integration have, however, been reported for problems such as the valuation of mortgagebacked securities, in dimensions as high as 360. We believe that this is due to a lower effective dimension of the integrand in those cases. This paper defines the effective dimension and shows in examples how the effective dimension may be reduced by using a Brownian bridge representation. 1 Introduction Simulation is often the only effective numerical method for the accurate valuation of securities whose value depends on the whole trajectory of interest Mathematics Departmen...
Latin Supercube Sampling for Very High Dimensional Simulations
, 1997
"... This paper introduces Latin supercube sampling (LSS) for very high dimensional simulations, such as arise in particle transport, finance and queuing. LSS is developed as a combination of two widely used methods: Latin hypercube sampling (LHS), and QuasiMonte Carlo (QMC). In LSS, the input variables ..."
Abstract

Cited by 73 (7 self)
 Add to MetaCart
This paper introduces Latin supercube sampling (LSS) for very high dimensional simulations, such as arise in particle transport, finance and queuing. LSS is developed as a combination of two widely used methods: Latin hypercube sampling (LHS), and QuasiMonte Carlo (QMC). In LSS, the input variables are grouped into subsets, and a lower dimensional QMC method is used within each subset. The QMC points are presented in random order within subsets. QMC methods have been observed to lose effectiveness in high dimensional problems. This paper shows that LSS can extend the benefits of QMC to much higher dimensions, when one can make a good grouping of input variables. Some suggestions for grouping variables are given for the motivating examples. Even a poor grouping can still be expected to do as well as LHS. The paper also extends LHS and LSS to infinite dimensional problems. The paper includes a survey of QMC methods, randomized versions of them (RQMC) and previous methods for extending Q...
Recent Advances In Randomized QuasiMonte Carlo Methods
"... We survey some of the recent developments on quasiMonte Carlo (QMC) methods, which, in their basic form, are a deterministic counterpart to the Monte Carlo (MC) method. Our main focus is the applicability of these methods to practical problems that involve the estimation of a highdimensional inte ..."
Abstract

Cited by 60 (13 self)
 Add to MetaCart
We survey some of the recent developments on quasiMonte Carlo (QMC) methods, which, in their basic form, are a deterministic counterpart to the Monte Carlo (MC) method. Our main focus is the applicability of these methods to practical problems that involve the estimation of a highdimensional integral. We review several QMC constructions and dierent randomizations that have been proposed to provide unbiased estimators and for error estimation. Randomizing QMC methods allows us to view them as variance reduction techniques. New and old results on this topic are used to explain how these methods can improve over the MC method in practice. We also discuss how this methodology can be coupled with clever transformations of the integrand in order to reduce the variance further. Additional topics included in this survey are the description of gures of merit used to measure the quality of the constructions underlying these methods, and other related techniques for multidimensional integration. 1 2 1.
An Adaptive Algorithm for the Approximate Calculation of Multiple Integrals
, 1991
"... An adaptive algorithm for numerical integration over hyperrectangular regions is described. The algorithm uses a globally adaptive subdivision strategy. Several precautions are introduced in the error estimation in order to improve the reliability. In each dimension more than one integration rule ..."
Abstract

Cited by 53 (7 self)
 Add to MetaCart
An adaptive algorithm for numerical integration over hyperrectangular regions is described. The algorithm uses a globally adaptive subdivision strategy. Several precautions are introduced in the error estimation in order to improve the reliability. In each dimension more than one integration rule is made available to the user. The algorithm has been structured to allow efficient implementation on shared memory parallel computers. Keywords: automatic integration, adaptive, cubature, multidimensional integration, fully symmetric rules, null rules, parallel algorithms. Published in ACM Trans. Math. Softw. 17 (1991),pp. 437451. y Supported by the Norwegian Research Council for Humanities and Sciences and STATOIL. z Supported by the Norwegian Research Council for Humanities and Sciences. x Supported by the Norwegian Marshall Fund. 1 1 Introduction Adaptive algorithms are now used widely for the numerical calculation of multiple integrals. These algorithms have been develop...
Variance Reduction via Lattice Rules
 Management Science
, 2000
"... This is a review article on lattice methods for multiple integration over the unit hypercube, with a variancereduction viewpoint. It also contains some new results and ideas. The aim is to examine the basic principles supporting these methods and how they can be used effectively for the simulation ..."
Abstract

Cited by 53 (12 self)
 Add to MetaCart
This is a review article on lattice methods for multiple integration over the unit hypercube, with a variancereduction viewpoint. It also contains some new results and ideas. The aim is to examine the basic principles supporting these methods and how they can be used effectively for the simulation models that are typically encountered in the area of Management Science. These models can usually be reformulated as integration problems over the unit hypercube with a large (sometimes infinite) number of dimensions. We examine selection criteria for the lattice rules and suggest criteria which take into account the quality of the projections of the lattices over selected lowdimensional subspaces. The criteria are strongly related to those used for selecting linear congruential and multiple recursive random number generators. Numerical examples illustrate the effectiveness of the approach.
Methods for the Computation of Multivariate tProbabilities
 Computing Sciences and Statistics
, 2000
"... This paper compares methods for the numerical computation of multivariate tprobabilities for hyperrectangular integration regions. Methods based on acceptancerejection, sphericalradial transformations and separationofvariables transformations are considered. Tests using randomly chosen problems ..."
Abstract

Cited by 46 (9 self)
 Add to MetaCart
This paper compares methods for the numerical computation of multivariate tprobabilities for hyperrectangular integration regions. Methods based on acceptancerejection, sphericalradial transformations and separationofvariables transformations are considered. Tests using randomly chosen problems show that the most efficient numerical methods use a transformation developed by Genz (1992) for multivariate normal probabilities. These methods allow moderately accurate multivariate tprobabilities to be quickly computed for problems with as many as twenty variables. Methods for the noncentral multivariate tdistribution are also described. Key Words: multivariate tdistribution, noncentral distribution, numerical integration, statistical computation. 1 Introduction A common problem in many statistics applications is the numerical computation of the multivariate t (MVT) distribution function (see Tong, 1990) defined by T(a; b; \Sigma; ) = \Gamma( +m 2 ) \Gamma( 2 ) p j\Sigma...
Extensible Lattice Sequences For QuasiMonte Carlo Quadrature
 SIAM Journal on Scientific Computing
, 1999
"... Integration lattices are one of the main types of low discrepancy sets used in quasiMonte Carlo methods. However, they have the disadvantage of being of fixed size. This article describes the construction of an infinite sequence of points, the first b m of which form a lattice for any nonnegative ..."
Abstract

Cited by 35 (6 self)
 Add to MetaCart
Integration lattices are one of the main types of low discrepancy sets used in quasiMonte Carlo methods. However, they have the disadvantage of being of fixed size. This article describes the construction of an infinite sequence of points, the first b m of which form a lattice for any nonnegative integer m. Thus, if the quadrature error using an initial lattice is too large, the lattice can be extended without discarding the original points. Generating vectors for extensible lattices are found by minimizing a loss function based on some measure of discrepancy or nonuniformity of the lattice. The spectral test used for finding pseudorandom number generators is one important example of such a discrepancy. The performance of the extensible lattices proposed here is compared to that of other methods for some practical quadrature problems.