Results 11 to 20 of about 10,998,730 (181)
Relaxing convergence conditions for Newton's method. [PDF]
, 2000 The classical Kantorovich theorem on Newton's method assumes that the first derivative of the operator involved satisfies a Lipschitz condition 0[F(x)-F(y)]Lx-y. In this paper, we weaken this condition, assuming that 0[F(x)-F(x0)](x-x0) for a given point
Hernández, M.A.
core +2 more sources
Convergence of the relaxed Newton's method [PDF]
, 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 < λ < 2.
Argyros, I.K. +3 more
core +1 more source
On a Convex Acceleration of Newton's Method [PDF]
, 1999 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 ...
J. A. Ezquerro +3 more
core +1 more source
Can we know what Newton's scientific method is? [PDF]
روش شناسی علوم انسانی, 2020 I have tried to retrieve Newton’s scientific method. To do so, I raise two principal questions: 1. What is Newton’s evolving scientific method that he devised in The Principia and Opticks during a period of fifty years? 2.
saeid zibakalam
doaj +1 more source
Newton's method under weak Kantorovich conditions [PDF]
, 2000 The classical Kantorovich theorem on Newton's method assumes that the derivative of the operator involved satisfies a Lipschitz condition ∥F′(x) - F′(y)∥ ≤ L∥x - y∥. In this paper we weaken this condition, assuming that ∥F′(x) - F′(x 0)∥ ≤ L∥x - x 0∥ for
Gutiérrez, J.M. [0000-0002-0434-7250] +1 more
core +1 more source
Computing Weighted Analytic Center for Linear Matrix Inequalities Using Infeasible Newton’s Method
Journal of Mathematics, 2015 We study the problem of computing weighted analytic center for system of linear matrix inequality constraints. The problem can be solved using Standard Newton’s method.
Shafiu Jibrin
doaj +1 more source
Improved semi-local convergence of the Gauss-Newton method for systems of equations
Journal of Mathematical Sciences and Modelling, 2018 Our new technique of restricted convergence domains is employed to provide a finer convergence analysis of the Gauss-Newton method in order to solve a certain class of systems of equations under a majorant condition. The advantages are obtained under the
Santhosh George, İoannis K Argyros
doaj +1 more source
Developments of Newton’s Method under Hölder Conditions
European Journal of Mathematical Analysis, 2022 The semi-local convergence criteria for Newton’s method are weakened without new conditions. Moreover, tighter error distances are provided as well as a more precise information on the location of the solution.
Samundra Regmi +3 more
doaj +1 more source
An acceleration of Newton's method: Super-Halley method [PDF]
, 2001 From a study of the convexity we give an acceleration for Newton's method and obtain a new third order method. Then we use this method for solving non-linear equations in Banach spaces, establishing conditions on convergence, existence and uniqueness of ...
Gutiérrez, J.M. [0000-0002-0434-7250] +1 more
core +1 more source
Generalized Differentiability Conditions for Newton's Method. [PDF]
, 2002 The use of majorizing sequences is the usual way to prove the convergence of Newton's method. An alternative technique to majorizing sequences is provided in this paper, in which three scalar sequences are used, so that the analysis of convergence is ...
Ezquerro, J.A. [0000-0001-8120-167X] +1 more
core +1 more source