Local convergence analysis of the Gauss-Newton-Kurchatov method
From MaRDI portal
Publication:6320184
arXiv1906.03505MaRDI QIDQ6320184FDOQ6320184
Authors: Ioannis Konstantinos Argyros, S. M. Shakhno 
Publication date: 8 June 2019
Abstract: We present a local convergence analysis of the Gauss-Newton-Kurchatov method for solving nonlinear least squares problems with a decomposition of the operator. The method uses the sum of the derivative of the differentiable part of the operator and the divided difference of the nondifferentiable part instead of computing the full Jacobian. A theorem, which establishes the conditions of convergence, radius and the convergence order of the proposed method, is proved (Shakhno 2017). However, the radius of convergence is small in general limiting the choice of initial points. Using tighter estimates on the distances, under weaker hypotheses (Argyros et al. 2013), we provide an analysis of the Gauss-Newton-Kurchatov method with the following advantages over the corresponding results (Shakhno 2017): extended convergence region; finer error distances, and an at least as precise information on the location of the solution. The numerical examples illustrate the theoretical results.
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of solutions to systems of equations (65H10) Newton-type methods (49M15) Error analysis and interval analysis (65G99)
This page was built for publication: Local convergence analysis of the Gauss-Newton-Kurchatov method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320184)
