A note on a posteriori error bound of zabrejko and nguen for zincenko's iteration
- 1 January 1987
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 9 (9-10) , 987-994
- https://doi.org/10.1080/01630568708816270
Abstract
An a posteriori error bound for the Zincenko iteration for solving nonlinear equations in Banach spaces is given without proff in Zabrejko and Nguen [7]. In the present paper, this bound is dervied based on a principle developed in a series of papers by Yamamoto[4-6]. Furthermore, it is shown to be sharper than Miel-type bounds[2]Keywords
This publication has 6 references indexed in Scilit:
- The majorant method in the theory of newton-kantorovich approximations and the pták error estimatesNumerical Functional Analysis and Optimization, 1987
- Error bounds for Newton-like methods under Kantorovich type assumptionsJapan Journal of Applied Mathematics, 1986
- A method for finding sharp error bounds for Newton's method under the Kantorovich assumptionsNumerische Mathematik, 1986
- Majorizing sequences and error bounds for iterative methodsMathematics of Computation, 1980
- Optimal Error Bounds for the Newton–Kantorovich TheoremSIAM Journal on Numerical Analysis, 1974
- A Unified Convergence Theory for a Class of Iterative ProcessesSIAM Journal on Numerical Analysis, 1968