Coin Tossing Algorithms for Integral Equations and Tractability

DOI10.1515/mcma.2004.10.3-4.491zbMath1074.65005OpenAlexW1975129496MaRDI QIDQ4655075

Harald P. Pfeiffer, Erich Novak

Publication date: 10 March 2005

Published in: Monte Carlo Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/mcma.2004.10.3-4.491

zbMATH Keywords

Monte Carlo methodLipschitz continuitycurse of dimensionalityFredholm integral equation of the second kindcomplexity of algorithmstossing algorithm

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical methods for integral equations (65R20) Fredholm integral equations (45B05) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

Lower Bounds for the Number of Random Bits in Monte Carlo Algorithms ⋮ On the Power of Restricted Monte Carlo Algorithms ⋮ Random bit quadrature and approximation of distributions on Hilbert spaces ⋮ Random bit multilevel algorithms for stochastic differential equations

This page was built for publication: Coin Tossing Algorithms for Integral Equations and Tractability