What Monte Carlo models can do and cannot do efficiently?

Full text not archived in this repository.

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Atanassov, E. and Dimov, I.T. (2008) What Monte Carlo models can do and cannot do efficiently? Applied Mathematical Modelling, 32 (8). pp. 1477-1500. ISSN 0307-904X doi: 10.1016/j.apm.2007.04.010

Abstract/Summary

The question "what Monte Carlo models can do and cannot do efficiently" is discussed for some functional spaces that define the regularity of the input data. Data classes important for practical computations are considered: classes of functions with bounded derivatives and Holder type conditions, as well as Korobov-like spaces. Theoretical performance analysis of some algorithms with unimprovable rate of convergence is given. Estimates of computational complexity of two classes of algorithms - deterministic and randomized for both problems - numerical multidimensional integration and calculation of linear functionals of the solution of a class of integral equations are presented. (c) 2007 Elsevier Inc. All rights reserved.

Altmetric Badge

Item Type Article
URI https://centaur.reading.ac.uk/id/eprint/15116
Identification Number/DOI 10.1016/j.apm.2007.04.010
Refereed Yes
Divisions Science
Uncontrolled Keywords Monte Carlo algorithms, deterministic algorithms, multidimensional integration, integral equations, unimprovable rate of convergence , QUADRATURE-FORMULAS, INTEGRATION, ALGORITHMS
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record