2016
DOI: 10.1155/2016/8749071
|View full text |Cite
|
Sign up to set email alerts
|

2D Efficient Unconditionally Stable Meshless FDTD Algorithm

Abstract: This paper presents an efficient weighted Laguerre polynomials based meshless finite-difference time domain (WLP-MFDTD). By decomposing the coefficients of the system matrix and adding a perturbation term, a factorization-splitting scheme is introduced. The huge sparse matrix is transformed into two N×N matrices with 9 unknown elements in each row regardless of the duplicated ones. Consequently, compared with the conventional implementation, the CPU time and memory requirement can be saved greatly. The perfect… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Furthermore, the alternating direction implicit finite-difference time-domain (ADI-FDTD) method incorporates the advantages of both the explicit and implicit formats, namely, relatively simple calculation and unconditional stability [8]. Although the weighted Laguerre polynomials based spectral finite-difference time-domain (WLP-SFDTD) scheme for periodic structure analysis is efficient, solving the correspondingly huge banded system matrix is time-consuming [9]. One has to use the sparse lower-upper (LU) factorization packages or add a perturbation term.…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, the alternating direction implicit finite-difference time-domain (ADI-FDTD) method incorporates the advantages of both the explicit and implicit formats, namely, relatively simple calculation and unconditional stability [8]. Although the weighted Laguerre polynomials based spectral finite-difference time-domain (WLP-SFDTD) scheme for periodic structure analysis is efficient, solving the correspondingly huge banded system matrix is time-consuming [9]. One has to use the sparse lower-upper (LU) factorization packages or add a perturbation term.…”
Section: Introductionmentioning
confidence: 99%