2008
DOI: 10.2528/pier08012003
|View full text |Cite
|
Sign up to set email alerts
|

Multilevel Fast Multipole Algorithm for Radiation Characteristics of Shipborne Antennas Above Seawater

Abstract: Abstract-Radiation characteristics of shipborne antennas above lossy half-space are studied using the multilevel fast multipole algorithm (MLFMA). The near terms in the MLFMA are evaluated by using the rigorous half-space dyadic Green's function, computed via the method of complex images. The far MLFMA interactions employ an approximate dyadic Green's function via a direct-radiation term plus a single real image, with the image amplitude characterized by the polarization-dependent Fresnel reflection coefficien… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
11
0

Year Published

2008
2008
2013
2013

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 23 publications
(50 reference statements)
0
11
0
Order By: Relevance
“…Additionally, the memory needed to store the reduced matrix can be a problem as well. One of the most common approaches to ease the burden on the computational resources entails storing only the near-field terms of the Method of Moments (MoM) coupling matrix and computing the far-field interactions via the MLFMA, [3][4][5][6][7]. With MLFMA, the whole geometry is compartmentalized into several first-level cubical groups, which, in turn, generate higher-order cubes as they are grouped.…”
Section: Introductionmentioning
confidence: 99%
“…Additionally, the memory needed to store the reduced matrix can be a problem as well. One of the most common approaches to ease the burden on the computational resources entails storing only the near-field terms of the Method of Moments (MoM) coupling matrix and computing the far-field interactions via the MLFMA, [3][4][5][6][7]. With MLFMA, the whole geometry is compartmentalized into several first-level cubical groups, which, in turn, generate higher-order cubes as they are grouped.…”
Section: Introductionmentioning
confidence: 99%
“…It usually requires O(N 2 ) memory to store the impedance matrix and O(N 2 ) operations to perform the matrix-vector product via an iterative solver, where N is the number of unknowns. The memory requirements and CPU time for solving the matrix equation are dramatically reduced by using some fast algorithms in the MoM such as Precorrected-FFT method (P-FFT) [7,8], Adaptive Integral Method (AIM) [9][10][11][12][13][14] and Multilevel Fast Multipole Algoithm (MLFMA) [15,16].…”
Section: Introductionmentioning
confidence: 99%
“…This module is based on parallelized MoM (Method of Moments) with MLFMM (Multilevel Fast Multipole Method) [6][7][8][9] and CBFM (Characteristics Basis Function Method) [10] to reduce the CPU-time and memory requirements for problems of a single excitation (antennas) or multiple excitations (monostatic RCS) [11]. To solve very large problems, a new algorithm based on "domain decomposition" has been successfully implemented for previous versions of the code.…”
Section: Introductionmentioning
confidence: 99%