An efficient O(N) algorithm for computing O(N2) acoustic wave interactions in large N-obstacle three dimensional configurations

M. Ganesh*, S. C. Hawkins

*Corresponding author for this work

    Research output: Contribution to journalArticle

    9 Citations (Scopus)

    Abstract

    We develop and implement a fast and memory efficient scheme for simulating the wave interactions between large numbers of particles. This is crucial for iteratively computing a time harmonic acoustic field exterior to a configuration of the particles. The main focus of this article is on efficient computation of the wave interactions between the particles in any iterative multiple scattering approach. We develop our algorithm in four stages and demonstrate the efficiency of our interaction evaluation algorithm at each stage for configurations with several thousand convex and non-convex particles. Using this efficient approach, we simulate the full large particle wave propagation models using a flexible GMRES based inner–outer preconditioned multiple scattering iterative technique on a single compute node.

    Original languageEnglish
    Pages (from-to)117-139
    Number of pages23
    JournalBIT Numerical Mathematics
    Volume55
    Issue number1
    DOIs
    Publication statusPublished - Mar 2015

    Keywords

    • Acoustic cross section
    • Acoustic scattering
    • Bistatic
    • Galerkin
    • Helmholtz equation
    • Multiple excitations
    • Multiple scattering interactions
    • Surface integral

    Fingerprint Dive into the research topics of 'An efficient O(N) algorithm for computing O(N2) acoustic wave interactions in large N-obstacle three dimensional configurations'. Together they form a unique fingerprint.

  • Cite this