Choosing the Forcing Terms in an Inexact Newton Method
- 1 January 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 17 (1) , 16-32
- https://doi.org/10.1137/0917003
Abstract
AninexactNewtonmethod is ageneralizationofNewton’smethodforsolvingF(x) 0, F n __Keywords
This publication has 12 references indexed in Scilit:
- Globally Convergent Inexact Newton MethodsSIAM Journal on Optimization, 1994
- Hybrid Krylov Methods for Nonlinear Systems of EquationsSIAM Journal on Scientific and Statistical Computing, 1990
- A Pointwise Quasi-Newton Method for Integral EquationsSIAM Journal on Numerical Analysis, 1988
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1986
- Continuation-Conjugate Gradient Methods for the Least Squares Solution of Nonlinear Boundary Value ProblemsSIAM Journal on Scientific and Statistical Computing, 1985
- Truncated-Newton algorithms for large-scale unconstrained optimizationMathematical Programming, 1983
- Fast Numerical Solution of the Biharmonic Dirichlet Problem on RectanglesSIAM Journal on Numerical Analysis, 1983
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- Introduction to Numerical AnalysisPublished by Springer Nature ,1980
- Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3]ACM Transactions on Mathematical Software, 1979