• Title/Summary/Keyword: Newton algorithm

Search Result 382, Processing Time 0.029 seconds

A real time method of vehicle system dynamics

  • Bae, Daesung
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.10 no.2
    • /
    • pp.18-28
    • /
    • 2001
  • Super computers has been utilized to carry out vehicle dynamics in real time. This research propose an implicit integra-tion method for vehicle state variables. Newton chord method is empolyed to solve the equations of motion and con-straints. The equations of motion and constraints are formulated such that the Jacobian matrix for Newton chord method is needed to be computed only once for a dynamic analysis. Numerical experiments showed that the Jacobian matrix generat-ed at the initial time could have been utilized for the Newton chord iterations throughout simulations under various driving conditions. Convergence analysis of Newton chord method with the proposed Jacobian updating method is carried out. The proposed algorithm yielded accurate solutions for a prototype vehicle multibody model in realtime on a 400 MHz PC compatible.

  • PDF

A QUASI-NEWTON METHOD USING DIRECTIONAL DERIVATIVES FOR NONLINEAR EQUATIONS

  • Kim, Sun-Young
    • Communications of the Korean Mathematical Society
    • /
    • v.9 no.2
    • /
    • pp.491-502
    • /
    • 1994
  • Many problems arising in science and engineering require the numerical solution of a system of n nonlinear equations in n unknowns: (1) given F : $R^{n}$ $\rightarrow$ $R^{n}$ , find $x_{*}$ $\epsilon$ $R^{n}$ / such that F($x_{*}$) = 0. Nonlinear problems are generally solved by iteration. Davidson [3] and Broyden [1] introduced the methods which had led to a large amount of research and a class of algorithm. This work has been called by the quasi-Newton methods, secant updates, or modification methods. Newton's method is the classical method for the problem (1) and quasi-Newton methods have been proposed to circumvent computational disadvantages of Newton's method.(omitted)

  • PDF

The Design of Iron Loss Minimization of 600W IPMSM by Quasi-newton Method (Quasi-Newton Method에 의한 600W IPMSM의 철손 최소화 설계)

  • Baek, Sung-min;Cho, Gyu-won;Kim, Gyu-tak
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.7
    • /
    • pp.1053-1058
    • /
    • 2017
  • In this paper, the design of iron loss minimization of 600W was performed by using Quasi-Newton method. Stator shoe, the width of stator teeth and yoke, and the length of d-axis flux path were selected as design parameters, and the output characteristics according to each design variable were considered. The objective function was set to minimize iron loss. Using the Quasi-Newton method, the variables converged to the target value while changing simultaneously and multiple times. As the algorithm advanced optimization, the correlation with the behavior of each variable was compared and analyzed.

Newton-Raphson's Double Precision Reciprocal Using 32 bit multiplier (32 비트 곱셈기를 사용한 뉴톤-랍손 배정도실수 역수 계산기)

  • Cho, Gyeong-Yeon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.18 no.6
    • /
    • pp.31-37
    • /
    • 2013
  • Modern graphic processors, multimedia processors and audio processors mostly use floating-point number. High-level language such as C and Java use both single precision and double precision floating-point number. In this paper, an algorithm which computes the reciprocal of double precision floating-point number using a 32 bit multiplier is proposed. It divides the mantissa of double precision floating-point number to upper part and lower part, and calculates the reciprocal of the upper part with Newton-Raphson algorithm. And it computes the reciprocal of double precision floating-point number with calculated upper part reciprocal as the initial value. Since the number of multiplications performed by the proposed algorithm is dependent on the mantissa of floating-point number, the average number of multiplications per an operation is derived from some reciprocal tables with varying sizes.

An Efficient Improvement of the Iterative Eigenvalue Calculation Method and the Selection of Initial Values in AESOPS Algorithm (AESOPS 알고리즘의 고유치 반복계산식과 고유치 초기값 선정의 효율적인 개선에 관한 연구)

  • Kim, Deok-Young;Kwon, Sae-Hyuk
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.11
    • /
    • pp.1394-1400
    • /
    • 1999
  • This paper presents and efficient improvement of the iterative eigenvalue calculation method and the selection of initial values in AESOPS algorithm. To determine the initial eigenvalues of the system, system state matrix is constructed with the two-axis generator model. From the submatrices including synchronous and damping coefficients, the initial eigenvalues are calculated by the QR method. Participation factors are also calculated from the above submatrices in order to determine the generators which have a important effect to the specific oscillation mode. Also, the heuristically approximated eigenvalue calculation method in the AESOPS algorithm is transformed to the Newton Raphson Method which is largely used in the nonlinear numerical analysis. The new methods are developed from the AESOPS algorithm and thus only a few calculation steps are added to practice the proposed algorithm.

  • PDF

Wakeby Distribution and the Maximum Likelihood Estimation Algorithm in Which Probability Density Function Is Not Explicitly Expressed

  • Park Jeong-Soo
    • Communications for Statistical Applications and Methods
    • /
    • v.12 no.2
    • /
    • pp.443-451
    • /
    • 2005
  • The studied in this paper is a new algorithm for searching the maximum likelihood estimate(MLE) in which probability density function is not explicitly expressed. Newton-Raphson's root-finding routine and a nonlinear numerical optimization algorithm with constraint (so-called feasible sequential quadratic programming) are used. This algorithm is applied to the Wakeby distribution which is importantly used in hydrology and water resource research for analysis of extreme rainfall. The performance comparison between maximum likelihood estimates and method of L-moment estimates (L-ME) is studied by Monte-carlo simulation. The recommended methods are L-ME for up to 300 observations and MLE for over the sample size, respectively. Methods for speeding up the algorithm and for computing variances of estimates are discussed.

Modified regularized Newton-Raphson algorithm for Electrical Impedance Tomography in Region Of Interest

  • Nam, Il-Hwan;Kang, Byung-Chae;Kim, Ji-Hun;Choi, Bong-Yeol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.134-137
    • /
    • 2003
  • Newton-Raphson is most used algorithm in EIT(electrical impedance tomography), cross-sectional distribution of resistivity is reconstructed by mean of both generating and sensing electrodes attached onto the surface of the object. EIT has been suffered from the severe ill-posedness which is caused by the inherent low sensitivity of boundary measurements to any changes of internal resistivity values. In this paper, we propose modified cost function and weighting factor that compensate for low sensitivity between boundary measurements and internal resistivity and improve performance of Newton-Raphson for EIT in region of interest.

  • PDF

Gauss Newton Variable forgetting factor RLS algorithm for Time Varying Parameter Estimation. (Gauss Newton Variable Forgetting Factor Recursive Least Squares 알고리듬을 이용한 시변 신호 추정)

  • Song Seongwook;Lim Jun-Seok;Sung Koeng-Mo
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • spring
    • /
    • pp.173-176
    • /
    • 2000
  • 시변 신호 추적 특성을 향상시키기 위하여, Gauss-Newton Variable Forgetting Factor RLS (GN-VFF-RLS) Algorithm을 제안한다. 최적화된 망각인자를 가정한 기존의 RLS 알고리듬과 비교하여, 제안된 방법은 특히 신호의 변화가 급격히 일어날 경우 주목할만한 추정 성능의 향상을 보여준다. 제안된 알고리듬의 시변 추정 특성을 신호 대 잡음비와 시변 정도에 대하여 모의 실험하고 기존의 추정 알고리듬들과 비교한다.

  • PDF

Study on Forward Kinematics of Stewart Platform Using Neural Network Algorithm together with Newton-Raphson Method (신경망과 뉴톤 랩슨 방법을 이용한 스튜어트 플랫폼의 순기구학 해석에 관한 연구)

  • Goo, Sang-Hwa;Son, Kwon
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.9 no.1
    • /
    • pp.156-162
    • /
    • 2001
  • An effective and practical method is presented for solving the forward kinematics of a 6-DOF Stewart Platform, using neural network algorithm together with Newton-Raphson method. An approximated solution is obtained from trained neural network, then it is used as an initial estimate for Newton-Raphson method. A series of accurate solutions are calculated with reasonable speed for the entire workspace of the platform. The solution procedure can be used for driving a real-time simulation platform.

  • PDF

A general convergence condition of the Newton-Raphson algorithm applied to compressible hyperelasticity

  • Peyraut, Francois;Feng, Zhi-Qiang;Labed, Nadia
    • Structural Engineering and Mechanics
    • /
    • v.21 no.2
    • /
    • pp.121-136
    • /
    • 2005
  • This paper presents the implementation of the Blatz-Ko hyperelastic compressible model in a finite element program to deal with large deformation problems. We show analytically and numerically that the minimum number of increment steps in the Newton-Raphson algorithm depends on material properties and applied loads. We also show that this dependence is related to the orientation preservation principle. So we propose a convergence criteria based on the sign of eigenvalues of the deformation gradient matrix.