• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.1
• /
• pp.22-28
• /
• 1990

This paper is a study on the reduction of computation time in case of nonlinear magnetic field analysis by finite element method and Newton-Raphson method. For the purpose, the nonlinear convergence equation is computed by the conjugate gradient method which is known to be applicable to symmetric positive definite matrix equations only. As the results, we can not prove mathematically that the system Jacobian is positive definite, but when we applied this method, the diverging case did not occur. And the computation time is reduced by 25-55% and 15-45% in comparison with the case of direct and successive over-relaxation method, respectively. Therefore, we proved the utility of conjugate gradient method.

• Journal of information and communication convergence engineering
• /
• v.2 no.3
• /
• pp.177-181
• /
• 2004

In this paper, we suggest an Iris recognition system with an excellent recognition rate and confidence as an alternative biometric recognition technique that solves the limit in an existing individual discrimination. For its implementation, we extracted coefficients feature values with the wavelet transformation mainly used in the signal processing, and we used neural network to see a recognition rate. However, Scale Conjugate Gradient of nonlinear optimum method mainly used in neural network is not suitable to solve the optimum problem for its slow velocity of convergence. So we intended to enhance the recognition rate by using Levenberg-Marquardt Back-propagation which supplements existing Scale Conjugate Gradient for an implementation of the iris recognition system. We improved convergence velocity, efficiency, and stability by changing properly the size according to both convergence rate of solution and variation rate of variable vector with the implementation of an applied algorithm.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.4
• /
• pp.811-837
• /
• 2021

In this paper, we propose a new conjugate gradient method for solving unconstrained optimization models. By using exact and strong Wolfe line searches, the proposed method possesses the sufficient descent condition and global convergence properties. Numerical results show that the proposed method is efficient at small, medium, and large dimensions for the given test functions. In addition, the proposed method was applied to solve practical application problems in portfolio selection.

• Journal of Korean Society of Transportation
• /
• v.23 no.3 s.81
• /
• pp.61-71
• /
• 2005

We evaluated the availability of Origin-Destination Matrix from traffic counts Using conjugate gradient method to large scale networks by applying it to the networks in 246 zones. As a result of the analysis of the consistency of the model on Nationwide Networks, the upper and lower levels in model had the systematic relationship internally. From the analysis of the estimable power or the model according to the number of traffic counting links, the error in traffic volume had the estimable power in the range of permissible error. In addition, the estimable power of estimation of an Origin-Destination Matrix was more satisfactory than that of existing methods. We conclude that conjugate gradient method cab be applied to nationwide networks if we can make sure that the algorithm of the developed model is reliable by doing various kinds of experiment.

• Structural Engineering and Mechanics
• /
• v.88 no.4
• /
• pp.301-309
• /
• 2023

In this paper, a new modified conjugate gradient (MCG) method is presented which is based on a new gradient regularizer, and this method is used to identify the dynamic load on airfoil structure without and with considering random structure parameters. First of all, the newly proposed algorithm is proved to be efficient and convergent through the rigorous mathematics theory and the numerical results of determinate dynamic load identification. Secondly, using the perturbation method, we transform uncertain inverse problem about force reconstruction into determinate load identification problem. Lastly, the statistical characteristics of identified load are evaluated by statistical methods. Especially, this newly proposed approach has successfully solved determinate and uncertain inverse problems about dynamic load identification. Numerical simulations validate that the newly developed method in this paper is feasible and stable in solving load identification problems without and with considering random structure parameters. Additionally, it also shows that most of the observation error of the proposed algorithm in solving dynamic load identification of deterministic and random structure is respectively within 11.13%, 20%.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.343-346
• /
• 1998

In this paper a radiation problem for a finite microstrip antenna structure is analyzed. For the analysis of finite structures we utilize the equivalent volume current. Intergral equation for the unknown equivalent volume current induced on a finite microstrip structure is derived and solved by the use of conjugate gradient-fast fourier. transform (CG-FFT) method. Some numerical examples are radiation patterns derived by the equivalent volume current solved by the conjugate gradient-fast fourier transform.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.1
• /
• pp.99-106
• /
• 1999

An accelerated optimization technique combined with a stepwise deflation procedure is presented for the efficient evaluation of a few of the smallest eigenvalues and their corresponding eigenvectors of the generalized eigenproblems. The optimization is performed on the Rayleigh quotient of the deflated matrices by the aid of a preconditioned conjugate gradient scheme with the incomplete Cholesky factorization.

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

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.169-180
• /
• 2006

We study convergence of multisplitting method associated with a block diagonal conformable multisplitting for solving a linear system whose coefficient matrix is a symmetric positive definite matrix which is not an H-matrix. Next, we study the validity of m-step multisplitting polynomial preconditioners which will be used in the preconditioned conjugate gradient method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1991.10a
• /
• pp.6-22
• /
• 1991

This thesis presents a parallel implementation of an iterative method for large scale, sparse linear system and gives result of computational experiments performed on both single transputer and multi transputer parallel computers. To solve linear system, we use conjugate gradient method and develope data storage techinique, data communication scheme. In addition to the explanation of conjugate gradient method, the result of computational experiment is summarized.