Abstract
We consider the design and implementation of new parallel globally adaptive multidimensional numerical integration algorithms. We describe a pair of algorithms (implemented in MPI on an IBM SP2); one uses a master-slave paradigm and the other is genuinely distributed. Then, we describe modifications of these algorithms to take advantage of a singularity detection scheme. The most obvious competitors for globally adaptive schemes in high dimensions are algorithms based on lattice rules. We compare our globally adaptive strategy with the straightforward implementation of a lattice rule algorithm paying attention to the quality of the respective error estimates. The lattice rule algorithm implementations involve computing new seeds for larger numbers of points than used previously, a significant though straightforward computational task.
Sign-in/Register to access full text options 
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.
