• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1992년도 하계학술대회 논문집 A
• /
• pp.205-210
• /
• 1992

The power flow calculations are the most important and powerful tools in the various studies of power system engineering. Newton-Raphson method, among the various power flow calculation techniques, is normally used due to its rapidness of numerical convergency. In the conventional Newton-Raphson method, however, there are some unrealistic assumptions, in which all the system power losses are considered to be supplied by the slack bus generator. Introducing the system power loss formula and augmenting the conventional Newton-Raphson power flow method, we can relieve the unrealistic assumption and improve the performance of power flow calculation. In this study, A new approach for handling the losses and augmenting the conventional power flow problem is proposed. The proposed method estimates the increamental changes of active power on each generation bus with respect to the change of total system power losses and the estimated value are used to update the slack bus power. If some studies for more theoritical investigations and verifications are followed, the proposed approach will show some improvement of the conventional method and give lots of contribution to increase the performance of power flow techniques in power systems engineering.

• 한국전산구조공학회논문집
• /
• 제26권4호
• /
• pp.223-231
• /
• 2013

본 논문에서는 물성이 균일하지 않은 반무한 고체영역의 탄성파속도 분포를 재구성하기 위한 시간영역 Gauss-Newton 전체파형 역해석 기법을 소개한다. 반무한 영역을 유한 계산영역으로 치환하기 위하여 유한영역의 경계에 수치적 파동흡수 경계조건인 perfectly-matched-layers(PMLs)를 도입하였다. 이 역해석 문제는 PML을 경계로 하는 영역에서의 탄성파동방정식을 구속조건으로 하는 최적화 문제로 성립되며, 표면에서 측정된 변위응답과 혼합유한요소법에 의해 계산된 응답간의 차이를 최소화함으로써 미지의 탄성파속도 분포를 결정한다. 이 과정에서 Gauss-Newton-Krylov 최적화 알고리즘과 정규화기법을 사용하여 탄성파속도의 분포를 반복적으로 업데이트하였다. 1차원 수치예제들을 통해 Gauss-Newton 역해석으로 부터 재구성된 탄성파속도의 분포가 목표값에 충분히 근사함을 보였으며, Fletcher Reeves 최적화 알고리즘을 사용한 기존의 역해석 결과에 비해 수렴율이 현저히 개선되고 계산 소요시간이 단축됨을 확인할 수 있었다.

• 한국초전도저온공학회:학술대회논문집
• /
• 한국초전도저온공학회 2002년도 학술대회 논문집
• /
• pp.330-333
• /
• 2002

This study is concerned with the optimal design of DC reactor type high-Tc superconducting fault current limiter(SFCL) by Newton method. What should be first thought over in developing SFCL is the condition in which the cost function is minimized under given constraints. So, this condition is supposed to be the values corresponding to the variables the cost function counts on. In this paper, we got the result for the SFCL available at the level of 6.6kV-200A by means of simulation.

• Korean Journal of Mathematics
• /
• 제20권1호
• /
• pp.117-123
• /
• 2012

We provide a convergence analysis of Newton's method for set valued maps under center H$\ddot{o}$lder continuity conditions on the Fr$\acute{e}$chet derivative of the operator involved. This approach extends the applicability of earlier works [4,5,7].

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제16권1호
• /
• pp.13-18
• /
• 2009

A semilocal convergence analysis is provided for Newton's method in a Banach space. The inverses of the operators involved are only locally $H{\ddot{o}}lderian$. We make use of a point-based approximation and center-$H{\ddot{o}}lderian$ hypotheses for the inverses of the operators involved. Such an approach can be used to approximate solutions of equations involving nonsmooth operators.

• 충청수학회지
• /
• 제21권4호
• /
• pp.483-492
• /
• 2008

The k-fold pseudo-Newton's method is proposed and its convergence behavior is investigated near a simple zero. The order of convergence is proven to be at least k + 2. The asymptotic error constant is explicitly given in terms of k and the corresponding simple zero. High-precison numerical results are successfully implemented via Mathematica and illustrated for various examples.

• East Asian mathematical journal
• /
• 제24권3호
• /
• pp.295-304
• /
• 2008

We approximate a locally unique solution of a nonlinear operator equation containing a non-differentiable operator in a Banach space setting using Newton's method. Sufficient conditions for the semilocal convergence of Newton's method in this case have been given by several authors using mainly increasing sequences [1]-[6]. Here, we use center as well as Lipschitz conditions and decreasing majorizing sequences to obtain new sufficient convergence conditions weaker than before in many interesting cases. Numerical examples where our results apply to solve equations but earlier ones cannot [2], [5], [6] are also provided in this study.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제17권4호
• /
• pp.307-319
• /
• 2010

We provide a new semilocal convergence analysis of the Gauss-Newton method (GNM) for solving nonlinear equation in the Euclidean space. Using our new idea of recurrent functions, and a combination of center-Lipschitz, Lipschitz conditions, we provide under the same or weaker hypotheses than before [7]-[13], a tighter convergence analysis. The results can be extented in case outer or generalized inverses are used. Numerical examples are also provided to show that our results apply, where others fail [7]-[13].

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

A semi local convergence analysis is provided for Newton's method in a Banach space setting. The operators involved are only locally Holderian. We make use of a point-based approximation and center-Holderian hypotheses. This approach can be used to approximate solutions of equations involving nonsmooth operators.

• Journal of applied mathematics & informatics
• /
• 제32권1_2호
• /
• pp.211-225
• /
• 2014

A new class of smoothing functions is introduced in this paper, which includes some important smoothing complementarity functions as its special cases. Based on this new smoothing function, we proposed a smoothing Newton method. Our algorithm needs only to solve one linear system of equations. Without requiring the nonemptyness and boundedness of the solution set, the proposed algorithm is proved to be globally convergent. Numerical results indicate that the smoothing Newton method based on the new proposed class of smoothing functions with ${\theta}{\in}(0,1)$ seems to have better numerical performance than those based on some other important smoothing functions, which also demonstrate that our algorithm is promising.