Parallel Algorithms For The Boundary Element Method
Price
Free (open access)
Transaction
Volume
3
Pages
10
Published
1993
Size
883 kb
Paper DOI
10.2495/BT930271
Copyright
WIT Press
Author(s)
A.J. Davies
Abstract
Parallel algorithms for the boundary element method A.J. Davies Division of Mathematics, University of Hertfordshire, Hatfield, AL10 9AB, UK ABSTRACT The first implementation of the boundary element method on a parallel computer was described by Symm [1]. In the latter part of the 1980's Davies [2], [3] considered the development of linear and quadratic boundary element solutions for potential problems. The approaches exploited the fine-grain parallelism inherent in the boundary element method for implementation on an array processor. Comparisons with equivalent sequential codes showed that the parallel versions were very attractive both in terms of speed-up and transparency of code. Alternatively, the boundary element method has a coarse-grain parallelism which was exploited on a transputer network [4], [5]. Recently there has been a significant increase in the number of researchers working on parallel boundary elements. Papers have been published exploiting fine-grain and co
Keywords