A COMPARISON OF COMPUTATIONAL COMPLEXITIES OF HFEM AND ABC BASED FINITE-ELEMENT METHODS

Authors
NASIR MA CHEW WC RAGHAVAN P HEATH MT
Citation
Ma. Nasir et al., A COMPARISON OF COMPUTATIONAL COMPLEXITIES OF HFEM AND ABC BASED FINITE-ELEMENT METHODS, Journal of electromagnetic waves and applications, 11(12), 1997, pp. 1601-1617
Citations number
21
Journal title
Journal of electromagnetic waves and applications → ACNP
ISSN journal
09205071
Volume
11
Issue
12
Year of publication
1997
Pages
1601 - 1617
Database
ISI
SICI code
0920-5071(1997)11:12<1601:ACOCCO>2.0.ZU;2-O
Abstract
The solution of a hybrid finite element method (HFEM) problem is consi dered. It is shown that a suitable ordering of the FEM mesh results in a canonical HFEM matrix system. This linear system can be solved in O (N-1.5) cost when sparse direct methods are used. This cost is compara ble to FEM methods using approximate boundary conditions and a similar sparse solution method.