Miodrag S. Petković

TL;DR: This book is the first on the topic and explains the most cutting-edge methods needed for precise calculations and explores the development of powerful algorithms to solve research problems using multipoint methods.

TL;DR: In this paper, the authors introduce Iterative methods without derivatives, Generalized root iterations, Bell's polynomials and parallel disk iterations, and Computational efficiency of simultaneous methods.

TL;DR: Interval arithmetic circular complex inclusion forms best approximations by disks inclusion of polynomial zeros simultaneous inclusion of complex zeros improved inclusion methods for polynomials parallel implementation of inclusion methods numerical stability of iterative processes numerical computation of curvilinear integrals as discussed by the authors.

TL;DR: It is proved that these methods have the convergence order eight requiring only four function evaluations per iteration, and supports the Kung-Traub hypothesis on the upper bound 2^n of the order of multipoint methods based on n+1 function evaluations.

TL;DR: It is proved that these methods have the convergence order $2^n$, requiring only $n+1$ function evaluations per iteration, and supports the Kung-Traub hypothesis on the upper bound of the order of multipoint methods based on function evaluations.