Parallel Algorithms and Interval Selection Strategies for Globally Adaptive Quadrature to appear
| Author(s) : | T. L. Freeman J. M. Bull, |
| Publisher : | N/A |
| Publication Date : | 1994 |
| ISSN : | N/A |
| Abstract : | Abstract. A globally adaptive algorithm for approximating one-dimensional definite integrals on parallel computers is described. The algorithm is implemented on a Kendall Square Research KSR-1 parallel computer and numerical results are presented. The algorithm gives significant speedups on a range of hard problems, including ones with singular integrands. A number of alternatives for the interval selection strategy that is at the core of this algorithm are evaluated. 1, |