Convergence Theory of Nonlinear Newton–Krylov Algorithms
- 1 May 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 4 (2) , 297-330
- https://doi.org/10.1137/0804017
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- On the Global Convergence of Trust Region Algorithms Using Inexact Gradient InformationSIAM Journal on Numerical Analysis, 1991
- A Theoretical Comparison of the Arnoldi and GMRES AlgorithmsSIAM Journal on Scientific and Statistical Computing, 1991
- Hybrid Krylov Methods for Nonlinear Systems of EquationsSIAM Journal on Scientific and Statistical Computing, 1990
- Reduced storage matrix methods in stiff ODE systemsApplied Mathematics and Computation, 1989
- A Local Convergence Theory for Combined Inexact-Newton/Finite-Difference Projection MethodsSIAM Journal on Numerical Analysis, 1987
- Matrix-Free Methods for Stiff Systems of ODE’sSIAM Journal on Numerical Analysis, 1986
- The Use of Iterative Linear-Equation Solvers in Codes for Large Systems of Stiff IVPs for ODEsSIAM Journal on Scientific and Statistical Computing, 1986
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient MethodSIAM Journal on Numerical Analysis, 1984
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- A characterization of superlinear convergence and its application to quasi-Newton methodsMathematics of Computation, 1974