Newton-Ellipsoid Method and its Polynomiography
From MaRDI portal
Publication:6511580
arXiv1410.2202MaRDI QIDQ6511580FDOQ6511580
Authors: Bahman Kalantari, Eric Hans Lee 
Abstract: We introduce a new iterative root-finding method for complex polynomials, dubbed {it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in cite{kalFTA}, according to which at each complex number a half-space can be found containing a root. Newton-Ellipsoid method combines this property, bounds on zeros, together with the plane-cutting properties of the Ellipsoid Method. We present computational results for several examples, as well as corresponding polynomiography. Polynomiography refers to algorithmic visualization of root-finding. Newton's method is the first member of the infinite family of iterations, the {it basic family}. We also consider general versions of this ellipsoid approach where Newton's method is replaced by a higher-order member of the family such as Halley's method.
This page was built for publication: Newton-Ellipsoid Method and its Polynomiography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6511580)
