in this paper, we will present a modification of the preconditioned aor-type method for solving the linear system. a theorem is given to show the convergence rate of modification of the preconditioned aor methods that can be enlarged than the convergence aor method.

in this paper, we present a new iterative method with order of convergence eighth for solving nonlinear equations. periteration this method requires three evaluations of the function and one evaluation of its first derivative. a general error analysis providing the eighth order of convergence is given. several numerical examples are given to illustrate the efficiency and performance of the new ...

a systematic way is presented for the construction of multi-step iterative method with frozen jacobian. the inclusion of an auxiliary function is discussed. the presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of newton multi-step method. the auxiliary function provides us the way to overcome the singul...

this paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the accelerated overrelaxation (aor) method. in this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...

consider the linear system ax=b where the coefficient matrix a is an m-matrix. in the present work, it is proved that the rate of convergence of the gauss-seidel method is faster than the mixed-type splitting and aor (sor) iterative methods for solving m-matrix linear systems. furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a precondition...

consider the linear system ax=b where the coefficient matrix a is an m-matrix. in the present work, it is proved that the rate of convergence of the gauss-seidel method is faster than the mixed-type splitting and aor (sor) iterative methods for solving m-matrix linear systems. furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a precondition...

Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...

A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...

in this work, a new iterative method is proposed for obtaining the approximate solution of a class of hammerstein type integral equations system. the main structure of this method is based on the richardson iterative method for solving an algebraic linear system of equations. some conditions for existence and unique solution of this type equations are imposed. convergence analysis and error bou...