A Class of Iterative Methods for Holomorphic Functions.
A convergence analysis of Newton-like methods for singular equations using outer or generalized inverses
The Newton-Kantorovich approach and the majorant principle are used to provide new local and semilocal convergence results for Newton-like methods using outer or generalized inverses in a Banach space setting. Using the same conditions as before, we provide more precise information on the location of the solution and on the error bounds on the distances involved. Moreover since our Newton-Kantorovich-type hypothesis is weaker than before, we can cover cases where the original Newton-Kantorovich...
A Convergence Theorem for a Method for Simultaneous Determination of all Zeros of a Polynomial
A convergence theorem for a method for simultaneous determination of all zeros of a polynomial.
A Correction on a Theorem By Uspensky
A correction to “Cayley's problem”, AM 35 (1990) No. 2, 140-146
A Derivative-Free Transformation Preserving the Order of Convergence of Iteration Methods in Case of Multiple Zeros.
A Family of Root Finding Methods.
A fast floating-point square-rooting routine for the 8080/8085 microprocessors
A majorant principle for multipoint iterations without memory
A method for obtaining third-order iterative formulas.
A Modified Fast Fourier Transform for Polynomial Evaluation and the Jenkins-Traub Algorithm.
A note on Babylonian square-root algorithm and related variants.
A note on Halley's method.
A note on Halley's method
A Note On M. Prešić's Method
A note on M. Presic's method.
A Note on the “Constructing” of Nonstationary Methods for Solving Nonlinear Equations with Raised Speed of Convergence
This paper is partially supported by project ISM-4 of Department for Scientific Research, “Paisii Hilendarski” University of Plovdiv.In this paper we give methodological survey of “contemporary methods” for solving the nonlinear equation f(x) = 0. The reason for this review is that many authors in present days rediscovered such classical methods. Here we develop one methodological schema for constructing nonstationary methods with a preliminary chosen speed of convergence.
A posteriori Error Bounds for the Zeros of a Polynomial.
A Remark on Simultaneous Inclusions of the Zeros of a Polynomial by Gershgorin's Theorem.