Béla Finta (2005)
Open Mathematics
Similarity:
In this paper we propose a new method for solving nonlinear systems of equations in finite dimensional spaces, combining the Newton-Raphson's method with the SOR idea. For the proof we adapt Kantorovich's demonstration given for the Newton-Raphson's method. As applications we reobtain the classical Newton-Raphson's method and the author's Newton-Kantorovich-Seidel type result.
Yan Gao (2001)
Applications of Mathematics
Similarity:
The paper is devoted to two systems of nonsmooth equations. One is the system of equations of max-type functions and the other is the system of equations of smooth compositions of max-type functions. The Newton and approximate Newton methods for these two systems are proposed. The Q-superlinear convergence of the Newton methods and the Q-linear convergence of the approximate Newton methods are established. The present methods can be more easily implemented than the previous ones, since...
Lukšan, Ladislav, Matonoha, Ctirad, Vlček, Jan
Similarity:
New positive definite preconditioners for the matrix free truncated Newton method are given. Corresponding algorithms are described in detail. Results of numerical experiments that confirm the efficiency and robustness of the preconditioned truncated Newton method are reported.
José Antonio Ezquerro, Daniel González, Miguel Ángel Hernández (2013)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
From Kantorovich’s theory we present a semilocal convergence result for Newton’s method which is based mainly on a modification of the condition required to the second derivative of the operator involved. In particular, instead of requiring that the second derivative is bounded, we demand that it is centered. As a consequence, we obtain a modification of the starting points for Newton’s method. We illustrate this study with applications to nonlinear integral equations of mixed Hammerstein...
Ioannis K. Argyros (2005)
Applicationes Mathematicae
Similarity:
The Newton-Kantorovich approach and the majorant principle are used to provide new local and semilocal convergence results for Newton-like methods using outer or generalized inverses in a Banach space setting. Using the same conditions as before, we provide more precise information on the location of the solution and on the error bounds on the distances involved. Moreover since our Newton-Kantorovich-type hypothesis is weaker than before, we can cover cases where the original Newton-Kantorovich...
José Antonio Ezquerro, Daniel González, Miguel Ángel Hernández (2012)
ESAIM: Mathematical Modelling and Numerical Analysis
Similarity:
From Kantorovich’s theory we present a semilocal convergence result for Newton’s method which is based mainly on a modification of the condition required to the second derivative of the operator involved. In particular, instead of requiring that the second derivative is bounded, we demand that it is centered. As a consequence, we obtain a modification of the starting points for Newton’s method. We illustrate this study with applications to ...
Henry Brougham, Edward John Routh
Similarity:
Ioannis Argyros (1999)
Applicationes Mathematicae
Similarity:
We use inexact Newton iterates to approximate a solution of a nonlinear equation in a Banach space. Solving a nonlinear equation using Newton iterates at each stage is very expensive in general. That is why we consider inexact Newton methods, where the Newton equations are solved only approximately, and in some unspecified manner. In earlier works [2], [3], natural assumptions under which the forcing sequences are uniformly less than one were given based on the second Fréchet derivative...
Jonas Koko (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
Newton's iteration is studied for the numerical solution of an elliptic PDE with nonlinear boundary conditions. At each iteration of Newton's method, a conjugate gradient based decomposition method is applied to the matrix of the linearized system. The decomposition is such that all the remaining linear systems have the same constant matrix. Numerical results confirm the savings with respect to the computational cost, compared with the classical Newton method with factorization at each...