IEEE Antennas and Propagation Society International Symposium. 1996 Digest
DOI: 10.1109/aps.1996.549554
|View full text |Cite
|
Sign up to set email alerts
|

An unconditionally stable parallel finite element time domain algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 7 publications
0
11
0
Order By: Relevance
“…e dt: W i is the vector basis function [21] associated with edge i, and e i is the unknown coefficient, which is the circulation of the electric field along the edge i. For time discretization, the Newmark-beta scheme is used [3,5]. Therefore, Eq.…”
Section: Continuous Boundary Value Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…e dt: W i is the vector basis function [21] associated with edge i, and e i is the unknown coefficient, which is the circulation of the electric field along the edge i. For time discretization, the Newmark-beta scheme is used [3,5]. Therefore, Eq.…”
Section: Continuous Boundary Value Problemmentioning
confidence: 99%
“…Recently, the finite-element time-domain (FETD) algorithm has been introduced for the analysis of time-dependent electromagnetic field [1][2][3][4][5][6][7][8][9][10]. This algorithm has the advantage of higher accuracy and lower dispersion errors when compared with the finite-difference time-domain (FDTD) method [11].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Present generation high-performance parallel computers can provide these computational resources, but these resources can not be fully exploited using traditional sequential algorithms for solving matrix equations which can be highly inefficient on parallel computers. As a result, the parallel efficiency and computation time suffer [2]. The finite-element tearing and interconnecting (FETI) algorithm presents an alternative method to solve the matrix equation.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, an implicit FETD often has to resort to iterative solvers for large problems to avoid excessive memory usage. An alternative approach to solving this problem is to divide the original computation domain into several smaller subdomains [2,4].…”
Section: Introductionmentioning
confidence: 99%