• 제목/요약/키워드: Iteration Method

검색결과 1,145건 처리시간 0.026초

Barycentric Approximator for Reinforcement Learning Control

  • Whang Cho
    • International Journal of Precision Engineering and Manufacturing
    • /
    • 제3권1호
    • /
    • pp.33-42
    • /
    • 2002
  • Recently, various experiments to apply reinforcement learning method to the self-learning intelligent control of continuous dynamic system have been reported in the machine learning related research community. The reports have produced mixed results of some successes and some failures, and show that the success of reinforcement learning method in application to the intelligent control of continuous control systems depends on the ability to combine proper function approximation method with temporal difference methods such as Q-learning and value iteration. One of the difficulties in using function approximation method in connection with temporal difference method is the absence of guarantee for the convergence of the algorithm. This paper provides a proof of convergence of a particular function approximation method based on \"barycentric interpolator\" which is known to be computationally more efficient than multilinear interpolation .

On the Variational Approach for Analyzing the Stability of Solutions of Evolution Equations

  • Abdel-Gawad, Hamdy I.;Osman, M.S.
    • Kyungpook Mathematical Journal
    • /
    • 제53권4호
    • /
    • pp.661-680
    • /
    • 2013
  • The eigenvalue problems arise in the analysis of stability of traveling waves or rest state solutions are currently dealt with, using the Evans function method. In the literature, it had been shown that, use of this method is not straightforward even in very simple examples. Here an extended "variational" method to solve the eigenvalue problem for the higher order dierential equations is suggested. The extended method is matched to the well known variational iteration method. The criteria for validity of the eigenfunctions and eigenvalues obtained is presented. Attention is focused to find eigenvalue and eigenfunction solutions of the Kuramoto-Slivashinsky and (K[p,q]) equation.

유한요소법을 이용한 유도전동기의 기동특성 해석 (Transient Analysis of Induction Motors using Finite Element Method)

  • 김영선;이복용;이향범;이기식
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1997년도 하계학술대회 논문집 A
    • /
    • pp.306-308
    • /
    • 1997
  • In this paper, We present the transient analysis method of induction motor by TDFE(Time Domain Finite Element) method. For simulation of transient performance, Maxwell's equations are solved using 2-Dimensional TDFE method, and the circuit equations from the stator and rotor are solved simultaneously. The time derivatives are discretized with Euler scheme and the Newton-Raphson iteration method is applied to a large system of equations which are representing the whole magnetic and feeding circuit equations because of the magnetic nonlinearity of the stator and rotor core. The presented method is applied to three phase induction motor. And we obtained the phase currents, torque and rotor position until the steady state.

  • PDF

평면도의 최소 영역 평가에서 유전자 알고리듬과 심플렉스 방법의 비교 (Comparison between Genetic Algorithm and Simplex Method in the Evaluation of Minimum Zone for Flatness)

  • 현창헌;신상철
    • 산업기술연구
    • /
    • 제20권B호
    • /
    • pp.27-34
    • /
    • 2000
  • The definition of flatness is given by ISO, ANSI, KS, etc. but those standards don't mention about the specific methods for the flatness. So various solution models that are based on the Minimum Zone Method have been proposed as an optimization problem for the minimax curve fitting. But it has been rare to compare some optimization algorithms to make a guideline for choosing better algorithms in this field. Hence this paper examined and compared Genetic Algorithm and Simplex Method to the evaluation of flatness. As a result, Genetic Algorithm gave the better or equal flatness than Simplex Method but it has the inefficiency caused from the large number of iteration. Therefore, in the future, another researches about alternative algorithms including Hybrid Genetic Algorithm should be achieved to improve the efficiency of Genetic Algorithm for the evaluation of flatness.

  • PDF

전력계통에 있어서 직접법을 활용한 상정사고 위험순위 결정 (Contingency Severity Ranking Using Direct Method in Power Systems)

  • 이상근
    • 전기학회논문지P
    • /
    • 제54권2호
    • /
    • pp.67-72
    • /
    • 2005
  • This paper presents a method to select contingency ranking considering voltage security problems in power systems. Direct method which needs not the detailed knowledge of the post contingency voltage at each bus is used. Based on system operator's experience and knowledge, the membership functions for the MVAR mismatch and allowable voltage violation are justified describing linguistic representation with heuristic rules. Rule base is used for the computation of severity index for each contingency by fuzzy inference. Contingency ranking harmful to the system is formed by the index for security evaluation. Compared with 1P-1Q iteration, this algorithm using direct method and fuzzy inference shows higher computation speed and almost the same accuracy. The proposed method is applied to model system and KEPCO pratical system which consists of 311 buses and 609 lines to show its effectiveness.

Structural reliability analysis using response surface method with improved genetic algorithm

  • Fang, Yongfeng;Tee, Kong Fah
    • Structural Engineering and Mechanics
    • /
    • 제62권2호
    • /
    • pp.139-142
    • /
    • 2017
  • For the conventional computational methods for structural reliability analysis, the common limitations are long computational time, large number of iteration and low accuracy. Thus, a new novel method for structural reliability analysis has been proposed in this paper based on response surface method incorporated with an improved genetic algorithm. The genetic algorithm is first improved from the conventional genetic algorithm. Then, it is used to produce the response surface and the structural reliability is finally computed using the proposed method. The proposed method can be used to compute structural reliability easily whether the limit state function is explicit or implicit. It has been verified by two practical engineering cases that the algorithm is simple, robust, high accuracy and fast computation.

SYSTEMATIC APPROXIMATION OF THREE DIMENSIONAL FRACTIONAL PARTIAL DIFFERENTIAL EQUATIONS IN FLUID MECHANICS

  • KHAN, FIRDOUS;GHADLE, KIRTIWANT P.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제23권3호
    • /
    • pp.253-266
    • /
    • 2019
  • In this article, a systematic solution based on the sequence of expansion method is planned to solve the time-fractional diffusion equation, time-fractional telegraphic equation and time-fractional wave equation in three dimensions using a current and valid approximate method, namely the ADM, VIM, and the NIM subject to the estimate initial condition. By using these three methods it is likely to find the exact solutions or a nearby approximate solution of fractional partial differential equations. The exactness, efficiency, and convergence of the method are demonstrated through the three numerical examples.

The Iterated Ritz Method: Basis, implementation and further development

  • Dvornik, Josip;Lazarevic, Damir;Uros, Mario;Novak, Marta Savor
    • Coupled systems mechanics
    • /
    • 제7권6호
    • /
    • pp.755-774
    • /
    • 2018
  • The Ritz method is known as very successful strategy for discretizing continuous problems, but it has never been used for solving systems of algebraic equations. The Iterated Ritz Method (IRM) is a novel iterative solver based on the discretized Ritz procedure applied at each iteration step. With an appropriate choice of coordinate vectors, the method may be efficient in linear, nonlinear and optimization problems. Additionally, some iterative methods can be explained as special cases of this approach, which helps to understand advantages and limitations of these methods and gives motivation for their improvement in sense of IRM. In this paper, some ideas for generation of efficient coordinate vectors are presented. The algorithm was developed and tested independently and then implemented into the open source program FEAP. Method has been successfully applied to displacement based (even ill-conditioned) models of structural engineering practice. With this original approach, a new iterative solution strategy has been opened.

Topology and size optimization of truss structures using an improved crow search algorithm

  • Mashayekhi, Mostafa;Yousefi, Roghayeh
    • Structural Engineering and Mechanics
    • /
    • 제77권6호
    • /
    • pp.779-795
    • /
    • 2021
  • In the recent decades, various optimization algorithms have been considered for the optimization of structures. In this research, a new enhanced algorithm is used for the size and topology optimization of truss structures. This algorithm, which is obtained from the combination of Crow Search Algorithm (CSA) and the Cellular Automata (CA) method, is called CA-CSA method. In the first iteration of the CA-CSA method, some of the best designs of the crow's memory are first selected and then located in the cells of CA. Then, a random cell is selected from CA, and the best design is chosen from the selected cell and its neighborhood; it is considered as a "local superior design" (LSD). In the optimization process, the LSD design is used to modify the CSA method. Numerical examples show that the CA-CSA method is more effective than CSA in the size and topology optimization of the truss structures.

APPROXIMATING RANDOM COMMON FIXED POINT OF RANDOM SET-VALUED STRONGLY PSEUDO-CONTRACTIVE MAPPINGS

  • LI JUN;HUANG NAN JING
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.329-341
    • /
    • 2005
  • In this paper, we introduce new random iterative sequences with errors approximating a unique random common fixed point for three random set-valued strongly pseudo-contractive mappings and show the convergence of the random iterative sequences with errors by using an approximation method in real uniformly smooth separable Banach spaces. As applications, we study the existence of random solutions for some kind of random nonlinear operator equations group in separable Hilbert spaces.