• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.7
• /
• pp.1076-1085
• /
• 2001

In this paper, the FMM(Fast Multipole Method) combined with GMRES(Generalized Minimal RESidual Method) matrix solver is used to extract the parasitic impedance for complicated 3-D structures in uniform dielectric materials which limit the use of MoM(Method of Moment) due to its large computation time and memory requirement. This algorithm is a fast multipole-accelerated method based on quasistatic analysis and is very efficient for computing impedance between conductors. This paper proved the accuracy and efficiency of the FMM by comparing with MoM in simple examples. Finally the parasitic impedance of FC-PGA(Flip Chip Pin Grid Array) Package pins has been extracted by this algorithm and we have considered the possibility of the EMI/EMC problem caused by the signal interference.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.37 no.5
• /
• pp.441-448
• /
• 2013

This paper presents the fast multipole boundary element method (FM-BEM) as a new BEM solution methodology that overcomes many disadvantages of conventional BEM. In conventional BEM, large-scale problems cannot be treated easily because the computation time increases rapidly with an increase in the number of boundary elements owing to the dense coefficient matrix. Analysis results are obtained to compare FM-BEM with conventional BEM in terms of computation time and accuracy for a simple two-dimensional steady-state heat conduction problem. It is confirmed that the FM-BEM solution methodology greatly enhances the computation speed while maintaining solution accuracy similar to that of conventional BEM. As a result, the theory and implementation algorithm of FM-BEM are discussed in this study.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.3
• /
• pp.446-452
• /
• 2008

To design a spiral inductor a genetic algorithm is applied with fast computing technique. For the inductance extraction of the given geometry the fast multipole method is used, also the distributed computing technique using 10 personal computers is introduced for the massive computation of the genetic algorithm. A few important design parameters are used as genes for the optimization in the genetic algorithm. The target function is chosen as mean square error of the inductance at several sampling frequency points. A large-scaled inductor is fabricated and compared with the simulated data.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1790-1795
• /
• 2009

For GPR(Ground Penetrating Radar) applications, an accurate analysis of the scattered field is necessary to identify the unknown target. Dyadic Green's function of the multilayered medium is developed and applied to analysis of the underground conducting object. We used method of moment(MOM) with dyadic Green's function, and Discrete Complex Image Method(DCIM). To reduce the computational complexity, fast multipole method is introduced and we showed the accuracy of the method comparing with the conventional method of moment. For investigating the underground conducting target, several numerical experiments were accomplished using this method.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.6
• /
• pp.735-745
• /
• 1998

The method of moments has been widely used in the analysis of TM scattering problems. Recently, significant advances in the development of fast and efficient techniques for solving large problems have been reported. In such methods, iterative matrix solvers are preferred by virtue of their speed and low memory requirements. But for near resonant and strong multiple scattering problems, e.g., involving an aircraft engine inlet, a large number of iterations is required for convergence. In this paper, an efficient approximate inverse based preconditioner is used to reduce this number of iterations. By using the matrix partitioning method, the computational is used to reduce this number of iterations. By using the matrix partitioning method, the computational cost for obtaining the approximate inverse is reduced to O(N). We apply this preconditioner to an O(NlogN) algorithm, the multilevel fast multipole algorithm, for the aircraft engine inlet problem. The numerical results show the efficiency of this preconditioner.

• Bulletin of the Korean Chemical Society
• /
• v.24 no.6
• /
• pp.733-738
• /
• 2003

Linear scaling quantum theories are reviewed especially focusing on the method adopted in GAMESS. The three key translation equations of the fast multipole method (FMM) are deduced from the general polypolar expansions given earlier by Steinborn and Ruedenberg. Simplifications are introduced for the rotation-based FMM that lead to a very compact FMM formalism. The OPS (optimum parameter searching) procedure, a stable and efficient way of obtaining the optimum set of FMM parameters, is established with complete control over the tolerable error ε. In addition, a new parallel FMM algorithm, requiring virtually no inter-node communication, is suggested which is suitable for the parallel construction of Fock matrices in electronic structure calculations.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.4
• /
• pp.561-568
• /
• 2010

Instrumentation radar in a test range has an important role to measure target's TSPI(time, space, position, information). It is well known that it tracks a target stably using a beacon mode. But it may fail to track a target in a certain region using a beacon mode. In this paper, we modeled a simple missile shape similar to ATCMS with two beacon antenna and analyzed an antenna radiation pattern using MLFMM(Multi Level Fast Multipole Method) method. Using the analyzed result of the radiation pattern of the antenna and the attitude data of target, we simulated beacon tracking performance of an instrumentation radar. As a result of simulation, we showed that an instrumentation radar may lose the target because it tracks a area of the beacon antenna pattern.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.3
• /
• pp.167-170
• /
• 2018

The method of moments(MoM) is one of the most popular integral-equation-based full-wave simulation methods, and the multi-level fast multipole method(MLFMM) algorithm can be used for its efficient calculation. When calculating the surface current on the large scatterer in the MoM or MLFMM, iterative methods for the final matrix inversion are used. Among them, BiCGstab(l) has been widely adopted due to its good convergence rate. The number of iterations can be reduced when l becomes larger, but the number of operations per iteration is increased. Herein, we analyze the computational complexity of BiCGstab(l) in the MLFMM method and propose an optimum choice of l.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.6
• /
• pp.972-982
• /
• 2001

FMM(Fast Multipole Method) is suitable numerical method for radar cross section calculation of arbitrary large conducting bodies due to reduction of computation time. The accuracy of the numerical results, however, can influenced by selection of grouping method and segment length, in particular, far the case that cross section of the scatter is of the narrow width elliptical type. So, we describe the FMM method which can be deal effectively with such difficulties for both TM and TE polarization case. In order to check the present method the results are compared with those obtained by Method of Moments.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.2 no.1
• /
• pp.27-39
• /
• 1998

We describe a fast numerical method for non-separable elliptic equations in self-adjoin form on irregular adaptive domains. One of the most successful results in numerical PDE is developing rapid elliptic solvers for separable EPDEs, for example, Fourier transformation methods for Poisson problem on a square, however, it is known that there is no rapid elliptic solvers capable of solving a general nonseparable problems. It is the purpose of this paper to present an iterative solver for linear EPDEs in self-adjoint form. The scheme discussed in this paper solves a given non-separable equation using a sequence of solutions of Poisson equations, therefore, the most important key for such a method is having a good Poison solver. High performance is achieved by using a fast high-order adaptive Poisson solver which requires only about 500 floating point operations per gridpoint in order to obtain machine precision for both the computed solution and its partial derivatives. A few numerical examples have been presented.