Quasi-random integration in high dimensions
โ Scribed by George Takhtamyshev; Bart Vandewoestyne; Ronald Cools
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 696 KB
- Volume
- 73
- Category
- Article
- ISSN
- 0378-4754
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper, we show that the Sobol' and Richtmyer sequences can be effectively used for numerical integration of functions having up to 1000 variables. The results of integration obtained with the two sequences are compared and the parameters C and ฮฑ from the convergence model C/N ฮฑ are estimated, where N is the number of points used. For all the tests done, the Sobol' sequence demonstrated somewhat better convergence, but for many practical values of N the relative error is higher than for Richtmyer sequences due to the large value of C. Constructing Sobol' sequences also takes considerably more time than constructing Richtmyer sequences.
๐ SIMILAR VOLUMES
The dominant cost for integration factor (IF) or exponential time differencing (ETD) methods is the repeated vector-matrix multiplications involving exponentials of discretization matrices of differential operators. Although the discretization matrices usually are sparse, their exponentials are not,
Monte Carlo integration with a sequence of quasi-random numbers is, in general, advantageous compared to using pseudo-random numbers. This has been demonstrated also for step-function integrands, though no theorems to prove it are known. In this paper we show by means of careful computer experiments