• 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.

• 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 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.

• 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.

• Korean Journal of Mathematics
• /
• v.9 no.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.

• The Pure and Applied Mathematics
• /
• v.13 no.4 s.34
• /
• pp.261-267
• /
• 2006

A local convergence analysis of Newton's method for perturbed generalized equations is provided in a Banach space setting. Using center Lipschitzian conditions which are actually needed instead of Lipschitzian hypotheses on the $Fr\'{e}chet$-derivative of the operator involved and more precise estimates under less computational cost we provide a finer convergence analysis of Newton's method than before [5]-[7].

• The Pure and Applied Mathematics
• /
• v.15 no.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.

• The Pure and Applied Mathematics
• /
• v.18 no.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
• /
• v.25 no.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.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.2
• /
• pp.133-139
• /
• 2006

By combining the classical Newton's method with the pseudo-secant method, pseudo-secant-Newton's method is constructed and its order and rate of convergence are investigated. Given a function $f:\mathbb{R}{\rightarrow}\mathbb{R}$ that has a simple real zero ${\alpha}$ and is sufficiently smooth in a small neighborhood of ${\alpha}$, the convergence behavior is analyzed near ${\alpha}$ for pseudo-secant-Newton's method. The order of convergence is shown to be cubic and the rate of convergence is proven to be $\(\frac{f^{{\prime}{\prime}}(\alpha)}{2f^{\prime}(\alpha)}\)^2$. Numerical experiments show the validity of the theory presented here and are confirmed via high-precision programming in Mathematica.