Improbability of nonconvergence in a cubic root-finding method
This paper is concerned with the structure of the nonconvergent set NC(Ef) of initial points for which the Euler method for finding the roots of real functions \[ x_{k+1}=Ef(x_ k),\quad where\quad Ef(x)=x- [f(x)/f'(x)][1+f(x)\cdot f(x)/2(f'(x))^ 2] \] fails to converge. The theorem is proved, that NC(Ef) is a Cantor set of Lebesgue measure zero. As referred in the paper, the conditions of the theorem (they are satisfied, for example, if f is a polynomial with all roots real) are adapted from similar conditions used by \textit{D. Saari} and \textit{J. Urenko} [Am. Math. Mon. 91, 3-17 (1984; Zbl 0532.58016)] and \textit{J. Urenko} [J. Math. Anal. Appl. 117, 42-47 (1986; Zbl 0634.58008)], where a similar result was shown for Newton's method. The theorem is established by reducing questions about the Euler method to a problem on Newton's method.
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- scientific article; zbMATH DE number 3856296 (Why is no real title available?)
- scientific article; zbMATH DE number 3714611 (Why is no real title available?)
- scientific article; zbMATH DE number 3302855 (Why is no real title available?)
- Improbability of nonconvergent chaos in Newton's method
- Newton's Method and Symbolic Dynamics
- Newton's Method, Circle Maps, and Chaotic Motion
- Newton’s Algorithm and Chaotic Dynamical Systems
- On inequalities of the Turán type
This page was built for publication: Improbability of nonconvergence in a cubic root-finding method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107954)
