We introduce a well-developed Newton iterative (truncated Newton) algorithm for solving large-scale nonlinear systems. The framework is an inexact Newton method globalized by backtracking. Trial steps are obtained using one of several Krylov subspace methods. The algorithm is implemented in a Fortran solver called NITSOL that is robust yet easy to use and provides a number of useful options and features. The structure offers the user great flexibility in addressing problem specificity through preconditioning and other means and allows easy adaptation to parallel environments. Features and capabilities are illustrated in numerical experiments.
%0 Journal Article
%1 pernice1998nitsol
%A Pernice, Michael
%A Walker, Homer F.
%D 1998
%I Society for Industrial & Applied Mathematics (SIAM)
%J SIAM Journal on Scientific Computing
%K 65f10-iterative-methods-for-linear-systems 65h10-systems-of-nonlinear-algebraic-equations 65n22-pdes-bvps-solution-of-discretized-equations
%N 1
%P 302--318
%R 10.1137/s1064827596303843
%T NITSOL: A Newton Iterative Solver for Nonlinear Systems
%U https://doi.org/10.1137%2Fs1064827596303843
%V 19
%X We introduce a well-developed Newton iterative (truncated Newton) algorithm for solving large-scale nonlinear systems. The framework is an inexact Newton method globalized by backtracking. Trial steps are obtained using one of several Krylov subspace methods. The algorithm is implemented in a Fortran solver called NITSOL that is robust yet easy to use and provides a number of useful options and features. The structure offers the user great flexibility in addressing problem specificity through preconditioning and other means and allows easy adaptation to parallel environments. Features and capabilities are illustrated in numerical experiments.
@article{pernice1998nitsol,
abstract = {We introduce a well-developed Newton iterative (truncated Newton) algorithm for solving large-scale nonlinear systems. The framework is an inexact Newton method globalized by backtracking. Trial steps are obtained using one of several Krylov subspace methods. The algorithm is implemented in a Fortran solver called NITSOL that is robust yet easy to use and provides a number of useful options and features. The structure offers the user great flexibility in addressing problem specificity through preconditioning and other means and allows easy adaptation to parallel environments. Features and capabilities are illustrated in numerical experiments.
},
added-at = {2020-07-28T09:25:01.000+0200},
author = {Pernice, Michael and Walker, Homer F.},
biburl = {https://www.bibsonomy.org/bibtex/2bfab326c83cf91bf30543d1fa82da086/gdmcbain},
doi = {10.1137/s1064827596303843},
interhash = {9476a02e5c9d6306162b720c476c5606},
intrahash = {bfab326c83cf91bf30543d1fa82da086},
journal = {{SIAM} Journal on Scientific Computing},
keywords = {65f10-iterative-methods-for-linear-systems 65h10-systems-of-nonlinear-algebraic-equations 65n22-pdes-bvps-solution-of-discretized-equations},
month = jan,
number = 1,
pages = {302--318},
publisher = {Society for Industrial {\&} Applied Mathematics ({SIAM})},
timestamp = {2020-07-28T09:25:01.000+0200},
title = {{NITSOL}: A Newton Iterative Solver for Nonlinear Systems},
url = {https://doi.org/10.1137%2Fs1064827596303843},
volume = 19,
year = 1998
}