Some projection methods for the approximation of implicit functions
From MaRDI portal
Publication:756378
The author approximates implicit functions by using a modification of the Newton-Kantorovich method which involves projection operators. His error estimates generalize those of \textit{F. A. Potra} and \textit{V. Pták} [Numer. Math. 34, 63-72 (1980; Zbl 0434.65034)] and of \textit{P. P. Zabrejko} and \textit{D. F. Nguen} [Numer. Funct. Anal. Optimization 9, 671- 684 (1987; Zbl 0627.65069)].
Recommendations
Cites work
- A note on a posteriori error bound of zabrejko and nguen for zincenko's iteration
- A Unified Convergence Theory for a Class of Iterative Processes
- scientific article; zbMATH DE number 3206520 (Why is no real title available?)
- scientific article; zbMATH DE number 3308769 (Why is no real title available?)
- On Newton's method and nondiscrete mathematical induction
- Optimal Error Bounds for the Newton–Kantorovich Theorem
- Sharp error bounds for Newton's process
- The majorant method in the theory of newton-kantorovich approximations and the pták error estimates
Cited in
(8)- scientific article; zbMATH DE number 3889921 (Why is no real title available?)
- scientific article; zbMATH DE number 55009 (Why is no real title available?)
- scientific article; zbMATH DE number 569314 (Why is no real title available?)
- scientific article; zbMATH DE number 1750752 (Why is no real title available?)
- scientific article; zbMATH DE number 222526 (Why is no real title available?)
- scientific article; zbMATH DE number 223523 (Why is no real title available?)
- On the approximate solution of implicit functions using the Steffensen method
- Efficient approximation of implicitly defined functions: general theorems and classical benchmark studies
This page was built for publication: Some projection methods for the approximation of implicit functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756378)