Compariing parallel multidimensional integration algorithms

  • Authors:
  • I. Gladwell;M. A. Napierala

  • Affiliations:
  • Southern Methodist Univ., Dallas, TX;Texas Instruments Inc., Dallas, TX

  • Venue:
  • Progress in computer research
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.