he Jacobi and Gauss-Seidel algorithms are among the stationary iterative methods for solving linear system of equations. They are now mostly used as preconditioners for the popular iterative solvers. In this dissertation a modification of these methods are proposed and we call them semi-fixed generalized Jacobi and semi-fixed generalized Gauss-Seidel, and their convergence properties are studied. Some numerical examples are given to show the efficiency of the new methods.

A Dissertation Submitted in partial fulfillment of the Requirements for the Degree of Master of Science in Mathematics