MLFMA memory reduction techniques for solving large-scale problems
IEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
Institute of Electrical and Electronics Engineers Inc.
749 - 750
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27718
We present two memory reduction methods for the parallel multilevel fast multipole algorithm. One of these methods uses data structures out of core, and the other parallelizes the data structures related to input geometry. With these methods, large-scale electromagnetic scattering problems can be solved on modest parallel computers. © 2014 IEEE.
- Conference Paper 2294