A globally convergent procedure for solving a system of nonlinear algebraic equations

Abstract

A reliable computational procedure for solving a system of algebraic equations of the general form F(x)=0 is presented. Global convergence is achieved through the requirement that the norm //F// decreases at each iteration as far as is feasible. A discussion of convergence and illustrative examples are given for two variable systems and these considerations are extended to systems of n equations in n variables with particular reference to three variable systems.