• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 춘계학술대회논문집A
• /
• pp.339-344
• /
• 2000

Newton-Raphson 기법은 구조물의 비선형 해석에 널리 쓰이는 반복계산기법이다. 비선형 해석을 위한 반복계산기법은 컴퓨터의 발달을 감안해도 상당한 계산시간이 소요된다. 본 논문에서는 신경회로망 예측을 사용한 Predicted Newton-Raphson 반복계산기법을 제안하였다. 통상적인 Newton-Raphson 기법은 이전스텝에서 수렴된 점으로부터 현재 스텝의 반복계산을 시작하는 반면 제시된 방법은 현재 스텝 수렴해에 대한 예측점에서 반복계산을 시작한다. 수렴해에 대한 예측은 신경회로망을 사용하여 이전 스텝 수렴해의 과거경향을 파악한 후 구한다. 반복계산 시작점이 수렴점에 보다 근접하여 위치하므로 수렴속도가 빨라지게 되고 허용되는 하중스텝의 크기가 커지게 된다. 또한 반복계산의 시작점으로부터 이루어지는 계산과정은 통상적인 Newton-Raphson 기법과 동일하므로 기존의 Newton-Raphson 기법과 정확히 일치하는 수렴해를 구할 수 있다. 구조물의 정적 비선형 거동에 대한 수치해석을 통하여 modified Newton-Raphson 기법과 제시된 Predicted Newton=Raphson 기법의 정확성과 효율성을 비교하였다. 제시된 Predicted Newton-Raphson 기법은 modified Newton-Raphson 기법과 동일한 해를 산출하면서도 계산상의 효율성이 매우 큼을 확인할 수 있었다.

• Korean Journal of Mathematics
• /
• 제9권1호
• /
• pp.67-73
• /
• 2001

For some equation related with exponential function, we seek roots and find the properties of the roots. By using the relation of the roots and attractors, we find a region in the basin of attraction of the attractor at infinity for Newton's method for solving given equation.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제18권3호
• /
• pp.219-230
• /
• 2011

We determine the radius of convergence for some Newton{type methods (NTM) for approximating a locally unique solution of an equation in a Banach space setting. A comparison is given between the radii of (NTM) and Newton's method (NM). Numerical examples further validating the theoretical results are also provided in this study.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.909-920
• /
• 2011

A regularized Newton method for nonlinear ill-posed problems is considered. In each Newton step an implicit iterative method with an appropriate stopping rule is proposed and analyzed. Under certain assumptions on the nonlinear operator, the convergence of the algorithm is proved and the algorithm is stable if the discrepancy principle is used to terminate the outer iteration. Numerical experiment shows the effectiveness of the method.

• 대한수학회지
• /
• 제33권4호
• /
• pp.865-878
• /
• 1996

We consider numerical methods for finding a solution to a nonlinear system of algebraic equations $$ (1) f(x) = 0, $$ where the function $f : R^n \to R^n$ is ain $x \in R^n$. In [10], a quasi-Gauss-Newton method is proposed and shown the computational efficiency over SQRT algorithm by numerical experiments. The convergence rate of the method has not been proved theoretically. In this paper, we show theoretically that the iterate $x_k$ obtained from the quasi-Gauss-Newton method for the problem (1) actually converges to a root by Kantorovich-type convergence analysis. We also show the rate of convergence of the method is superlinear.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2004년도 춘계학술대회 논문집
• /
• pp.921-926
• /
• 2004

In this paper, a nonlinear structural damage identification algorithm is derived by taking into account the non-linearity of damage. The structural damage identification analyses are conducted by using the direct method and the Newton-Raphson method. It is found that, the Newton-Raphson method in general provides the better damage identification results when compared with the results obtained by the direct method.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제15권4호
• /
• pp.365-375
• /
• 2008

We present a new theorem for the semilocal convergence of Newton's method to a locally unique solution of an equation in a Banach space setting. Under a gamma-type condition we show that we can extend the applicability of Newton's method given in [12]. We also provide a comparative study between results using the classical Newton-Kantorovich conditions ([6], [7], [10]), and the ones using the gamma-type conditions ([12], [13]). Numerical examples are also provided.

• 한국공작기계학회논문집
• /
• 제10권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.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.345-351
• /
• 2007

Using more precise majorizing sequences we provide a finer convergence analysis than before [1], [7] of Newton's method in Riemannian manifolds with the following advantages: weaker hypotheses, finer error bounds on the distances involved and a more precise information on the location of the singularity of the vector field.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제15권1호
• /
• pp.47-55
• /
• 2008

Local convergence results for three Newton-like methods in Banach space are provided. A comparison is given between the three convergence radii. Then we show that using the largest convergence radius we can pick an initial guess from with we start the corresponding iteration. It turns out that after a finite number of steps we can always use the iterate found as the starting guess for a faster method, since this iterate will be inside the convergence domain of the new method.