Parallelizing the fast multipole method for the Helmholtz
- Hughes Research Labs., Malibu, CA (United States)
The fast multipole method (FMM) dramatically reduces the time required to compute radar cross sections and antenna radiation patterns compared to dense matrix techniques. The FMM decreases the operation count of the matrix-vector multiplication in iterative solvers to O(N{sup 3/2}), where N is the number of unknowns. Presented is a parallel FMM and the performance of its implementation on an Intel Paragon. For a 90,000 unknown problem running on 60 processors, the FMM representation fits in memory and the algorithm computes the matrix-vector product in 1.26 seconds. It sustains an aggregate rate of 1.4 Gflop/s. The corresponding dense matrix would occupy over 100 Gbytes and require approximately 50 seconds to form the product.
- OSTI ID:
- 125524
- Report Number(s):
- CONF-950212-; TRN: 95:005768-0069
- Resource Relation:
- Conference: 7. Society for Industrial and Applied Mathematics (SIAM) conference on parallel processing for scientific computing, San Francisco, CA (United States), 15-17 Feb 1995; Other Information: PBD: 1995; Related Information: Is Part Of Proceedings of the seventh SIAM conference on parallel processing for scientific computing; Bailey, D.H.; Bjorstad, P.E.; Gilbert, J.R. [eds.] [and others]; PB: 894 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
An Adaptive Fast Multipole Boundary Element Method for Poisson-Boltzmann Electrostatics
Comparing precorrected-FFT and fast multipole algorithms for solving three-dimensional potential integral equations