Local convergence analysis of the Gauss-Newton-Kurchatov method
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910614807379968 |
|---|---|
| author | Argyros, Ioannis K. Shakhno, Stepan |
| author_facet | Argyros, Ioannis K. Shakhno, Stepan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1906_03505 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Local convergence analysis of the Gauss-Newton-Kurchatov method Argyros, Ioannis K. Shakhno, Stepan Numerical Analysis 65F20, 65G99, 65H10, 49M15 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. |
| title | Local convergence analysis of the Gauss-Newton-Kurchatov method |
| topic | Numerical Analysis 65F20, 65G99, 65H10, 49M15 |
| url | https://arxiv.org/abs/1906.03505 |