Abstract
Exact error estimates for evaluating multi-dimensional integrals are considered. An estimate is called exact if the rates of convergence for the low- and upper-bound estimate coincide. The algorithm with such an exact rate is called optimal. Such an algorithm has an unimprovable rate of convergence.
The problem of existing exact estimates and optimal algorithms is discussed for some functional spaces that define the regularity of the integrand. Important for practical computations data classes are considered: classes of functions with bounded derivatives and Hölder type conditions.
The aim of the paper is to analyze the performance of two optimal classes of algorithms: deterministic and randomized for computing multi-dimensional integrals. It is also shown how the smoothness of the integrand can be exploited to construct better randomized algorithms.
Partially supported by the NSF of Bulgaria through grant number I-1405/04 and by the Bulgarian IST Centre of Competence in 21 Century – BIS-21++ (contract # INCO-CT-2005-016639).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Atanassov, E., Dimov, I.: A new Monte Carlo method for calculating integrals of smooth functions. Monte Carlo Methods and Applications 5(2), 149–167 (1999)
Bachvalov, N.S.: On the approximate computation of multiple integrals. Vestnik Moscow State University, Ser. Mat., Mech., vol. 4, pp. 3–18 (1959)
Dimov, I.T.: Minimization of the probable error for some Monte Carlo methods. In: Proc. of the Summer School on Mathematical Modelling and Scientific Computations, pp. 159–170. House of the Bulg. Acad. Sci, Sofia (1991)URL, 159
Dimov, I.: Efficient and Overconvergent Monte Carlo Methods. Parallel algorithms. In: Dimov, I., Tonev, O. (eds.) Advances in Parallel Algorithms, pp. 100–111. IOS Press, Amsterdam (1994)
Dimov, I., et al.: Monte Carlo Algorithms for Elliptic Differential Equations. Data Parallel Functional Approach. Journal of Parallel Algorithms and Applications 9, 39–65 (1996)
Dimov, I., Tonev, O.: Monte Carlo algorithms: performance analysis for some computer architectures. J. of Computational and Applied Mathematics 48, 253–277 (1993)
Halton, J.H., Handscome, D.C.: A method for increasing the efficiency of Monte Carlo integrations. J. Assoc. comput. machinery 4(3), 329–340 (1957)
Kalos, M.H.: Importance sampling in Monte Carlo calculations of thick shield penetration. Nuclear Sci. and Eng. 2(1), 34–35 (1959)
Karaivanova, A., Dimov, I.: Error analysis of an Adaptive Monte Carlo Method for Numerical Integration. Mathematics and Computers in Simulation 47, 201–213 (1998)
Ko, K.-I.: Computational Complexity of Real Functions. Birkhauser, Boston (1991)
Kolmogorov, A.N.: Foundations of the Theory of Probability, 2nd engl. edn. Chelsea Publishing Company, New York (1956)
Novak, E., Ritter, K.: Optimal stochstic quadrature farmulas for convex functions. BIT 34, 288–294 (1994)
Novak, E., Ritter, K.: High Dimensional Integration of Smooth Functions over cubes. In: Numerische Mathematik, pp. 1–19 (1996)
Sendov, B., Andreev, A., Kjurkchiev, N.: Numerical Solution of Polynomial Equations, Handbook of Numerical Analysis. In: Ciarlet, P.G., Lions, J.L. (eds.) Handbook of Numerical Analysis, Solution of Equations in R n (Part 2), North-Holland, Amsterdam (1994)
Smolyak, S.A.: Quadrature and inperpolation formulas for tensor products of certain classes of functions. Soviet Math. Dokl. 4, 240–243 (1963)
Sobol, I.M.: Monte Carlo numerical methods. Nauka, Moscow (1973)
Sobol, I.M.: On Quadratic Formulas for Functions of Several Variables Satisfying a General Lipschitz Condition. USSR Comput. Math. and Math. Phys. 29(6), 936–941 (1989)
Traub, J.F., Wasilkowski, G.W., Wozniakowski, H.: Information-Based Complexity. Acad. Press, INC., New York (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Dimov, I.T., Atanassov, E. (2007). Exact Error Estimates and Optimal Randomized Algorithms for Integration. In: Boyanov, T., Dimova, S., Georgiev, K., Nikolov, G. (eds) Numerical Methods and Applications. NMA 2006. Lecture Notes in Computer Science, vol 4310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70942-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-70942-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70940-4
Online ISBN: 978-3-540-70942-8
eBook Packages: Computer ScienceComputer Science (R0)