• 한국전산유체공학회:학술대회논문집
• /
• 1997.10a
• /
• pp.126-130
• /
• 1997

A new and efficient method is presented for design optimization, which is based on a computational fluid dynamics (CFD). The method is applied to design an airfoil configuration. The Navier-Stokes equations are solved for the viscous analysis of the flow, which provides the object function. The CFD analysis is then coupled with the optimization procedure that used a conjugate gradient method. During the one-dimensional search of the optimization procedure, an approximate flow analysis based on a first-order Taylor series expansion is used to reduce the computational cost, (This study is supported by Korean Ministry of Education through Research Fund)

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.45-48
• /
• 1987

In applications of step-motor, the requirements of small-size and strong-power gave birth to feed-back drive to the maximum efficiency and complete damping. In this paper, a new scheme that determines switching times from sensed values of position and speed is presented for simple bang-bang type drive circuit. The optimal values of each phase switching times are obtained using conjugate gradient method.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.6
• /
• pp.368-375
• /
• 1988

This paper is concerned with the design of the optimal gains of the controller in the speed control system for the induction motor controlled by the microprocessor. The system is modelled with the discrete-time state equation, considering the time delay, for the facility of the optimization techniques. Introducing the conjugate gradient descent method, as the optimization technique, are derived the optimal gains, the gains which give the best transient characteristics. At the optimal gains obtained, the theoretcal transient responses are verified by experimental ones on a 5HP induction motor drive system.

• 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.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.6
• /
• pp.693-702
• /
• 2010

In this paper, FETI(Finite Element Tearing and Interconnecting) method is introduced in order to improve numerical efficiency of Staggered method. The porous media theory, the Staggered method and the FETI method are briefly introduced in this paper. In addition, we account for the MPI(Message Passing Interface) library for parallel analysis, and the proposed combined Staggered method with FETI method. Finally Lagrange multipliers and CG(Conjugate Gradient) algorithm to solve decomposed domain are proposed, and then the proposed method is verified to be numerically efficient by MPI library.

• Proceedings of the Korean Society of Coastal and Ocean Engineers Conference
• /
• 1993.07a
• /
• pp.26-28
• /
• 1993

해안구조물의 설치나 해안환경 문제를 다룰때 가장 필수적인 것이 그 지역에서의 정확한 파랑자료이다. 파랑은 천해로 전파해 옴에 따라 수심 및 지형변화로 인한 회절 및 굴절을 겪으면서 변하게 되므로 복잡한 지형을 가진 해안에서의 정확한 파랑계산은 용이한 일이 아니다. 이러한 파랑변형에 대한 연구는 Berkhoff(1972)가 완경사방정식을 발표한 후 큰 진전을 보이게되는데 이로 인해 종래 개별적으로 다루던 굴절과 회절을 함께 취급할 수 있게 되고 파향선이 교차할때 생기는 불합리한 에너지의 집중(caustics)을 해결할 수 있게 되었다. (중략)

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.70-72
• /
• 2003

전자계 산란의 시간영역 신호는 대응하는 주파수 영역 응답에 대해서도 동시에 효율적인 방법으로 나타낼 수 있는 이유는 다항식의 직교하는 성질 때문이다. 직교 다항식을 이용함으로써, 이른 시간과 낮은 주파수 영역을 동시에 추정할 수 있다 그 접근법은 CGM(Conjugate Gradient Method)방법과 간단한 DFT(Discrete Fourier transform)에 의거한다. 본 논문에서는 Bessel-Chebyshev 함수를 이용한 이른 시간과 낮은 주파수영역 응답을 동시에 추정하기 위한 접근의 방법을 제시하고, 구현하였다. 오직 이른 시간과 낮은 주파수 정보를 필요로 하기 때문에 이 방법으로 계산시 반복계산의 수렴속도가 무척 빠르다는 이점이 있어, 신속한 정보를 얻을 수 있다.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2010.10a
• /
• pp.185-188
• /
• 2010

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.73-84
• /
• 1992

In this paper, an algorithm for recovering the 3-D shape from a single shaded image is proposed. In the proposed algorithm, by using the relation between the height and surface gradient (p, q), a set of linear equations is derived from the linearized reflectance function. Then the 3-D surface is recovered by employing the conjugate gradient technique. In order to improve the convergence speed of the solution, we also employ the hierarchical basis function and multiresolution images in the algorithm. A method for determining the regularization parameter, which is determined by trial and error in the conventional approach, is also introduced. In addition, the proposed algorithm attempts to recover the 3-D surface without requiring the boundary conditions, making it suitable for a real-time implementation. Simulation results for real image as well as synthetic image are provided to demonstrate the performance of the proposed algorithm.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.35-44
• /
• 2009

This paper describes an application of domain decomposition method for parallel finite element analysis which is required to large scale 3D structural analysis. A parallel finite element method system which adopts a domain decomposition method is developed. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay triangulation method is introduced as a basic tool for element generation. Domain decomposition method using automatic mesh generation system holds great benefits for 3D analyses. Aa parallel numerical algorithm for the finite element analyses, domain decomposition method was combined with an iterative solver, i.e. the conjugate gradient(CG) method where a whole analysis domain is fictitiously divided into a number of subdomains without overlapping. Practical performance of the present system are demonstrated through several examples.