Abstract
The problem of the global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, where only the value of the solution in a single point or a functional of the solution is sought). The Monte Carlo complexity, i.e., the complexity of the stochastic solution of this problem, is analyzed. The framework for this analysis is provided by information-based complexity theory. The investigations complement previous ones on the stochastic complexity of the local solution and on deterministic complexity of both local and global solutions. The results show that even in the global case Monte Carlo algorithms can perform better than deterministic ones, although the difference is not as large as in the local case.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.