NITSOL: A Newton Iterative Solver for Nonlinear Systems
نویسندگان
چکیده
منابع مشابه
NITSOL: A Newton Iterative Solver for Nonlinear Systems
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...
متن کاملNewton-Type Iterative Solver for Multiple View $L2$ Triangulation
In this paper, we show that the L2 optimal solutions to most real multiple view L2 triangulation problems can be efficiently obtained by two-stage Newton-like iterative methods, while the difficulty of such problems mainly lies in how to verify the L2 optimality. Such a working two-stage bundle adjustment approach features the following three aspects: first, the algorithm is initialized by symm...
متن کاملAltered Jacobian Newton Iterative Method for Nonlinear Elliptic Problems
We present an Altered Jacobian Newton Iterative Method for solving nonlinear elliptic problems. Effectiveness of the proposed method is demonstrated through numerical experiments. Comparison of our method with Newton Iterative Method is also presented. Convergence of the Newton Iterative Method is highly sensitive to the initialization or initial guess. Reported numerical work shows the robustn...
متن کاملNewton Two-stage Parallel Iterative Methods for Nonlinear Problems
Two-stage parallel Newton iterative methods to solve nonlinear systems of the form F (x) = 0 are introduced. These algorithms are based on the multisplitting technique and on the two-stage iterative methods. Convergence properties of these methods are studied when the Jacobian matrix F ′(x) is either monotone or an H-matrix. Furthermore, in order to illustrate the performance of the algorithms ...
متن کاملA new iterative with memory class for solving nonlinear equations
In this work we develop a new optimal without memory class for approximating a simple root of a nonlinear equation. This class includes three parameters. Therefore, we try to derive some with memory methods so that the convergence order increases as high as possible. Some numerical examples are also presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 1998
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s1064827596303843