Newton-Raphson method, scaling at fractal boundaries and Mathematica
The paper is concerned with the basins of convergence of the cubic polynomial having real roots using the Newton-Raphson iteration. The fractal boundaries between the basins of convergence of roots of polynomials obtained by the Newton-Raphson method, involving computer experiments, have been initiated by \textit{K.-H. Becker} and \textit{M. Dörfler} [Dynamical systems and fractals (1989; Zbl 0784.68090)]. The author extends these results to a cubic polynomial having nonequispaced roots. An algorithm for the computation of the basin boundaries on the real axis is developed. This algorithm requires much less time compared to the time required by a search method. MATHEMATICA programs implementing this algorithm are also given in Appendix C.
- Cayley's problem and Julia sets
- Dynamical Systems and Fractals
- Exhibiting chaos and fractals with a microcomputer
- scientific article; zbMATH DE number 4070823 (Why is no real title available?)
- scientific article; zbMATH DE number 53694 (Why is no real title available?)
- scientific article; zbMATH DE number 107539 (Why is no real title available?)
This page was built for publication: Newton-Raphson method, scaling at fractal boundaries and Mathematica
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894082)