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

An Efficient Mode-Based Domain Decomposition Hybrid 2-D/Q-2D Finite-Element Time-Domain Method for Power/Ground Plate-Pair Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…The spatial DGTD operations, like FVM, are localized, and the global mass matrix can be transformed and divided into a block diagonal mass matrix. The mass matrix block's inversion and storage [77] are performed before initiating time marching. This makes the solver of DGTD very compact, especially when using explicit integration methods.…”
Section: Discontinuous Galerkin Time-domain Methods With Sibcmentioning
confidence: 99%
“…The spatial DGTD operations, like FVM, are localized, and the global mass matrix can be transformed and divided into a block diagonal mass matrix. The mass matrix block's inversion and storage [77] are performed before initiating time marching. This makes the solver of DGTD very compact, especially when using explicit integration methods.…”
Section: Discontinuous Galerkin Time-domain Methods With Sibcmentioning
confidence: 99%
“…The spatial DGTD operations, like FVM, are localized, and the global mass matrix is transformed and divided into a block diagonal mass matrix. The inversion and storage of the mass matrix block [78] are performed before initiating time marching. This makes the solver of DGTD very compact, especially when using explicit integration methods.…”
Section: Discontinuous Galerkin Time-domain Methods With Sibcmentioning
confidence: 99%
“…This localization translates into a global mass matrix being divided into block-diagonal mass matrices. The inversion and storage of these massmatrix blocks (as would be constructed by the finite element time-domain (FETD) method [89]) are carried out before the time marching starts. This renders the resulting DGTD-based solver very compact (efficient with a very small memory imprint) especially when an explicit integration method is used for time marching.…”
Section: Discontinuous Galerkin Time-domain Methodsmentioning
confidence: 99%