2017
DOI: 10.1109/tap.2016.2647587
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Domain Decomposition Parallel Scheme for Leapfrog ADI-FDTD Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0
1

Year Published

2017
2017
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(6 citation statements)
references
References 29 publications
0
5
0
1
Order By: Relevance
“…To accelerate the numerical solution of the discretized Maxwell equations, domain decomposition parallelization schemes have been studied, aiming at partitioning the computational domain into several subdomains [24], [25]. The solution of the update equations at each subdomain is allocated to a different processing unit and subsequently, the individual solutions are combined to derive a solution for the entire domain.…”
Section: Related Workmentioning
confidence: 99%
“…To accelerate the numerical solution of the discretized Maxwell equations, domain decomposition parallelization schemes have been studied, aiming at partitioning the computational domain into several subdomains [24], [25]. The solution of the update equations at each subdomain is allocated to a different processing unit and subsequently, the individual solutions are combined to derive a solution for the entire domain.…”
Section: Related Workmentioning
confidence: 99%
“…In this systematic study, the efficient direct-splitting-based CN-FDTD (CNDS-FDTD) method with the CFS-PML scheme is proposed based on the auxiliary differential equation (ADE) method to model 3D all-dielectric photonic nanostructures with monolayer BP metasurfaces in the infrared Terahertz range. The CFS-CNDS-FDTD not only possess higher efficiency than the alternating-direction-implicit FDTD (ADI-FDTD) method [43][44][45][46] due to owning fewer loops at each time step, but is suitable for parallel computation [47][48][49] which can be used to further reduce CPU time [39].…”
Section: Introductionmentioning
confidence: 99%
“…This was demonstrated in a number of studies that great efficiency gain of FDTD can be achieved through GPU acceleration. [16][17][18] Considerable research efforts have been devoted to multi-CPU based parallel implementations of unconditionallystable FDTD methods, namely, for ADI-FDTD, 19 for LOD-FDTD, 20 for leapfrog ADI-FDTD, 21 etc. However, these implementations cannot be simply extended to GPU environment because of the different hardware structure and execution models.…”
Section: Introductionmentioning
confidence: 99%