• Title/Summary/Keyword: gradient method

Search Result 3,153, Processing Time 0.025 seconds

D.C. Motor Speed control Using Explicit M.R.A.C. Algorithms (Explicit M.R.A.C. 알고리즘을 이용한 직류 전동기 속도 제어)

  • Kim, Jong-Hwan;Park, Jun-Ryeol;Choe, Gye-Geun
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.6
    • /
    • pp.11-17
    • /
    • 1983
  • In this paper, the application of the explicit M.R.A.C. algorithms to the D.C. motor speed control using the microprocessor is studied. The adaptation algorithms are derived from the gradient method and the exponentially weighted least square [E.W.L.S.] method. In order to minimize the computational instability of the E.W.L.S. method, the adaptation algorithm of UDUt factorization method is developed, and because of the characteristics of the D.C. motor (dead-aone phenomenon) , the SM. gra-dient type algorithm is also improved from the gradient type algorithm. Computer simulations and experiments show that these algorithms adapt well to the rapid change of the reference input and the load.

  • PDF

Induced Charge Distribution Using Accelerated Uzawa Method (가속 Uzawa 방법을 이용한 유도전하계산법)

  • Kim, Jae-Hyun;Jo, Gwanghyun;Ha, Youn Doh
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.34 no.4
    • /
    • pp.191-197
    • /
    • 2021
  • To calculate the induced charge of atoms in molecular dynamics, linear equations for the induced charges need to be solved. As induced charges are determined at each time step, the process involves considerable computational costs. Hence, an efficient method for calculating the induced charge distribution is required when analyzing large systems. This paper introduces the Uzawa method for solving saddle point problems, which occur in linear systems, for the solution of the Lagrange equation with constraints. We apply the accelerated Uzawa algorithm, which reduces computational costs noticeably using the Schur complement and preconditioned conjugate gradient methods, in order to overcome the drawback of the Uzawa parameter, which affects the convergence speed, and increase the efficiency of the matrix operation. Numerical models of molecular dynamics in which two gold nanoparticles are placed under external electric fields reveal that the proposed method provides improved results in terms of both convergence and efficiency. The computational cost was reduced by approximately 1/10 compared to that for the Gaussian elimination method, and fast convergence of the conjugate gradient, as compared to the basic Uzawa method, was verified.

Structure Optimization of Solute Molecules via Free Energy Gradient Method

  • Nagaoka, Masataka
    • Bulletin of the Korean Chemical Society
    • /
    • v.24 no.6
    • /
    • pp.805-808
    • /
    • 2003
  • Fundamental ideas of the free energy gradient method are briefly reviewed with three applications: the stable structures of glycine and ammonia-water molecule pair in aqueous solution and the transition state (TS) structure of a Menshutkin reaction $NH_3 + CH_3Cl → CH_3NH_3^+ + Cl^-$ in aqueous solution, which is the first example of full TS optimization of all internal degrees of freedom.

Study on Optimum Design of Steel Plane Frame By Using Gradient Projection Method (Gradient Projection법을 이용한 철골평면구조물의 최적설계연구)

  • LEE HAN-SEON;HONG SUNG-MOK
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1994.04a
    • /
    • pp.38-45
    • /
    • 1994
  • The general conceptual constitution of structural optimization is formulated. The algorithm using the gradient projection method and design sensitivity analysis is discussed. Examples of minimum-weight design for six-story steel plane frame are taken to illustrate the application of this algorithm. The advantages of this algorithm such as marginal cost and design sensitivity analysis as well as system analysis are explained.

  • PDF

Rapid detection of beer-spoilage lactic acid bacteria: Modified hop-gradient agar with ethanol method

  • Hong, Lim Seok;Kim, Ji Hyeon;Kim, Wang June
    • Korean Journal of Food Science and Technology
    • /
    • v.52 no.3
    • /
    • pp.296-303
    • /
    • 2020
  • Hop-resistant lactic acid bacteria (LAB) are well-known, major beer-spoilage bacteria. The hop-gradient agar containing ethanol (c-HGA+E) method has been used to examine hop-resistance of beer-spoilage LAB. However, the selection of beer-spoilage bacteria by the c-HGA+E method is either too selective or too inclusive. Furthermore, it is accompanied by a complicated experimental procedure, high-cost and time. To overcome these disadvantages, the modified hop-gradient agar with ethanol (m-HGA+E) method was developed. The most remarkable modifications were the shape of the petri dish and the inoculation method for bacteria. The efficiency and validation of the m-HGA+E approach were proven by the formation of colonies at different hop concentrations in the bottom layer, co-culture with the bacteriocin producer and by PCR detection of hop-resistant genes. This study demonstrated that m-HGA+E is a rapid, economical, and easy method to monitor potential hop-resistant beer-spoilage LAB during the beer brewing process.

A new conjugate gradient method for dynamic load identification of airfoil structure with randomness

  • Lin J. Wang;Jia H. Li;You X. Xie
    • 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%.

GLOBAL CONVERGENCE OF AN EFFICIENT HYBRID CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION

  • Liu, Jinkui;Du, Xianglin
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.1
    • /
    • pp.73-81
    • /
    • 2013
  • In this paper, an efficient hybrid nonlinear conjugate gradient method is proposed to solve general unconstrained optimization problems on the basis of CD method [2] and DY method [5], which possess the following property: the sufficient descent property holds without any line search. Under the Wolfe line search conditions, we proved the global convergence of the hybrid method for general nonconvex functions. The numerical results show that the hybrid method is especially efficient for the given test problems, and it can be widely used in scientific and engineering computation.

A new conjugate gradient algorithm for solving dynamic load identification

  • Wang, Lin J.;Deng, Qi C.;Xie, You X.
    • Structural Engineering and Mechanics
    • /
    • v.64 no.2
    • /
    • pp.271-278
    • /
    • 2017
  • In this paper, we propose a new conjugate gradient method which possesses the global convergence and apply it to solve inverse problems of the dynamic loads identification. Moreover, we strictly prove the stability and convergence of the proposed method. Two engineering numerical examples are presented to demonstrate the effectiveness and speediness of the present method which is superior to the Landweber iteration method. The results of numerical simulations indicate that the proposed method is stable and effective in solving the multi-source dynamic loads identification problems of practical engineering.

A new optimization method for improving the performance of neural networks for optimization (최적화용 신경망의 성능개선을 위한 새로운 최적화 기법)

  • 조영현
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.12
    • /
    • pp.61-69
    • /
    • 1997
  • This paper proposes a new method for improving the performances of the neural network for optimization using a hyubrid of gradient descent method and dynamic tunneling system. The update rule of gradient descent method, which has the fast convergence characteristic, is applied for high-speed optimization. The update rule of dynamic tunneling system, which is the deterministic method with a tunneling phenomenon, is applied for global optimization. Having converged to the for escaping the local minima by applying the dynamic tunneling system. The proposed method has been applied to the travelling salesman problems and the optimal task partition problems to evaluate to that of hopfield model using the update rule of gradient descent method.

  • PDF

A Study on the Application of Conjugate Gradient Method in Nonlinear Magnetic Field Analysis by FEM. (유한요소법에 의한 비선형 자계 해석에 공액 구배법 적응 연구)

  • 임달호;신흥교
    • 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.

  • PDF