𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparison of the performance of the finite difference time-domain, finite element time-domain, and planar generalized Yee algorithms of high-performance parallel computers

✍ Scribed by Stephen D. Gedney; Umesh Navsariwala


Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
814 KB
Volume
8
Category
Article
ISSN
0894-3370

No coin nor oath required. For personal study only.

✦ Synopsis


Parallel algorithms for the finite difference time-domain (FDTD), the planar generalized Yee (PGY), and the finite element time-domain (FETD) methods are presented. The FDTD and the PGY algorithms are both explicit time-domain solutions of Maxwell's equations, while the PGY algorithm is based on an unstructured grid. The FETD algorithm is a semi-implicit solution of Maxwell's equations using variational principles, and thus requires a matrix inversion for every time iteration. The three parallel algorithms are based on spatial decompositions of the discrete three-dimensional problem spaces. A comparative analysis of the parallel algorithms is presented based on their memory and computational efficiency as well as their parallel efficiency.


πŸ“œ SIMILAR VOLUMES


A parallel implementation of the finite
✍ K. C. Chew; V. F. Fusco πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 458 KB

In this paper a parallel algorithm is created for solving electromagnetic wave scattering problems. The algorithm based on the finite difference time-domain (FDTD) representation of the Maxwell's equations written in 3L Parallel Fortran for use on a transputer array. The problem simulated consists

An efficient implementation of the finit
✍ Umesh D. Navsariwala; Stephen D. Gedney πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 3 views

An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges

A hybrid finite element/finite differenc
✍ A. Monorchio; A. Cidronali; G. Manara; G. Pelosi πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 273 KB πŸ‘ 2 views

A comprehensive simulation procedure is presented for describing the behaviour of high-frequency "eld e!ect transistors (FETs). It combines a circuit model of the intrinsic part of the device with a hybrid "nite elements/"nite di!erences (FE/FD) technique directly implemented in time domain (TD). Th

Assessment of the performances of first-
✍ Salvatore Caorsi; Gaia Cevini πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 153 KB

## Abstract In this paper we investigate the performances of first‐ and second‐order time‐domain absorbing boundary conditions (ABCs) when introduced in a finite‐element algorithm to solve electromagnetic scattering problems. Attention is focused on the analysis of the ABC's absorbing characteristi

Comparison of scattering parameter calcu
✍ S. Kosanovich; R. Mittra πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 296 KB πŸ‘ 2 views

and is divided into five uniform segments. For the explicit scheme, the time sample was chosen as 0.053 LM. The Ž . current at the location 0.0; y0.1 is shown in Figure 4. Again, the agreement is good, and it is seen that for the implicit scheme, one can make ⌬ t large and violate the Courant stabil