File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient FDTD algorithm with isotropic numerical dispersion on an overlapped lattice

TitleEfficient FDTD algorithm with isotropic numerical dispersion on an overlapped lattice
Authors
Issue Date1998
Citation
Ieee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1998, v. 4, p. 1812-1815 How to Cite?
AbstractA second order algorithm is developed for electromagnetics on an overlapped discrete lattice and the results are compared with the standard Yee algorithm. The present algorithm maintains the locality and simplicity of the Yee algorithm while improving on errors introduced by numerical dispersion. In addition, the present algorithm is stable for time steps larger than those required for the Yee algorithm. For a given physical problem and a given error bound, the present algorithm is shown to require approximately half the memory of the Yee algorithm and only one half to one third the computation time due to its improved isotropic numerical dispersion and increased time step.
Persistent Identifierhttp://hdl.handle.net/10722/182888
ISSN

 

DC FieldValueLanguage
dc.contributor.authorForgy, EAen_US
dc.contributor.authorChew, WCen_US
dc.date.accessioned2013-05-02T05:17:32Z-
dc.date.available2013-05-02T05:17:32Z-
dc.date.issued1998en_US
dc.identifier.citationIeee Antennas And Propagation Society, Ap-S International Symposium (Digest), 1998, v. 4, p. 1812-1815en_US
dc.identifier.issn0272-4693en_US
dc.identifier.urihttp://hdl.handle.net/10722/182888-
dc.description.abstractA second order algorithm is developed for electromagnetics on an overlapped discrete lattice and the results are compared with the standard Yee algorithm. The present algorithm maintains the locality and simplicity of the Yee algorithm while improving on errors introduced by numerical dispersion. In addition, the present algorithm is stable for time steps larger than those required for the Yee algorithm. For a given physical problem and a given error bound, the present algorithm is shown to require approximately half the memory of the Yee algorithm and only one half to one third the computation time due to its improved isotropic numerical dispersion and increased time step.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)en_US
dc.titleEfficient FDTD algorithm with isotropic numerical dispersion on an overlapped latticeen_US
dc.typeConference_Paperen_US
dc.identifier.emailChew, WC: wcchew@hku.hken_US
dc.identifier.authorityChew, WC=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0031621585en_US
dc.identifier.volume4en_US
dc.identifier.spage1812en_US
dc.identifier.epage1815en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridForgy, EA=6603364837en_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats