On a Convex Acceleration of Newton's Method
نویسنده
چکیده
In this study, we use a convex acceleration of Newton's method (or super-Halley method) to approximate solutions of nonlinear equations. We provide sufficient convergence conditions for this method in three space settings: real line, complex plane, and Banach space. Several applications of our results are also provided.
منابع مشابه
A quasi-Newton proximal splitting method
A new result in convex analysis on the calculation of proximity operators in certain scaled norms is derived. We describe efficient implementations of the proximity calculation for a useful class of functions; the implementations exploit the piece-wise linear nature of the dual problem. The second part of the paper applies the previous result to acceleration of convex minimization problems, and...
متن کاملON MULTIPHASE ALGORITHM FOR SINGLE VARIABLE EQUATION USING NEWTON'S CORRECTION METHOD
This paper brings to light a method based on Multiphase algorithm for single variable equation using Newton's correction. Newton's method is derived through the logarithmic differentiation of polynomial equation. A correction term which enhances the high speed of convergence is hereby introduced. A translation of Newton's method to Total Step and Single Step Methods (T. S. M and S. S. M) re...
متن کاملReview of some iterative root–finding methods from a dynamical point of view
From a dynamical point of view applied to complex polynomials, we study a number of root–finding iterative methods. We consider Newton’s method, Newton’s method for multiple roots, Jarratt’s method, the super–Halley method, the convex as well as the double convex acceleration of Whittaker’s method, the methods of Chebyshev, Stirling, and Steffensen, among others. Since all of the iterative root...
متن کاملConvergence Acceleration for Some Root nding Methods
{Zusammenfassung Convergence Acceleration for Some Roottnding Methods. We present simple, eecient extrapolation formulas to accelerate the convergence of super-linearly convergent sequences. Applications are given for some roottnding methods such as Newton's method and the secant method. Numerical examples are given showing the eeectiveness of the extrapolation formulas. die EEektivitt at der E...
متن کاملSimple examples for the failure of Newton's method with line search for strictly convex minimization
In this paper two simple examples of a twice continuously differentiable strictly convex function f are presented for which Newton’s method with line search converges to a point where the gradient of f is not zero. The first example uses a line search based on the Wolfe conditions. For the second example, some strictly convex function f is defined as well as a sequence of descent directions for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002