Compressing a Fast Multipole Method Representation of an Integral Equation Matrix

R. J. Adams, J. C. Young, S. D. Gedney

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

It has been observed that the memory requirements associated with H 2 representations of integral equation matrices can be reduced by incorporating translational invariance. This can be accomplished for a non-translationally invariant boldsymbolH 2 representation using a left/right iterative algorithm. In this paper, it is shown that a similar algorithm can also be used to compress an existing fast multipole method (FMM). It is observed that the iterative compression converges faster when used to compress an FMM than when it is applied to an boldsymbolH 2 representation.

Original languageEnglish
Title of host publication2023 International Applied Computational Electromagnetics Society Symposium, ACES-Monterey 2023
ISBN (Electronic)9781733509633
DOIs
StatePublished - 2023
Event2023 International Applied Computational Electromagnetics Society Symposium, ACES-Monterey 2023 - Monterey, United States
Duration: Mar 26 2023Mar 30 2023

Publication series

Name2023 International Applied Computational Electromagnetics Society Symposium, ACES-Monterey 2023

Conference

Conference2023 International Applied Computational Electromagnetics Society Symposium, ACES-Monterey 2023
Country/TerritoryUnited States
CityMonterey
Period3/26/233/30/23

Bibliographical note

Publisher Copyright:
© 2023 ACES.

Keywords

  • fast multipole method
  • integral equation

ASJC Scopus subject areas

  • Computational Mathematics
  • Instrumentation
  • Radiation
  • Computer Networks and Communications
  • Signal Processing

Fingerprint

Dive into the research topics of 'Compressing a Fast Multipole Method Representation of an Integral Equation Matrix'. Together they form a unique fingerprint.

Cite this