A parallel finite-element tearing and interconnecting algorithm for solution of the vector wave equation with PML absorbing medium

A domain decomposition method based on the finite-element tearing and interconnecting (FETI) algorithm is presented for the solution of the large sparse matrices associated with the finite-element method (FEM) solution of the vector wave equation. The FETI algorithm is based on the method of Lagrang...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on antennas and propagation Ročník 48; číslo 2; s. 278 - 284
Hlavní autori: Wolfe, C.T., Navsariwala, U., Gedney, S.D.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.02.2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Absorption
Algorithms
Finite element method
Finite element methods
Gradient methods
Iterative algorithms
Iterative methods
Lagrangian functions
Mathematical analysis
Mathematical models
Parallel algorithms
Partial differential equations
Partitioning algorithms
Perfectly matched layers
Reduced order systems
Sparse matrices
Tearing
Wave equations
ISSN:0018-926X, 1558-2221
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A domain decomposition method based on the finite-element tearing and interconnecting (FETI) algorithm is presented for the solution of the large sparse matrices associated with the finite-element method (FEM) solution of the vector wave equation. The FETI algorithm is based on the method of Lagrange multipliers and leads to a reduced-order system, which is solved using the biconjugate gradient method (BiCGM). It is shown that this method is highly scalable and is more efficient on parallel platforms when solving large matrices than traditional iterative methods such as a preconditioned conjugate gradient algorithm. This is especially true when a perfectly matched layer (PML) absorbing medium is used to terminate the problem domain.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0018-926X
1558-2221
DOI:10.1109/8.833077