An MPI-accelerated multi-solver algorithm for electromagnetic modeling of complex objects

Jian Guan, Su Yan, Kedi Zhang, Jian Ming Jin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A multi-solver (MS) algorithm is accelerated on distributed computing systems to simulate the electromagnetic scattering from large and complex objects. In this algorithm, the targeted object with its background is decomposed into multiple subdomains which are modeled by either the finite element method or the method of moments. Different from conventional parallelized domain decomposition methods, where the subdomains are handled in parallel, the MS algorithm is parallelized by applying the parallelization to individual subdomains. The employed multilevel fast multipole algorithm is also parallelized to enable computation on many processors. Numerical examples are given to show the parallel efficiency of the proposed strategy.

Original languageEnglish (US)
Title of host publication2017 IEEE Antennas and Propagation Society International Symposium, Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1333-1334
Number of pages2
ISBN (Electronic)9781538632840
DOIs
StatePublished - Oct 18 2017
Event2017 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting, APSURSI 2017 - San Diego, United States
Duration: Jul 9 2017Jul 14 2017

Publication series

Name2017 IEEE Antennas and Propagation Society International Symposium, Proceedings
Volume2017-January

Other

Other2017 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting, APSURSI 2017
Country/TerritoryUnited States
CitySan Diego
Period7/9/177/14/17

ASJC Scopus subject areas

  • Radiation
  • Computer Networks and Communications
  • Instrumentation

Fingerprint

Dive into the research topics of 'An MPI-accelerated multi-solver algorithm for electromagnetic modeling of complex objects'. Together they form a unique fingerprint.

Cite this