We present some three-step iterative methods to find roots of several variables functions. These methods do not need the evaluation of the second order derivative of the given n-valued nonlinear function. The new methods are extensions of iterative methods to find roots of nonlinear equation f(x) = 0. Convergency of the methods is proved. We provide numerical results to show the efficiency of the new methods for systems of nonlinear equations. It is observed that new methods take less number of iterations than the Newton’s method. We compare the run time of the Newton’s method and new three- step algorithms. Residual falls of logarithm of residuals show a high-order convergence of the new methods. Also we apply the new algorithms to solve the Chandrasekhar integral equation in radiative transfer.
کلید واژگان :three step method, root finding, iteration number, nonlinear system, CPU-time, convergency
ارزش ریالی : 1200000 ریال
با پرداخت الکترونیک