An efficient implementation of the finite-element time-domain algorithm on parallel computers using a finite-element tearing and interconnecting algorithm

✍ Scribed by Umesh D. Navsariwala; Stephen D. Gedney

• Publisher: John Wiley and Sons
• Year: 1997
• Tongue: English
• Weight: 135 KB
• Volume: 16
• Category: Article
• ISSN: 0895-2477
• DOI: 10.1002/(sici)1098-2760(199711)16:4<204::aid-mop3>3.0.co;2-p

✦ Synopsis

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 at a rate dependent solely on the subdomain size, resulting in a highly scalable algorithm.