Abstract
Chaotic maps with absolutely continuous invariant probability measures are implemented as random-number generators for Monte Carlo computation. We observe that such Monte Carlo computation based on chaotic random-number generators yields sometimes unexpected dynamical dependency behavior which cannot be explained by usual statistical arguments. Furthermore, we find that superefficient Monte Carlo computation with O(1/N2) mean square error can be carried out as an extreme case of such dynamical dependency behavior. Here, such superefficiency sharply contrasts with the conventional Monte Carlo simulation with O(1/N) mean square error. By deriving a necessary and sufficient condition for the superefficiency, it is shown that such high-performance Monte Carlo simulations can be carried out only if there exists a strong correlation with chaotic dynamical variables. Numerical calculation illustrates this dynamics dependency and the superefficiency of various chaotic Monte Carlo computations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
