A choice of forcing terms in inexact Newton method

Inexact Newton method is one of the effective tools for solving systems of nonlinear equations. In each iteration step of the method, a forcing term, which is used to control the accuracy when solving the Newton equations, is required. The choice of the forcing terms is of great importance due to their strong influence on the behavior of the inexact Newton method, including its convergence, efficiency, and even robustness. To improve the efficiency and robustness of the inexact Newton method, a new strategy to determine the forcing terms is given in this paper. With the new forcing terms, the inexact Newton method is locally Q-superlinearly convergent. Numerical results are presented to support the effectiveness of the new forcing terms.

[1]  Trond Steihaug,et al.  Truncated-newtono algorithms for large-scale unconstrained optimization , 1983, Math. Program..

[2]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[3]  William Gropp,et al.  Newton-Krylov-Schwarz Methods in CFD , 1994 .

[4]  Werner C. Rheinboldt,et al.  Methods for solving systems of nonlinear equations , 1987 .

[5]  Homer F. Walker,et al.  An Inexact Newton Method for Fully Coupled Solution of the Navier-Stokes Equations with Heat and Mass Transport , 1997 .

[6]  Yousef Saad,et al.  Hybrid Krylov Methods for Nonlinear Systems of Equations , 1990, SIAM J. Sci. Comput..

[7]  Homer F. Walker,et al.  On backtracking failure in newton-GMRES methods with a demonstration for the navier-stokes equations , 2002 .

[8]  Homer F. Walker,et al.  Choosing the Forcing Terms in an Inexact Newton Method , 1996, SIAM J. Sci. Comput..

[9]  Gerard L. G. Sleijpen,et al.  Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations , 1998, SIAM J. Sci. Comput..

[10]  Owe Axelsson,et al.  On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces , 1995, SIAM J. Sci. Comput..

[11]  Stefania Bellavia,et al.  A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations , 2001, SIAM J. Sci. Comput..

[12]  Yousef Saad,et al.  Convergence Theory of Nonlinear Newton-Krylov Algorithms , 1994, SIAM J. Optim..

[13]  David E. Keyes,et al.  Nonlinearly Preconditioned Inexact Newton Algorithms , 2002, SIAM J. Sci. Comput..

[14]  L. Luksan.  Inexact trust region method for large sparse systems of nonlinear equations , 1994 .

[15]  Hengbin An,et al.  On Convergence of the Additive Schwarz Preconditioned Inexact Newton Method , 2005, SIAM J. Numer. Anal..

[16]  R. Dembo,et al.  INEXACT NEWTON METHODS , 1982 .

[17]  Z. Lužanin.  Parameter selection for inexact Newton method , 1997 .

[18]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[19]  D. Keyes,et al.  Jacobian-free Newton-Krylov methods: a survey of approaches and applications , 2004 .

[20]  Homer F. Walker,et al.  NITSOL: A Newton Iterative Solver for Nonlinear Systems , 1998, SIAM J. Sci. Comput..

[21]  R. D. Murphy,et al.  Iterative solution of nonlinear equations , 1994 .

[22]  Homer F. Walker,et al.  Globally Convergent Inexact Newton Methods , 1994, SIAM J. Optim..

[23]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[24]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .