An interval version of Chebyshev's method for nonlinear operator equations
โ Scribed by R.E. Moore; Shen Zuhe
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 765 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we are interested in the solution of nonlinear inverse problems of the form F (x) = y. We propose an implicit Landweber method, which is similar to the third-order midpoint Newton method in form, and consider the convergence behavior of the implicit Landweber method. Using the discrep
To search a given real interval for roots, our algorithm is to replace \(f(\lambda)\) by \(f_{N}(\lambda)\), its \(N\)-term Chebyshev expansion on the search interval \(\lambda \in\left[\lambda_{\min }, \lambda_{\max }\right]\), and compute the roots of this proxy. This strategy is efficient if and
Building on the method of Kantorovich majorants, we give convergence results and error estimates for the two-step Newton method for the approximate solution of a nonlinear operator equation.