This communication presents a formulation that allows to use hierarchical basis preconditioners applicable to the electric field integral equation (EFIE) on multiply connected geometries without searching for global loops. Currently available hierarchical basis preconditioners need an explicit representation of global loops. Finding these requires a computational complexity exceeding the linearithmic complexity of fast matrix-vector multiplication methods. Instead of using an explicit representation of global loops, we utilize Helmholtz projectors to regularize the EFIE separately on the solenoidal, non-solenoidal, and harmonic Helmholtz subspaces. Thereby, we avoid the explicit recovery of the global loops and maintain the leading complexity of fast multiplication methods. Numerical results prove the effectiveness of the proposed approach.

Hierarchical Bases Preconditioners for the Electric Field Integral Equation on Multiply Connected Geometries / Adrian, S. B.; Andriulli, FRANCESCO PAOLO; Eibert, T. F.. - In: IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION. - ISSN 0018-926X. - 62:11(2014), pp. 5856-5861. [10.1109/TAP.2014.2347392]

Hierarchical Bases Preconditioners for the Electric Field Integral Equation on Multiply Connected Geometries

ANDRIULLI, FRANCESCO PAOLO;
2014

Abstract

This communication presents a formulation that allows to use hierarchical basis preconditioners applicable to the electric field integral equation (EFIE) on multiply connected geometries without searching for global loops. Currently available hierarchical basis preconditioners need an explicit representation of global loops. Finding these requires a computational complexity exceeding the linearithmic complexity of fast matrix-vector multiplication methods. Instead of using an explicit representation of global loops, we utilize Helmholtz projectors to regularize the EFIE separately on the solenoidal, non-solenoidal, and harmonic Helmholtz subspaces. Thereby, we avoid the explicit recovery of the global loops and maintain the leading complexity of fast multiplication methods. Numerical results prove the effectiveness of the proposed approach.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2678976
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo