Global adaptive quadrature for the approximate computation of multidimensional integrals on a distributed-memory multiprocessor

作者: Marco Lapegna

DOI: 10.1002/CPE.4330040602

关键词:

摘要: In this paper we discuss the problem of computing a multidimensional integral on MIMD distributed-memory multiprocessor. Adaptive quadrature is known as good approach to achieving accuracy and reliability while attempting minimize number function evaluations. The implementation makes use dynamical data structures able manage subinterval partition. On multiprocessor, each processor execute code manipulate in its own local memory only, are sent from one another by explicit message-passing. Efficient an adaptive algorithm for parallel computer quite difficult, because need continuous information exchange between processors. Our based global strategy which dynamically balances workload reduces communication processors order message-passing environment efficiently. The results timings several tests given.

参考文章(6)
A.C. Genz, A.A. Malik, Remarks on algorithm 006: An adaptive algorithm for numerical integration over an N-dimensional rectangular region Journal of Computational and Applied Mathematics. ,vol. 6, pp. 295- 302 ,(1980) , 10.1016/0771-050X(80)90039-X
Elise de Doncker, Ian Robinson, Algorithm 612: TRIEX: Integration Over a TRIangle Using Nonlinear EXtrapolation ACM Transactions on Mathematical Software. ,vol. 10, pp. 17- 22 ,(1984) , 10.1145/356068.356070
John A Kapenga, Elise De Doncker, A parallelization of adaptive task partitioning algorithms parallel computing. ,vol. 7, pp. 211- 225 ,(1988) , 10.1016/0167-8191(88)90040-3
Michael A. Malcolm, R. Bruce Simpson, Local Versus Global Strategies for Adaptive Quadrature ACM Transactions on Mathematical Software. ,vol. 1, pp. 129- 146 ,(1975) , 10.1145/355637.355640