• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.4
• /
• pp.575-582
• /
• 2015

The Newton-Raphson method is used to compute the q-th roots of a p-adic number for a prime number q. The sufficient conditions for the convergence of this method are obtained. The speed of its convergence and the number of iterations to obtain a number of corrected digits in the approximation are calculated.

• Kyungpook Mathematical Journal
• /
• v.52 no.3
• /
• pp.347-357
• /
• 2012

When Newton's method, or Halley's method is used to approximate the pth root of 1-z, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case, using an interesting link to Chebyshev's polynomials. It allows the determination of the sign of the coefficients of the power series expansion of these rational functions. This answers positively the square root case of a proposed conjecture by Guo(2010).

• Journal of Energy Engineering
• /
• v.10 no.3
• /
• pp.183-187
• /
• 2001

Impedance imaging for binary mixture is a kind of nonlinear inverse problem, which is usually solved iteratively by the Newton-Raphson method. Then, the ill-posedness of Hessian matrix often requires the use of a regularization method to stabilize the solution. In this study, the Levenberg-Marquredt regularization method is introduced for the binary-mixture system with various resistivity contrasts (1:2∼1:1000). Several mixture distribution are tested and the results show that the Newton-Raphson iteration combined with the Levenberg-Marquardt regularization can reconstruct reasonably good images.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1081-1087
• /
• 1999

Load Flow calulation methods can usually be divided into Gauss-Seidel method, Newton-Raphson method and decoupled method. Load flow calculation is a basic on-line or off-line process for power system planning. operation, control and state analysis. These days Newton-Raphson method is mainly used since it shows remarkable convergence characteristics. It, however, needs considerable calculation time in construction and calculation of inverse Jacobian matrix. In addition to that, Newton-Raphson method tends to fail to converge when system loading is heavy and system has a large R/X ratio. In this paper, matrix equation is used to make algebraic expression and then to slove load flow equation and to modify above defects. And it preserve P-Q bus part of Jacobian matrix to shorten computing time. Application of mentioned algorithm to 14 bus, 39 bus, 118 bus systems led to identical results and the same numbers of iteration obtained by Newton-Raphson method. The effect of computing time reduction showed about 28% , 30% , at each case of 39 bus, 118 bus system.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2006.06a
• /
• pp.131-135
• /
• 2006

A seismic waveform inversion for prestack seismic data based on the Gauss-Newton method is presented. The Gauss-Newton method for seismic waveform inversion was proposed in the 80s but has rarely been studied. Extensive computational and memory requirements have been principal difficulties. To overcome this, we used different sizes of grids in the inversion stage from those of grids in the wave propagation simulation, temporal windowing of the simulation and approximation of virtual sources for calculating partial derivatives, and implemented this algorithm on parallel supercomputers. We show that the Gauss-Newton method has high resolving power and convergence rate, and demonstrate potential applications to real seismic data.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.14 no.2
• /
• pp.113-124
• /
• 2010

We consider matrix polynomial which has the form $P_1(X)=A_oX^m+A_1X^{m-1}+...+A_m=0$ where X and $A_i$ are $n{\times}n$ matrices with real elements. In this paper, we propose an iterative method for the symmetric and generalized centro-symmetric solution to the Newton step for solving the equation $P_1(X)$. Then we show that a symmetric and generalized centro-symmetric solvent of the matrix polynomial can be obtained by our Newton's method. Finally, we give some numerical experiments that confirm the theoretical results.

• Journal of the Korean Mathematical Society
• /
• v.51 no.1
• /
• pp.137-162
• /
• 2014

In this work we study the local and semilocal convergence of the relaxed Newton's method, that is Newton's method with a relaxation parameter 0 < ${\lambda}$ < 2. We give a Kantorovich-like theorem that can be applied for operators defined between two Banach spaces. In fact, we obtain the recurrent sequence that majorizes the one given by the method and we characterize its convergence by a result that involves the relaxation parameter ${\lambda}$. We use a new technique that allows us on the one hand to generalize and on the other hand to extend the applicability of the result given initially by Kantorovich for ${\lambda}=1$.

• Communications of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.1009-1023
• /
• 2022

The main objective of this work is to investigate the study of the local and semi-local convergence of the contraharmonic-mean Newton's method (CHMN) for solving nonlinear equations in a Banach space. We have performed the semi-local convergence analysis by using generalized conditions. We examine the theoretical results by comparing the CHN method with the Newton's method and other third order methods by Weerakoon et al. using some test functions. The theoretical and numerical results are also supported by the basins of attraction for a selected test function.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.148-155
• /
• 2015

The Levenberg-Marquardt method is a well known solution about the least square problem. However, in a Target Motion Analysis(TMA) application most of researches have used the Gauss-Newton method as a batch estimator, which of inverse matrix calculation may causes instability problem. In this paper, Levenberg-Marquardt method is applied to TMA problem to prevent its divergence. In experiment, its performance is compared with Gauss-Newton in domain of range, course and speed. Monte Carlo simulation reveals the convergence time and reliability of the TMA based on Levenberg-Marquardt.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.570-574
• /
• 2003

In most boundary estimation algorithms estimation in EIT (Electrical Impedance Tomography), anomaly boundaries can be expressed with Fourier series and the unknown coefficients are estimated with proper inverse algorithms. Furthermore, the number of anomalies is assumed to be available a priori. The prior knowledge on the number of anomalies may be unavailable in some cases, and we need to determine the number of anomalies with other methods. This paper presents an algorithm for the boundary estimation in EIT (Electrical Impedance Tomography) using the prior information from the conventional Newton-Raphson method. Although Newton-Raphson method generates so poor spatial resolution that the anomaly boundaries are hardly reconstructed, even after a few iterations it can give general feature of the object to be imaged such as the number of anomalies, their sizes and locations, as long as the anomalies are big enough. Some numerical experiments indicate that the Newton-Raphson method can be used as a good predictor of the unknown boundaries and the proposed boundary discrimination algorithm has a good performance.