Newton-like method with modification of the right-hand-side vector

Authors:
Nataša Krejić;Zorana Lužanin
Affiliations:
Institute of Mathematics, University of Novi Sad, Trg Dositeja Obradovic´a 4, 21000 Novi Sad, Yugoslavia;Institute of Mathematics, University of Novi Sad, Trg Dositeja Obradovic´a 4, 21000 Novi Sad, Yugoslavia
Venue:
Mathematics of Computation
Year:
2002

Citing 9
Cited 1

A new sparsity preserving quasi-Newton update for solving nonlinear equations

SIAM Journal on Scientific and Statistical Computing
A family of quasi-Newton methods for nonlinear equations with direct secant updates of matrix factorizations

SIAM Journal on Numerical Analysis
A view of unconstrained optimization

Optimization
Comparing algorithms for solving sparse nonlinear systems of equations

SIAM Journal on Scientific and Statistical Computing
Inexact trust region method for large sparse systems of nonlinear equations

Journal of Optimization Theory and Applications
Choosing the forcing terms in an inexact Newton method

SIAM Journal on Scientific Computing - Special issue on iterative methods in numerical linear algebra; selected papers from the Colorado conference
A uniformly convergent finite difference scheme for a singularly perturbed semilinear equation

SIAM Journal on Numerical Analysis
On a numerical method for discrete analogues for boundary value problems

Nonlinear Analysis: Theory, Methods & Applications
Iterative solution of nonlinear equations in several variables

Iterative solution of nonlinear equations in several variables

Analysis of two Chebyshev-like third order methods free from second derivatives for solving systems of nonlinear equations

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new Newton-like method which defines new iterates using a linear system with the same coefficient matrix in each iterate. while the correction is performed on the right-hand-side vector of the Newton system. In this way a method is obtained which is less costly than the Newton method and faster than the fixed Newton method. Local convergence is proved for nonsingular systems. The influence of the relaxation parameter is analyzed and explicit formulae for the selection of an optimal parameter are presented. Relevant numerical examples are used to demonstrate the advantages of the proposed method.