Scattering from complex geometries using a parallel FVTD algorithm

Vineet Ahuja, Lyle N. Long

Research output: Contribution to conferencePaper

Abstract

A 3-D explicit finite volume algorithm has been developed to simulate scattering from complex geometries on parallel computers using structured body conformal curvilinear grids. Most simulations with realistic 3-D 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 (MPL). Integration of the 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 seems to give enhanced dissipative and dispersive characteristics. Results obtained in the past, have shown extremely good comparisons for scattering from the sphere and the ogive with the exact solution and standard FDTD type algorithms. Comparisons for non-axisymmetric targets like the NASA almond with experimental data has also been found to be extremely good. Scattering from complex 3-D bodies like a trapezoidal wing and an engine inlet has also been investigated.

Original languageEnglish (US)
Pages1072-1082
Number of pages11
StatePublished - Jan 1 1996
EventProceedings of the 1996 12th Annual Review of Progress in Applied Computational Electromagnetics. Part 1 (of 2) - Monterey, CA, USA
Duration: Mar 18 1996Mar 22 1996

Other

OtherProceedings of the 1996 12th Annual Review of Progress in Applied Computational Electromagnetics. Part 1 (of 2)
CityMonterey, CA, USA
Period3/18/963/22/96

Fingerprint

Parallel algorithms
Message passing
Scattering
Geometry
Maxwell equations
NASA
Engines
Communication

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Ahuja, V., & Long, L. N. (1996). Scattering from complex geometries using a parallel FVTD algorithm. 1072-1082. Paper presented at Proceedings of the 1996 12th Annual Review of Progress in Applied Computational Electromagnetics. Part 1 (of 2), Monterey, CA, USA, .
Ahuja, Vineet ; Long, Lyle N. / Scattering from complex geometries using a parallel FVTD algorithm. Paper presented at Proceedings of the 1996 12th Annual Review of Progress in Applied Computational Electromagnetics. Part 1 (of 2), Monterey, CA, USA, .11 p.
@conference{e3819c7c1b784df7a40a0fe4e371c0fa,
title = "Scattering from complex geometries using a parallel FVTD algorithm",
abstract = "A 3-D explicit finite volume algorithm has been developed to simulate scattering from complex geometries on parallel computers using structured body conformal curvilinear grids. Most simulations with realistic 3-D 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 (MPL). Integration of the 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 seems to give enhanced dissipative and dispersive characteristics. Results obtained in the past, have shown extremely good comparisons for scattering from the sphere and the ogive with the exact solution and standard FDTD type algorithms. Comparisons for non-axisymmetric targets like the NASA almond with experimental data has also been found to be extremely good. Scattering from complex 3-D bodies like a trapezoidal wing and an engine inlet has also been investigated.",
author = "Vineet Ahuja and Long, {Lyle N.}",
year = "1996",
month = "1",
day = "1",
language = "English (US)",
pages = "1072--1082",
note = "Proceedings of the 1996 12th Annual Review of Progress in Applied Computational Electromagnetics. Part 1 (of 2) ; Conference date: 18-03-1996 Through 22-03-1996",

}

Ahuja, V & Long, LN 1996, 'Scattering from complex geometries using a parallel FVTD algorithm', Paper presented at Proceedings of the 1996 12th Annual Review of Progress in Applied Computational Electromagnetics. Part 1 (of 2), Monterey, CA, USA, 3/18/96 - 3/22/96 pp. 1072-1082.

Scattering from complex geometries using a parallel FVTD algorithm. / Ahuja, Vineet; Long, Lyle N.

1996. 1072-1082 Paper presented at Proceedings of the 1996 12th Annual Review of Progress in Applied Computational Electromagnetics. Part 1 (of 2), Monterey, CA, USA, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Scattering from complex geometries using a parallel FVTD algorithm

AU - Ahuja, Vineet

AU - Long, Lyle N.

PY - 1996/1/1

Y1 - 1996/1/1

N2 - A 3-D explicit finite volume algorithm has been developed to simulate scattering from complex geometries on parallel computers using structured body conformal curvilinear grids. Most simulations with realistic 3-D 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 (MPL). Integration of the 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 seems to give enhanced dissipative and dispersive characteristics. Results obtained in the past, have shown extremely good comparisons for scattering from the sphere and the ogive with the exact solution and standard FDTD type algorithms. Comparisons for non-axisymmetric targets like the NASA almond with experimental data has also been found to be extremely good. Scattering from complex 3-D bodies like a trapezoidal wing and an engine inlet has also been investigated.

AB - A 3-D explicit finite volume algorithm has been developed to simulate scattering from complex geometries on parallel computers using structured body conformal curvilinear grids. Most simulations with realistic 3-D 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 (MPL). Integration of the 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 seems to give enhanced dissipative and dispersive characteristics. Results obtained in the past, have shown extremely good comparisons for scattering from the sphere and the ogive with the exact solution and standard FDTD type algorithms. Comparisons for non-axisymmetric targets like the NASA almond with experimental data has also been found to be extremely good. Scattering from complex 3-D bodies like a trapezoidal wing and an engine inlet has also been investigated.

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

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

M3 - Paper

AN - SCOPUS:0029756028

SP - 1072

EP - 1082

ER -

Ahuja V, Long LN. Scattering from complex geometries using a parallel FVTD algorithm. 1996. Paper presented at Proceedings of the 1996 12th Annual Review of Progress in Applied Computational Electromagnetics. Part 1 (of 2), Monterey, CA, USA, .