Approximations of Continuous Newton\u27s Method: An Extension of Cayley\u27s Problem

Abstract

Continuous Newton\u27s Method refers to a certain dynamical system whose associated flow generically tends to the roots of a given polynomial. An Euler approximation of this system, with step size h=1, yields the discrete Newton\u27s method algorithm for finding roots. In this note we contrast Euler approximations with several different approximations of the continuous ODE system and, using computer experiments, consider their impact on the associated fractal basin boundaries of the root

    Similar works