A Parallel Finite-Volume Runge-Kutta Algorithm for Electromagnetic Scattering

Vineet Ahuja, Lyle Norman Long

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

A 3D explicit finite volume algorithm has been developed to simulate scattering from complex geometries on parallel computers using structured body conformal curvilinear grids. Most simulations for practical 3D geometries require a large number of grid points for adequate spatial resolution making them suitable to parallel computation. The simulations have been carried out using a multi-block/zonal approach in the message passing paradigm on the SP-2. Each zone is placed on a separate processor and inter-processor communication is carried out using the Message Passing Library/Interface (MPL/MPI). Integration of Maxwell's equations is performed using the four-stage Runge-Kutta time integration method on a dual grid. This method of integrating on a staggered grid gives enhanced dissipative and dispersive characteristics. A scattered field formulation has been used and the Liao boundary condition is used at the outer nonreflecting boundary. The far zone transformation has also been implemented efficiently, using specialized MPL functions to evaluate the far zone scattering results. Results show extremely good comparisons for scattering from the sphere and the ogive with the exact solution and standard FDTD type algorithms. Comparisons for nonaxisymmetric targets like the NASA almond with experimental data has also been found to be extremely good.

Original languageEnglish (US)
Pages (from-to)299-320
Number of pages22
JournalJournal of Computational Physics
Volume137
Issue number2
DOIs
StatePublished - Nov 1 1997

Fingerprint

electromagnetic scattering
grids
Message passing
Scattering
messages
central processing units
Geometry
scattering
Maxwell equations
parallel computers
NASA
geometry
finite difference time domain method
Boundary conditions
Maxwell equation
simulation
spatial resolution
communication
Communication
boundary conditions

All Science Journal Classification (ASJC) codes

  • Numerical Analysis
  • Modeling and Simulation
  • Physics and Astronomy (miscellaneous)
  • Physics and Astronomy(all)
  • Computer Science Applications
  • Computational Mathematics
  • Applied Mathematics

Cite this

Ahuja, Vineet ; Long, Lyle Norman. / A Parallel Finite-Volume Runge-Kutta Algorithm for Electromagnetic Scattering. In: Journal of Computational Physics. 1997 ; Vol. 137, No. 2. pp. 299-320.
@article{5abbfda669ce45c1ab7e875521beeb11,
title = "A Parallel Finite-Volume Runge-Kutta Algorithm for Electromagnetic Scattering",
abstract = "A 3D explicit finite volume algorithm has been developed to simulate scattering from complex geometries on parallel computers using structured body conformal curvilinear grids. Most simulations for practical 3D geometries require a large number of grid points for adequate spatial resolution making them suitable to parallel computation. The simulations have been carried out using a multi-block/zonal approach in the message passing paradigm on the SP-2. Each zone is placed on a separate processor and inter-processor communication is carried out using the Message Passing Library/Interface (MPL/MPI). Integration of Maxwell's equations is performed using the four-stage Runge-Kutta time integration method on a dual grid. This method of integrating on a staggered grid gives enhanced dissipative and dispersive characteristics. A scattered field formulation has been used and the Liao boundary condition is used at the outer nonreflecting boundary. The far zone transformation has also been implemented efficiently, using specialized MPL functions to evaluate the far zone scattering results. Results show extremely good comparisons for scattering from the sphere and the ogive with the exact solution and standard FDTD type algorithms. Comparisons for nonaxisymmetric targets like the NASA almond with experimental data has also been found to be extremely good.",
author = "Vineet Ahuja and Long, {Lyle Norman}",
year = "1997",
month = "11",
day = "1",
doi = "10.1006/jcph.1997.5802",
language = "English (US)",
volume = "137",
pages = "299--320",
journal = "Journal of Computational Physics",
issn = "0021-9991",
publisher = "Academic Press Inc.",
number = "2",

}

A Parallel Finite-Volume Runge-Kutta Algorithm for Electromagnetic Scattering. / Ahuja, Vineet; Long, Lyle Norman.

In: Journal of Computational Physics, Vol. 137, No. 2, 01.11.1997, p. 299-320.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A Parallel Finite-Volume Runge-Kutta Algorithm for Electromagnetic Scattering

AU - Ahuja, Vineet

AU - Long, Lyle Norman

PY - 1997/11/1

Y1 - 1997/11/1

N2 - A 3D explicit finite volume algorithm has been developed to simulate scattering from complex geometries on parallel computers using structured body conformal curvilinear grids. Most simulations for practical 3D geometries require a large number of grid points for adequate spatial resolution making them suitable to parallel computation. The simulations have been carried out using a multi-block/zonal approach in the message passing paradigm on the SP-2. Each zone is placed on a separate processor and inter-processor communication is carried out using the Message Passing Library/Interface (MPL/MPI). Integration of Maxwell's equations is performed using the four-stage Runge-Kutta time integration method on a dual grid. This method of integrating on a staggered grid gives enhanced dissipative and dispersive characteristics. A scattered field formulation has been used and the Liao boundary condition is used at the outer nonreflecting boundary. The far zone transformation has also been implemented efficiently, using specialized MPL functions to evaluate the far zone scattering results. Results show extremely good comparisons for scattering from the sphere and the ogive with the exact solution and standard FDTD type algorithms. Comparisons for nonaxisymmetric targets like the NASA almond with experimental data has also been found to be extremely good.

AB - A 3D explicit finite volume algorithm has been developed to simulate scattering from complex geometries on parallel computers using structured body conformal curvilinear grids. Most simulations for practical 3D geometries require a large number of grid points for adequate spatial resolution making them suitable to parallel computation. The simulations have been carried out using a multi-block/zonal approach in the message passing paradigm on the SP-2. Each zone is placed on a separate processor and inter-processor communication is carried out using the Message Passing Library/Interface (MPL/MPI). Integration of Maxwell's equations is performed using the four-stage Runge-Kutta time integration method on a dual grid. This method of integrating on a staggered grid gives enhanced dissipative and dispersive characteristics. A scattered field formulation has been used and the Liao boundary condition is used at the outer nonreflecting boundary. The far zone transformation has also been implemented efficiently, using specialized MPL functions to evaluate the far zone scattering results. Results show extremely good comparisons for scattering from the sphere and the ogive with the exact solution and standard FDTD type algorithms. Comparisons for nonaxisymmetric targets like the NASA almond with experimental data has also been found to be extremely good.

UR - http://www.scopus.com/inward/record.url?scp=0031282012&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031282012&partnerID=8YFLogxK

U2 - 10.1006/jcph.1997.5802

DO - 10.1006/jcph.1997.5802

M3 - Article

VL - 137

SP - 299

EP - 320

JO - Journal of Computational Physics

JF - Journal of Computational Physics

SN - 0021-9991

IS - 2

ER -