2012
DOI: 10.1109/tap.2012.2207330
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of Block Size for CBFM in MoM

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 25 publications
(14 citation statements)
references
References 18 publications
0
14
0
Order By: Relevance
“…is more than or equals to N and M. Therefore, the order of the computational cost in the HO-CBFM is nearly independent of L when L is sufficiently small in comparison with N and M. As a result, it can be said that the minimum CPU time of the HO-CBFM is approximately O(N 7/3 ) when M = 0.9N 1/3 [4]. On the other hand, the computer memory cannot be saved using the HO-CBFM because the full impedance matrix must be obtained and stored in the computer memory; however, the computer memory of the HO-CBFM can be saved when the impedance matrix is stored on a hard disk.…”
Section: Matrix Filling Timementioning
confidence: 99%
See 1 more Smart Citation
“…is more than or equals to N and M. Therefore, the order of the computational cost in the HO-CBFM is nearly independent of L when L is sufficiently small in comparison with N and M. As a result, it can be said that the minimum CPU time of the HO-CBFM is approximately O(N 7/3 ) when M = 0.9N 1/3 [4]. On the other hand, the computer memory cannot be saved using the HO-CBFM because the full impedance matrix must be obtained and stored in the computer memory; however, the computer memory of the HO-CBFM can be saved when the impedance matrix is stored on a hard disk.…”
Section: Matrix Filling Timementioning
confidence: 99%
“…In the CBFM, the original N × N matrix equation is reduced to a smaller M 2 × M 2 matrix equation, and the reduced matrix is solved by the Gauss-Jordan method, where N is the number of segments and M is the number of blocks, respectively. It has been shown that the minimum CPU time of the CBFM is O(N 7/3 ) when the number of blocks M ≈ 0.9N 1/3 [4]. In our research, the CBFM has been applied to the numerical analyses of small antennas in the vicinity of dielectric objects [5], [6].…”
Section: Introductionmentioning
confidence: 99%
“…However, because the FMM and CBFM include many parameters to speed up the numerical analysis, it is still a challenging work to find a relation between these parameters and computation cost. Konno et al, have derived the computational cost of the FMM and CBFM analytically and demonstrated that the computational cost of the FMM depends on the shape and dimensions of analysis model while that of the CBFM does not [15], [16]. It was also found that the iterative algorithm is very effective in solving the impedance matrix equation, which is very time-consuming process in the MoM analysis of large-scale array antennas.…”
Section: Computational Electromagnetics For Large-scale Array Antennasmentioning
confidence: 99%
“…As illustrated in (6), the ratio between the primary CBFs is in turn identical to the ratio of the applied voltage excitation coefficients of the subdomains and , i.e., the -coefficients defined in (1). The DGFM therefore does not require the initial calculation of a set of primary CBFs, which is of and increases to when adding also secondary CBFs, as discussed in [19], at the cost of compromising the solution accuracy only slightly.…”
Section: B Comparing the Dgfm With Mbf Techniquesmentioning
confidence: 99%