On computational complexity of the multilevel fast multipole algorithm in various dimensions

Mert Hidayetoglu, Weng Cho Chew

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

Abstract

This paper reports a concise complexity analysis for the multilevel fast multipole algorithm. The algorithm can solve a plethora of problems governed by different kinds of physics, and therefore the analysis is done for surface and volume problems in two and three dimensions for the sake of generality.

Original languageEnglish (US)
Title of host publication2016 IEEE Antennas and Propagation Society International Symposium, APSURSI 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1559-1560
Number of pages2
ISBN (Electronic)9781509028863
DOIs
StatePublished - Oct 25 2016
Event2016 IEEE Antennas and Propagation Society International Symposium, APSURSI 2016 - Fajardo, Puerto Rico
Duration: Jun 26 2016Jul 1 2016

Publication series

Name2016 IEEE Antennas and Propagation Society International Symposium, APSURSI 2016 - Proceedings

Other

Other2016 IEEE Antennas and Propagation Society International Symposium, APSURSI 2016
Country/TerritoryPuerto Rico
CityFajardo
Period6/26/167/1/16

ASJC Scopus subject areas

  • Instrumentation
  • Radiation
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'On computational complexity of the multilevel fast multipole algorithm in various dimensions'. Together they form a unique fingerprint.

Cite this