Premium
An efficient implementation of the finite‐element time‐domain algorithm on parallel computers using a finite‐element tearing and interconnecting algorithm
Author(s) -
Navsariwala Umesh D.,
Gedney Stephen D.
Publication year - 1997
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/(sici)1098-2760(199711)16:4<204::aid-mop3>3.0.co;2-p
Subject(s) - finite element method , feti , tearing , domain decomposition methods , scalability , algorithm , computer science , domain (mathematical analysis) , element (criminal law) , parallel algorithm , parallel computing , computational science , mathematics , engineering , structural engineering , mechanical engineering , mathematical analysis , database , law , political science
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 converges at a rate dependent solely on the subdomain size, resulting in a highly scalable algorithm. © 1997 John Wiley & Sons, Inc. Microwave Opt Technol Lett 16:204–208, 1997.