Premium
A three‐dimensional mesh refinement algorithm with low boundary reflections for the finite‐difference time‐domain simulation of metallic structures
Author(s) -
Pernice W. H. P.,
Payne F. P.,
Chaloulos K.,
Gallagher D. F. G.
Publication year - 2009
Publication title -
international journal of numerical modelling: electronic networks, devices and fields
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.249
H-Index - 30
eISSN - 1099-1204
pISSN - 0894-3370
DOI - 10.1002/jnm.730
Subject(s) - interpolation (computer graphics) , grid , boundary (topology) , algorithm , finite difference , domain (mathematical analysis) , computer science , finite difference method , boundary value problem , time domain , computational science , mathematics , geometry , mathematical analysis , computer graphics (images) , computer vision , animation
We present a method for including areas of high grid density into a general grid for the finite‐difference time‐domain method in three dimensions. Reflections occurring at the boundaries separating domains of different grid size are reduced significantly by introducing appropriate interpolation methods for missing boundary points. Several levels of refinement can be included into one calculation using a hierarchical refinement architecture. The algorithm is implemented with an auxiliary differential equation technique that allows for the simulation of metallic structures. We illustrate the performance of the algorithm through the simulation of metal nano‐particles included in a coarser grid and by investigating gold optical antennas. Copyright © 2009 John Wiley & Sons, Ltd.