NITSOL: A Newton iterative solver for nonlinear systems

Journal Article · Thu Jan 01 00:00:00 EST 1998 · SIAM Journal on Scientific Computing

DOI:https://doi.org/10.1137/S1064827596303843· OSTI ID:599820

Pernice, M ^[1]; Walker, H F ^[2]

---

1. Univ. of Utah, Salt Lake City, UT (United States). Center for High Performance Computing
2. Utah State Univ., Logan, UT (United States). Dept. of Mathematics and Statistics

The authors 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.

• Sponsoring Organization: USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
• DOE Contract Number: FG03-94ER25221
• OSTI ID: 599820
• Journal Information: SIAM Journal on Scientific Computing, Vol. 19, Issue 1; Other Information: PBD: Jan 1998
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
NEWTON METHOD
NONLINEAR PROBLEMS
N CODES
PARALLEL PROCESSING
ALGORITHMS