• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.369-378
• /
• 1999

In This study we examine the applicability of Newton's method and the modified Newton's method for a, pp.oximating a lo-cally unique solution of a nonlinear equation in a Banach space. We assume that the newton-Kantorovich hypothesis for Newton's method is violated but the corresponding condition for the modified Newton method holds. Under these conditions there is no guaran-tee that Newton's method starting from the same initial guess as the modified Newton's method converges. Hence it seems that we must always use the modified Newton method under these condi-tions. However we provide a numerical example to demonstrate that in practice this may not be a good decision.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.747-756
• /
• 1999

The Newtom method and the quasi-Newton method for solving equations of smooth compositions of semismooth functions are proposed. The Q-superlinear convergence of the Newton method and the Q-linear convergence of the quasi-Newton method are proved. The present methods can be more easily implemeted than previous ones for this class of nonsmooth equations.

• East Asian mathematical journal
• /
• v.25 no.2
• /
• pp.147-151
• /
• 2009

We use an improved Newton-Kantorovich theorem introduced in [2] to analyze interior point methods. Our approach requires less number of steps than before [5] to achieve a certain error tolerance for both Newton's and Modified Newton's methods.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.15 no.1
• /
• pp.19-30
• /
• 2011

In [21], we compared the Newton-Krylov method and some high-order methods to solve nonlinear systems. In this paper, we propose high-order Newton-Krylov methods combining the Newton-Krylov method with some high-order iterative methods to solve systems of nonlinear equations. We provide some numerical experiments including comparisons of CPU time and iteration numbers of the proposed high-order Newton-Krylov methods for several nonlinear systems.

• Journal for History of Mathematics
• /
• v.15 no.3
• /
• pp.25-34
• /
• 2002

This paper explains methods of numerical analysis which appear on Cardano's Ars Magna and Newton's Principia. Cardano's method is secant method, but its actual al]plication is severely limited by technical difficulties. Newton's method is what nowadays called Newton-Raphson's method. But mysteriously, Newton's explanation had been forgotten for two hundred years, until Adams rediscovered it. Newton had even explained finding the root using the second degree Taylor's polynomial, which shows Newton's greatness.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.3 s.345
• /
• pp.15-20
• /
• 2006

A Newton-Raphson Method for table driven algorithm is presented in this paper. We concentrate the approximation of square root by using Newton-Raphson method. We confirm that this method has advantages of accurate and fast processing with optimized initial point. Hence the selection of the fitted initial points used in approximation of Newton-Raphson algorithm is important issue. This paper proposes that log scale based on geometric wean is most profitable initial point. It shows that the proposed method givemore accurate results with faster processing speed.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.351-360
• /
• 2006

In this paper, we develop an inexact-Newton method for solving nonsmooth operator equations in infinite-dimensional spaces. The linear convergence and superlinear convergence of inexact-Newton method under some conditions are shown. Then, we characterize the order of convergence in terms of the rate of convergence of the relative residuals. The present inexact-Newton method could be viewed as the extensions of previous ones with same convergent results in finite-dimensional spaces.

• East Asian mathematical journal
• /
• v.25 no.2
• /
• pp.153-157
• /
• 2009

Motivated by optimization considerations we revisit the work by Dontchev in [7] involving the convergence of Newton's method to a solution of a generalized equation in a Banach space setting. Using the same hypotheses and under the same computational cost we provide a finer convergence analysis for Newton's method by using more precise estimates.

• The Pure and Applied Mathematics
• /
• v.15 no.1
• /
• pp.35-45
• /
• 2008

In cases sufficient conditions for the semilocal convergence of Newtonlike methods are violated, we start with a modified Newton-like method (whose weaker convergence conditions hold) until we stop at a certain finite step. Then using as a starting guess the point found above we show convergence of the Newtonlike method to a locally unique solution of a nonlinear operator equation in a Banach space setting. A numerical example is also provided.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.127-143
• /
• 2015

In this paper, we consider a modified inexact Newton method for solving a nonlinear system F(x) = 0 where $F(x):R^n{\rightarrow}R^n$. The basic idea is to accelerate convergence. A semi-local convergence theorem for the modified inexact Newton method is established and an affine invariant version is also given. Moreover, we test three numerical examples which show that the modified inexact scheme is more efficient than the classical inexact Newton strategy.