Abstract
In this paper we present error and performance analysis of a Monte Carlo variance reduction method for solving multidimensional integrals and integral equations. This method combines the idea of separation of the domain into small subdomains with the approach of importance sampling. The importance separation method is originally described in our previous works [7,9]. Here we present a new variant of this method adding polynomial interpolation in subdomains. We also discuss the performance of the algorithms in comparison with crude Monte Carlo. We propose efficient parallel implementation of the importance separation method for a grid environment and we demonstrate numerical experiments on a heterogeneous grid. Two versions of the algorithm are compared – a Monte Carlo version using pseudorandom numbers and a quasi-Monte Carlo version using the Sobol and Halton low-discrepancy sequences [13,8].
Chapter PDF
Similar content being viewed by others
References
Atanassov, E.: Measuring the Performance of a Power PC Cluster. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002. LNCS, vol. 2330, pp. 628–634. Springer, Heidelberg (2002)
Atanassov, E., Dimov, I., Durchova, M.: A New Quasi-Monte Carlo Algorithm for Numerical Integration of Smooth Functions. In: Lirkov, I., Margenov, S., Waśniewski, J., Yalamov, P. (eds.) LSSC 2003. LNCS, vol. 2907, pp. 128–135. Springer, Heidelberg (2004)
Atanassov, E., Durchova, M.: Generating and Testing the Modified Halton Sequences. In: Dimov, I.T., Lirkov, I., Margenov, S., Zlatev, Z. (eds.) NMA 2002. LNCS, vol. 2542, pp. 91–98. Springer, Heidelberg (2003)
Bachvalov, N.S.: On the approximate computation of multiple integrals. Vestnik Moscow State University, Ser. Mat., Mech. 4, 3–18 (1959)
Bachvalov, N.S.: Average Estimation of the Remainder Term of Quadrature Formulas. USSR Comput. Math. and Math. Phys. 1(1), 64–77 (1961)
Caflisch, R.E.: Monte Carlo and quasi-Monte Carlo methods. Acta Numerica 7, 1–49 (1998)
Dimov, I., Karaivanova, A., Georgieva, R., Ivanovska, S.: Parallel Importance Separation and Adaptive Monte Carlo Algorithms for Multiple Integrals. In: Dimov, I.T., Lirkov, I., Margenov, S., Zlatev, Z. (eds.) NMA 2002. LNCS, vol. 2542, pp. 99–107. Springer, Heidelberg (2003)
Halton, J.H.: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer. math. 2, 84–90 (1960)
Karaivanova, A.: Adaptive Monte Carlo methods for numerical integration. Mathematica Balkanica 11, 391–406 (1997)
Mascagni, M.: SPRNG: A Scalable Library for Pseudorandom Number Generation. In: Iliev, O., Kaschiev, M., Sendov, B.l., Vassilevski, P.S. (eds.) Recent Advances in Numerical Methods and Applications II, Proceeding of NMA 1998, pp. 284–295. World Scientific, Singapore (1999)
Moskowitz, B., Caflisch, R.E.: Smoothness and dimension reduction in quasi-Monte Carlo methods. J. Math. Comput. Modeling 23, 37–54 (1996)
Niederreiter, H.: Random number generation and quasi-Monte Carlo methods. SIAM, Philadelphia (1992)
Sobol, I.M.: On the distribution of point in a cube and the approximate evaluation of integrals. USSR Computational Mathematics and Mathematical Physics 7, 86–112 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ivanovska, S., Atanassov, E., Karaivanova, A. (2005). A Superconvergent Monte Carlo Method for Multiple Integrals on the Grid. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428862_100
Download citation
DOI: https://doi.org/10.1007/11428862_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26044-8
Online ISBN: 978-3-540-32118-7
eBook Packages: Computer ScienceComputer Science (R0)