Multiple Scattering Study Using Supercomputers.

Abstract

This report summarizes our study of multiple scattering using supercomputers. Our emphasis has been on using fast algorithms to solve such a class of problem so that the memory requirements and computational complexity are reduced compared to conventional methods. We have developed several algorithms to achieve this end. These include nested equivalence principle algorithm (NEPAL), SCG-FFT algorithm, BCG-FFT T-matrix algorithm, the multilevel fast multipole algorithm (MLFMA) and the fast far field approximation algorithm (FAFFA). All these algorithms account for multiple scattering effect within a volumetric scatterer or a surface scatterer with reduced computational complexity and memory requirements. Using BCG-FFT T-matrix algorithm, we have solve multiple scattering problem involving 10,000 particles on a SUN SPARC 10 workstation. (AN)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 10, 1995
Accession Number
ADA300568

Entities

People

  • W. C. Chew

Organizations

  • University of Illinois Urbana–Champaign

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computations
  • Computers
  • Electromagnetic Scattering
  • Equations
  • Far Field
  • Integral Equations
  • Integrals
  • Inverse Problems
  • Inverse Scattering
  • Mathematics
  • Particles
  • Scattering
  • Supercomputers
  • Three Dimensional

Readers

  • Electromagnetic Wave Scattering and Antenna Radiation Engineering
  • Parallel and Distributed Computing.