• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.04a
• /
• pp.184-187
• /
• 1987

The method of Conjugate Gradient(C.G.M) is applied to the solution of current distribution from body of revolution (B.O.R).Using the C.G.M it is possible to analyze electrically large arbtrarily oriented B.O.R. The fundamental differences between C.G.M and moment method are outlined. This method converges for any initial guess and this techniqe gurantees a monotonic convergence. Numerical results are presented for electromagnetic case which show good agreement with moment solution.

• Management Science and Financial Engineering
• /
• v.21 no.2
• /
• pp.25-30
• /
• 2015

This short article compares different solution methods for a basic RBC model (Hansen, 1985). We solve and simulate the model using two main algorithms: the methods of perturbation and projection, respectively. One novelty is that we offer a type of the hybrid method: we compute easily a second-order approximation to decision rules and use that approximation as an initial guess for finding Chebyshev polynomials. We also find that the second-order perturbation method is most competitive in terms of accuracy for standard RBC model.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.238-242
• /
• 1994

Shuster's algorithm for spin-axis determination is extended to include sensor bias and mounting angle as its solve-for parameters. The relation between direct and derived measurements bias is obtained by linearizing their kinematic equations. A one-step least-square estimation technique referred to as the 'closed form' solution is used, and the solution provides a more refined and decent initial guess for the subsequent filtering process contained within the differential correction module. The modified algorithm is applied for attitude determination of a GEO communication satellite in transfer orbit, and its results are presented.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1997.10a
• /
• pp.28-31
• /
• 1997

Buckling analysis of thin compressed beam has been carried out. Pre-buckling and post-buckling are simulated by finite element method incorporating with the incremental nonlinear theory and the Newton-Raphson solution technique. In order to find the bifurcation point, the determinent of the stiffness matrix is calculated at every iteration procedure. For post-buckling analysis, a small perturbed initial guess is given along the eigenvector direction at the bifurcation point. Nonlinear elastic buckling and elastic-plastic buckling of cantilever beam are analyzed. The buckling load and buckled shape of the two models are compared.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.2
• /
• pp.130-138
• /
• 1988

The method of conjugate gradient (C.G.M.) is applied to the solution of current distribution from body of revolution(B.O.R.). Using the C.G.M., it is possible to analyze electrically large arbitratily oriented B.O.R.. The fundamental differencess between C.G.M. and moment are outlined. This method converge for any initial guess, and this techniqe guarantees a monotonic convegence. Numerical resulsts are presented for electromagnetic case which shows good agreements with moment solution.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.6
• /
• pp.1810-1818
• /
• 1996

A new finite elemetn approach is introduced for direct prediction of bland shapes and strain distributions from desired final shapes in sheet metal forming. The approach deals with the geometric compatibility of finite elements, plastic deformation theory, minimization of plastic work with constraints, and a proper initial guess. The algorithm developed is applied to cylindrical cup drawing, square cup drawing, and fron fender forming to confirm its validity by demonstratin reasonable accurate numerical results of each problems. Rapid calculation with this algorithm enables easy determination of various process variables for design of sheet metal forming process.

• International Journal of Aeronautical and Space Sciences
• /
• v.18 no.4
• /
• pp.729-739
• /
• 2017

The objective of this study was to optimize minimum-energy impulsive spacecraft intercept using genetic algorithms. A mathematical model was established on two-body system based on f and g solution and universal variable to address spacecraft intercept problem for non-coplanar elliptical orbits. This nonlinear problem includes many local optima due to discontinuity and strong nonlinearity. In addition, since it does not provide a closed-form solution, it must be solved using a numerical method. Therefore, the initial guess is that a very sensitive factor is needed to obtain globally optimal values. Genetic algorithms are effective for solving these kinds of optimization problems due to inherent properties of random search algorithms. The main goal of this paper was to find minimum energy solution for orbit transfer problem. The numerical solution using initial values evaluated by the genetic algorithm matched with results of Hohmann transfer. Such optimal solution for unrestricted arbitrary elliptic orbits using universal variables provides flexibility to solve orbit transfer problems.

• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.231-234
• /
• 1997

This paper presents improved direct method for calculating the closest saddle node bifurcation (CSNB) point, which is also applicable to the selection of appropriate load shedding, reactive power compensation point detection. The proposed method reduced dimension of nonlinear equation compared with that of Dobson's direct method. The improved direct method, utilizing Newton Iterative method converges very quickly. But it diverges if the initial guess is not very close to CSNB. So the direct method is performed with the initial values obtained by carrying out the iterative method twice, which is considered most efficient at this time. Since sparsity techniques can be employed, this method is a good choice to a large scale system on-line application. Proposed method has been tested for 5-bus, New England 30-bus system.

• Communications for Statistical Applications and Methods
• /
• v.13 no.1
• /
• pp.11-17
• /
• 2006

The spacing of inspection times in intermittent inspection is of great interest, and several ways for the determination of inspection times have been proposed. In most inspection schemes including equally spaced inspection and optimally spaced inspection, the best inspection times in each inspection scheme depend on the unknown parameter, and we need an initial guess of the unknown parameter for practical use. Thus it is evident that the efficiency of the resulting inspection scheme highly depends on the choice of the initial value. However, since we can obtain some information about the unknown parameter at each inspection, we may use the accumulated information and adjust the next inspection time. In this paper, we study this sequential determination of the inspection times in optimally spaced inspection.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.105-111
• /
• 1990

In this paper, fast algorithms to generate the codebook of vector quantization in image coding, are proposed. And an efficient algorithm to guess a initial codebook, namely, binary splitting method, is proposed. We generated the initial codebook by binary splitting method and then reduced the searching time using Iterative Optimization algorithm as an alternate to the generalized Lloyd algorithm and several information from binary splitting method. And the searching time and performance can be traded off by varying the searching range. With this proposed algorithm, the computation time can be reduced by a factor of 60 Without any degradation of image quality.