2007
DOI: 10.1109/tmtt.2007.897777
|View full text |Cite
|
Sign up to set email alerts
|

Alternating-Direction Implicit Formulation of the Finite-Element Time-Domain Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
24
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 51 publications
(24 citation statements)
references
References 48 publications
0
24
0
Order By: Relevance
“…So, we can come to the conclusion that the LF-FETD and the CN-FETD are mixed versions of the VW-FETD discretized by the central-difference and the Newmark-with , respectively. This may not only justify stability of the CN-FETD for arbitrary large time steps in numerical experiments [17], but also help to decrease dissipation of the US hybrid FETD-FDTD [18]. Furthermore, it shows that our approach to implement the ABC in the mixed FETD formulations is valid and leads to the same result as the VW-FETD truncated with that ABC.…”
Section: Equivalences Between the Mixed Fetd Formulations And Thmentioning
confidence: 88%
See 1 more Smart Citation
“…So, we can come to the conclusion that the LF-FETD and the CN-FETD are mixed versions of the VW-FETD discretized by the central-difference and the Newmark-with , respectively. This may not only justify stability of the CN-FETD for arbitrary large time steps in numerical experiments [17], but also help to decrease dissipation of the US hybrid FETD-FDTD [18]. Furthermore, it shows that our approach to implement the ABC in the mixed FETD formulations is valid and leads to the same result as the VW-FETD truncated with that ABC.…”
Section: Equivalences Between the Mixed Fetd Formulations And Thmentioning
confidence: 88%
“…which is known as the Crank-Nicolson FETD (CN-FETD) [17]. Eliminating the magnetic field variable results in (16) Clearly, this equation is exactly (13) with .…”
Section: Equivalences Between the Mixed Fetd Formulations And Thmentioning
confidence: 99%
“…The ADI formulation for time discretization [4], [14]- [19] is implemented for each time-step, and the following equations are derived:…”
Section: A Adi-fetd Methodsmentioning
confidence: 99%
“…Therefore, local matrixmatrix multiplication can be taken before assembling. Letting , and then assembling the local equations to a global system, the following equations are obtained: Compared to [4], neither global sparse matrix-matrix multiplication nor the matrix inverse is required to be computed before (25)-(28) are solved. Since the matrix in (25) and (27) is a positive definite, the LU factorization is taken only once for all the time iterations in a serial computer.…”
Section: A Adi-fetd Methodsmentioning
confidence: 99%
See 1 more Smart Citation