• Title/Summary/Keyword: Newton method

Search Result 1,015, Processing Time 0.031 seconds

Performance Improvement of AD-MUSIC Algorithm Using Newton Iteration (뉴턴 반복을 이용한 AD-MUSIC 알고리즘 성능향상)

  • Paik, Ji Woong;Kim, Jong-Mann;Lee, Joon-Ho
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.28 no.11
    • /
    • pp.880-885
    • /
    • 2017
  • In AD-MUSIC algorithm, DOD/DOA can be estimated without computationally expensive two-dimensional search. In this paper, to further reduce the computational complexity, the Newton type method has been applied to one-dimensional search. In this paper, we summarize the formulation of the AD-MUSIC algorithm, and present how to apply Newton-type iteration to AD-MUSIC algorithm for improvement of the accuracy of the DOD/DOA estimates. Numerical results are presented to show that the proposed scheme is efficient in the viewpoints of computational burden and estimation accuracy.

Dynamic Formulation Using Finite Element and Its Analysis for Flexible Beam (유한요소를 이용한 유연보의 동역학적 정식화 및 해석)

  • Yun Seong-Ho;Eom Ki-Sang
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.18 no.4 s.70
    • /
    • pp.385-393
    • /
    • 2005
  • This paper established the dynamic model of a flexible Timoshenko beam capable of geometrical nonlinearities subject to large overall motions by using the finite element method. Equations of motion are derived by using Hamilton principle and are formulated in terms of finite elements in which the nonlinear constraint equations are adjoined to the system using Lagrange multipliers. The Newmark direct integration method and the Newton-Raphson iteration are employed here for the numerical study which is to demonstrate the efficiency of the proposed formulation.

AFFINE INVARIANT LOCAL CONVERGENCE THEOREMS FOR INEXACT NEWTON-LIKE METHODS

  • Argyros, Ioannis K.
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.2
    • /
    • pp.393-406
    • /
    • 1999
  • Affine invariant sufficient conditions are given for two local convergence theorems involving inexact Newton-like methods. The first uses conditions on the first Frechet-derivative whereas the second theorem employs hypotheses on the second. Radius of con-vergence as well as rate of convergence results are derived. Results involving superlinear convergence and known to be true for inexact Newton methods are extended here. Moreover we show that under hypotheses on the second Frechet-derivation our radius of convergence results are derived. Results involving superlinear convergence and known to be true or inexact Newton methods are extended here. Moreover we show that under hypotheses on the second Frechet-derivative our radius of conver-gence is larger than the corresponding one in [10]. This allows a wider choice for the initial guess. A numerical example is also pro-vided to show that our radius of convergence is larger then the one in [10].

Newton's Synthesis-the Discovery of Common Cause (뉴턴의 융합-공통원인의 발견)

  • Park, Mi-Ra;Yang, Kyoung-Eun
    • Journal for History of Mathematics
    • /
    • v.29 no.4
    • /
    • pp.243-254
    • /
    • 2016
  • This research identifies the elements of the methodologies of Newton's discovery of his dynamics. These methodologies involve the transformation of preceding theoretical concepts and the discovery of common cause. This essay consists of two parts within historical case studies of Newton's works. The elements of the method of discovery consists of the transformation of preceding concepts and the identification of common cause in the formation of the research program's hard cores and protective belts. Newton transformed their predecessors' concepts to find out appropriate common causes in his dynamical theory. The transformed theoretical concepts are synthesized to be constructed as the elements of common cause which provide the foundations of Newtonian research programs.

NEW CONVERGENCE CONDITIONS OF SECANT METHODS VIA ALPHA THEORY

  • KIM, S.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.5 no.2
    • /
    • pp.101-115
    • /
    • 2001
  • Recent theoretical analysis of numerical methods for solving nonlinear systems of equations is represented by alpha theory of Newton method developed Smale et al. The theory was extended to Secant method by providing convergence conditions by Yakoubsohn which the Secant method is treated as an operator defined for analytical functions. We use Secant methods as an iterative scheme with approximations, which results in new convergence conditions. We compare the two conditions and show that the new conditions represent the features of Secant method in a more precise way.

  • 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

Development of an AOA Location Method Using Self-tuning Weighted Least Square (자기동조 가중최소자승법을 이용한 AOA 측위 알고리즘 개발)

  • Lee, Sung-Ho;Kim, Dong-Hyouk;Roh, Gi-Hong;Park, Kyung-Soon;Sung, Tae-Kyung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.7
    • /
    • pp.683-687
    • /
    • 2007
  • In last decades, several linearization methods for the AOA measurements have been proposed, for example, Gauss-Newton method and Closed-Form solution. Gauss-Newton method can achieve high accuracy, but the convergence of the iterative process is not always ensured if the initial guess is not accurate enough. Closed-Form solution provides a non-iterative solution and it is less computational. It does not suffer from convergence problem, but estimation error is somewhat larger. This paper proposes a Self-Tuning Weighted Least Square AOA algorithm that is a modified version of the conventional Closed-Form solution. In order to estimate the error covariance matrix as a weight, a two-step estimation technique is used. Simulation results show that the proposed method has smaller positioning error compared to the existing methods.

A STUDY ON CONVERGENCE OF EXTENDED LEAP-FROGGING NEWTON'S METHOD LOCATING MULTIPLE ZEROS

  • Geum, Young Hee
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.2
    • /
    • pp.217-227
    • /
    • 2009
  • Assuming that a given nonlinear function f : $\mathbf{R}{\rightarrow}\mathbf{R}$ has a zero $\alpha$with integer multiplicity $m{\geq}1$ and is sufficiently smooth in a small neighborhood of $\alpha$, we define extended leap-frogging Newton's method. We investigate the order of convergence and the asymptotic error constant of the proposed method as a function of multiplicity m. Numerical experiments for various test functions show a satisfactory agreement with the theory presented in this paper and are throughly verified via Mathematica programming with its high-precision computability.

  • PDF

NEWTON'S METHOD FOR SYMMETRIC AND BISYMMETRIC SOLVENTS OF THE NONLINEAR MATRIX EQUATIONS

  • Han, Yin-Huan;Kim, Hyun-Min
    • Journal of the Korean Mathematical Society
    • /
    • v.50 no.4
    • /
    • pp.755-770
    • /
    • 2013
  • One of the interesting nonlinear matrix equations is the quadratic matrix equation defined by $$Q(X)=AX^2+BX+C=0$$, where X is a $n{\times}n$ unknown real matrix, and A, B and C are $n{\times}n$ given matrices with real elements. Another one is the matrix polynomial $$P(X)=A_0X^m+A_1X^{m-1}+{\cdots}+A_m=0,\;X,\;A_i{\in}\mathbb{R}^{n{\times}n}$$. Newton's method is used to find the symmetric and bisymmetric solvents of the nonlinear matrix equations Q(X) and P(X). The method does not depend on the singularity of the Fr$\acute{e}$chet derivative. Finally, we give some numerical examples.

A Study on Numerical Analysis of Wheel-rail Contact Points (차륜과 레일 접촉위치의 수치해석에 관한 연구)

  • Kang, Ju-Seok
    • Journal of the Korean Society for Railway
    • /
    • v.12 no.2
    • /
    • pp.236-242
    • /
    • 2009
  • This paper presents a numerical analysis method to determine flange contact at variable wheel positions. The shapes of the wheel and rail surface functions with surface parameters. The Newton-Rhapson method for wheel-rail contact can provide fast solutions, but may not yield true values at optimization process with the condition that minimum distance is zero can time-consuming. A compound method, combining the Newton-Rhapson methods the optimization process method is proposed to provide exact solutions efficiently.