scientific article; zbMATH DE number 2186130

MaRDI QIDQ3023327zbMATH OpenFDO

Authors Harald P. Pfeiffer

Publication date 4 July 2005

Full work available at URL http://www.shaker.de/de/content/catalogue/index.asp?lang=de&ID=8&ISBN=978-3-8322-4044-8

zbMATH Keywords

approximation of integralsapproximation of meanscomplexityFredholm integral equation of the second kindintegral equationsMonte Carlo methodsoptimal algorithmsrandom bit model of computation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2051207
• scientific article; zbMATH DE number 953025
• scientific article; zbMATH DE number 3878357
• scientific article; zbMATH DE number 515830
• What Monte Carlo models can do and cannot do efficiently?

Cited in

(19)

• What Monte Carlo models can do and cannot do efficiently?
• Randomization for continuous problems
• Random bit quadrature and approximation of distributions on Hilbert spaces
• The difficulty of Monte Carlo approximation of multivariate monotone functions
• Random bit multilevel algorithms for stochastic differential equations
• Comment: unreasonable effectiveness of Monte Carlo
• Optimal error bound of restricted Monte Carlo integration on anisotropic Sobolev classes
• Bernstein numbers and lower bounds for the Monte Carlo error
• scientific article; zbMATH DE number 3878357 (Why is no real title available?)
• The power of standard information for multivariate approximation in the randomized setting
• The Monte Carlo Algorithm with a Pseudorandom Generator
• scientific article; zbMATH DE number 515830 (Why is no real title available?)
• scientific article; zbMATH DE number 520129 (Why is no real title available?)
• scientific article; zbMATH DE number 2051207 (Why is no real title available?)
• Coin Tossing Algorithms for Integral Equations and Tractability
• scientific article; zbMATH DE number 953025 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2005
• Lower Bounds for the Number of Random Bits in Monte Carlo Algorithms
• The quantum setting with randomized queries for continuous problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3023327)