Monte Carlo Method for Numerical Integration Based on Sobol's Sequences

نویسندگان

  • Ivan Tomov Dimov
  • Rayna Georgieva
چکیده

An efficient Monte Carlo method for multidimensional integration is proposed and studied. The method is based on Sobol’s sequences. Each random point in s-dimensional domain of integration is generated in the following way. A Sobol’s vector of dimension s (ΛΠτ point) is considered as a centrum of a sphere with a radius ρ. Then a random point uniformly distributed on the sphere is taken and a random variable is defined as a value of the integrand at that random point. It is proven that the mathematical expectation of the random variable is equal to the desired multidimensional integral. This fact is used to define a Monte Carlo algorithm with a low variance. Numerical experiments are performed in order to study the quality of the algorithm depending of the radius ρ and regularity, i.e. smoothness of the integrand.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-Monte Carlo Integration on GRIDS: Using Blocked Substreams

The splitting of Quasi-Monte Carlo (QMC) point sequences into blocks or interleaved substreams has been suggested to raise the speed of distributed numerical integration and to lower to traffic on the network. The usefulness of this approach in GRID environments is discussed. After specifying requirements for using QMC techniques in GRID environments in general we review and evaluate the propos...

متن کامل

A Parallel Quasi-Monte Carlo Method for Computing Extremal Eigenvalues

1 Florida State University, Department of Computer Science, Tallahassee, FL 32306-4530, USA 2 Bulgarian Academy of Sciences, Central Laboratory for Parallel Processing, 1113 Sofia, Bulgaria Abstract The convergence of Monte Carlo methods for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers known as quasirandom numbers (...

متن کامل

Matrix Computations Using Quasirandom Sequences

The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers known as quasirandom numbers(QRNs). Standard Monte Carlo methods use pseudorandom sequences and provide a convergence rate of O(N−1/2) using N samples. Quasi-Monte Carlo methods use quasirandom sequences with the resulting converg...

متن کامل

Bounds for digital nets and sequences

1. Introduction. Currently, the most effective constructions of low-discrepancy point sets and sequences, which are of great importance for quasi-Monte Carlo methods in multidimensional numerical integration, are based on the concept of (t, m, s)-nets and (t, s)-sequences. A detailed theory was developed in Niederreiter [9] (see also [10, Chapter 4] for surveys of this theory). So-called digita...

متن کامل

Discrepancies of Point Sequences on the Sphere and Numerical Integration

where σ denotes the normalized surface measure on Sd and f is a continuous real valued function. As a general reference on Quasi-Monte Carlo methods we mention Niederreiter [22]. The problem of distributing points on the sphere is also related to constructive multivariate approximation, see Reimer [24]. For the recent literature on spherical problems concerned with approximation and numerical i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010