A Fixed-Point Iteration Method with Quadratic Convergence

Abstract

The fixed-point iteration algorithm is turned into a quadratically convergent scheme for a system of nonlinear equations. Most of the usual methods for obtaining the roots of a system of nonlinear equations rely on expanding the equation system about the roots in a Taylor series, and neglecting the higher order terms. Rearrangement of the resulting truncated system then results in the usual Newton-Raphson and Halley type approximations. In this paper the introduction of unit root functions avoids the direct expansion of the nonlinear system about the root, and relies, instead, on approximations which enable the unit root functions to considerably widen the radius of convergence of the iteration method. Methods for obtaining higher order rates of convergence and larger radii of convergence are discussed.