TY - JOUR
T1 - Fast direct solver for essentially convex scatterers using multilevel non-uniform grids
AU - Brick, Yaniv
AU - Lomakin, Vitaliy
AU - Boag, Amir
PY - 2014/8
Y1 - 2014/8
N2 - A fast algorithm for the direct solution of the method of moments (MoM) systems of equations describing scattering from essentially convex bodies is presented. The algorithm reveals the ranks of interactions between subdomains and compresses the system to that of interacting unknowns only. The procedure is facilitated by representing the interactions via non-uniform sampling grids (NGs). In a multilevel procedure, the interactions' "skeletons," revealed at each level of the subdomain hierarchy, are aggregated and recompressed. The algorithm is demonstrated here for the generalized equivalence integral equation (GEIE). This recently introduced integral representation, relying on a generalized equivalence theorem, is highly compressible for convex scatterers. The algorithm is detailed, including the treatment of computational bottlenecks by using NG-approach schemes that are tailored to the GEIE formulation. For the essentially circular case, compression to O{script}(1) unknowns at an O{script}(N log N) computational complexity with O{script}(N) storage is demonstrated.
AB - A fast algorithm for the direct solution of the method of moments (MoM) systems of equations describing scattering from essentially convex bodies is presented. The algorithm reveals the ranks of interactions between subdomains and compresses the system to that of interacting unknowns only. The procedure is facilitated by representing the interactions via non-uniform sampling grids (NGs). In a multilevel procedure, the interactions' "skeletons," revealed at each level of the subdomain hierarchy, are aggregated and recompressed. The algorithm is demonstrated here for the generalized equivalence integral equation (GEIE). This recently introduced integral representation, relying on a generalized equivalence theorem, is highly compressible for convex scatterers. The algorithm is detailed, including the treatment of computational bottlenecks by using NG-approach schemes that are tailored to the GEIE formulation. For the essentially circular case, compression to O{script}(1) unknowns at an O{script}(N log N) computational complexity with O{script}(N) storage is demonstrated.
KW - Algorithms
KW - fast solvers
KW - integral equations
KW - moment methods
UR - http://www.scopus.com/inward/record.url?scp=84905734577&partnerID=8YFLogxK
U2 - 10.1109/TAP.2014.2327651
DO - 10.1109/TAP.2014.2327651
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84905734577
SN - 0018-926X
VL - 62
SP - 4314
EP - 4324
JO - IEEE Transactions on Antennas and Propagation
JF - IEEE Transactions on Antennas and Propagation
IS - 8
M1 - 6824171
ER -