Investigation of three-level finite-difference time-domain methods for multidimensional acoustics and electromagnetics.

INVESTIGATION OF THREE-LEVEL FINITE-DIFFERENCE TIME-DOMAIN METHODS FOR MULTIDIMENSIONAL ACOUSTICS AND ELECTROMAGNETICS by Brian Thao Nguyen Chair: P.L. Roe This dissertation deals with accurate nite-di erence time-domain methods for e ciently solving acoustics and electromagnetic scattering problems. Problems in 1D, 2D and 3D are treated. Primary emphasis is given to comparing variations of the existing standard leapfrog schemes and new upwind leapfrog schemes and to the e ectiveness of their high-order extensions. Numerical errors are described for the schemes at given resolutions. Afterward, cost-e ciency is compared between schemes dealing with the same problem. In 1D, additional comparison with di usive central-di erence and upstream-biased schemes are made to gain a perspective on the advantages and disadvantages of non-di usive schemes. The multi-dimensional upwind leapfrog schemes are derived on the basis of those originally developed for the 1D advection equation, as many upstream-biased schemes are. To extend the 1D schemes for the multi-dimensional acoustics and electromagnetics equations, the equations are rst written in bicharacteristic forms. Relating the bicharacteristics equations to the 1D advection equation shows that multidimensional upwind leapfrog schemes can be derived by including terms that couple the equations in the di erent directions and by using an appropriate layout of variables on the grid. All schemes surpass the widely-used second-order accurate standard leapfrog scheme in most respect, but the fourth-order extension of this scheme is very competitive. A very tight error tolerance is required to make the sixth-order accurate version feasible. Higher-order schemes are always more memory-e cient than lowerorder versions, but their large computational stencils are less desirable than the more compact lower-order stencils. The upwind leapfrog schemes always uses a smaller stencil than the standard leapfrog scheme stencils, for a given order of accuracy. The 2D fourth-order accurate upwind leapfrog scheme is a highly desirable scheme in most respects. In 3D, the schemes are more closely matched, with the high-order standard leapfrog schemes being better in terms of overall e ciency, though the upwind leapfrog schemes are not grossly ine cient in comparison. No stable highorder upwind leapfrog scheme for electromagnetics has been found. Costs range over nearly two orders of magnitude between the least and most e cient schemes, considering only the bare schemes. However, depending on the particulars of the actual problem being solved, such as the presence of inhomogeneity, the results of the e ciency comparison may change.

[1]  J. S. Shang A fractional-step method for solving 3D, time-domain Maxwell equations , 1995 .

[2]  R. Harrington Time-Harmonic Electromagnetic Fields , 1961 .

[3]  Roger F. Harrington,et al.  Field computation by moment methods , 1968 .

[4]  Philip L. Roe,et al.  Development of non-dissipative numerical schemes for computational aeroacoustics , 1993 .

[5]  John N. Shadid,et al.  Sparse iterative algorithm software for large-scale MIMD machines: An initial discussion and implementation , 1992, Concurr. Pract. Exp..

[6]  Robert L. Higdon,et al.  Numerical absorbing boundary conditions for the wave equation , 1987 .

[7]  Richard W. Ziolkowski,et al.  Numerical solution of Maxwell's equations in the time domain using irregular nonorthogonal grids , 1988 .

[8]  Philip Roe Linear Bicharacteristic Schemes Without Dissipation , 1998, SIAM J. Sci. Comput..

[9]  M. Krumpholz,et al.  MRTD: new time-domain schemes based on multiresolution analysis , 1996 .

[10]  K. Yee Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media , 1966 .

[11]  Andreas C. Cangellaris,et al.  Point-matched time domain finite element methods for electromagnetic radiation and scattering , 1987 .

[12]  J. Benek,et al.  On applications of chimera grid schemes to store separation , 1985 .

[13]  V. Shankar,et al.  A three-dimensional Maxwell's equation solver for computation of scattering from layered media , 1989 .

[14]  I. G. Kataev,et al.  Electromagnetic Shock Waves , 1966 .

[15]  Keith J. Blow,et al.  Theoretical description of transient stimulated Raman scattering in optical fibers , 1989 .

[16]  S. P. Castillo,et al.  A new finite-difference time-domain algorithm for the accurate modeling of wide-band electromagnetic phenomena , 1993 .

[17]  Jay P. Boris,et al.  Flux-corrected transport. I. SHASTA, a fluid transport algorithm that works , 1973 .

[18]  A. Taflove,et al.  Review of FD-TD numerical modeling of electromagnetic wave scattering and radar cross section , 1989, Proc. IEEE.

[19]  M. Fusco,et al.  A three-dimensional FDTD algorithm in curvilinear coordinates (EM scattering) , 1991 .

[20]  A. Majda,et al.  Absorbing boundary conditions for the numerical simulation of waves , 1977 .

[21]  Jeffrey Paul Thomas,et al.  An investigation of the upwind leapfrog method for scalar advection and acoustic/aeroacoustic wave propagation problems. , 1996 .

[22]  Andrew F. Peterson,et al.  Relative accuracy of several finite-difference time-domain methods in two and three dimensions , 1993 .

[23]  M. Fusco,et al.  FDTD algorithm in curvilinear coordinates (EM scattering) , 1990 .

[24]  R. D. Richtmyer,et al.  A Method for the Numerical Calculation of Hydrodynamic Shocks , 1950 .

[25]  Vijaya Shankar Research to application: Supercomputing trends for the 90's - Opportunities for interdisciplinary computations , 1991 .

[26]  B. T. Nguyen,et al.  The implementation of the upwind leapfrog scheme for 3D electromagnetic scattering on massively parallel computers , 1995 .

[27]  W. F. Hall,et al.  A time-domain differential solver for electromagnetic scattering problems , 1989 .

[28]  K. S. Yee,et al.  Conformal finite difference time domain (FDTD) with overlapping grids , 1992, IEEE Antennas and Propagation Society International Symposium 1992 Digest.