Preconditioned successive over relaxation iterative method via semi-approximate approach for Burgers’ equation

<span lang="EN-US">This paper proposes the combination of a preconditioner applied with successive over relaxation (SOR) iterative method for solving sparse and huge scale linear system (LS) in which its coefficient matrix is tridiagonal matrix. The purpose applying to enhance convergence rate SOR method. Hence, order examine feasibility proposed (PSOR) method, first we need derive approximation equation one-dimensional (1D) Burgers’ through discretization process second-order implicit finite difference (SIFD) scheme together semi-approximate (SA) approach have been problem. Then, generated LS modified into preconditioned (PLS) construct formulation PSOR Furthemore, analyze compared other point methods, three examples 1D are considered. In conclusion, superior than PGS simulation results showed that our has low iteration numbers execution time.</span>