Abstract
We analyze the performance of flnite-difierence time- domain (FDTD) method implementations for 2D and 3D problems. Implementations in Fortran, C and C++ (with Blitz++ library) languages and performance tests on several hardware setups (AMD, Intel i5, Intel Xeon) are considered. The performance of implementations using traditional FDTD algorithm for the largest size of test problem is limited by the bandwidth of computer random- accessed memory (RAM). Our implementations are compared with a commercial simulation software package Lumerical FDTD Solutions and an open source project Meep.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
