Application of half-sweep sor iteration with nonlocal arithmetic discretization scheme for solving Burger's equation

• Main Authors: N. F. A. Zainal, Sulaiman, Jumat, M. U. Alibubin
• Format: Article
• Language: English; English
• Published: Asian Research Publishing Network 2019
• Subjects: QA101-(145) Elementary mathematics. Arithmetic
• Online Access: https://eprints.ums.edu.my/id/eprint/29053/1/Application%20of%20half-sweep%20sor%20iteration%20with%20nonlocal%20arithmetic%20discretization%20scheme%20for%20solving%20Burger%27s%20equation%20ABSTRACT.pdf; https://eprints.ums.edu.my/id/eprint/29053/2/Application%20of%20half-sweep%20sor%20iteration%20with%20nonlocal%20arithmetic%20discretization%20scheme%20for%20solving%20Burger%27s%20equation%20FULL%20TEXT.pdf; https://eprints.ums.edu.my/id/eprint/29053/; http://www.arpnjournals.org/jeas/research_papers/rp_2019/jeas_0219_7597.pdf
• Institution: Universiti Malaysia Sabah

In this paper, the Burger’s equations have been approximated by using the second-order finite difference scheme and the half-sweep nonlocal arithmetic discretization scheme to construct the half-sweep generated linear system. Then, we investigate the applicable formulation of Half-sweep SuccessiveOver Relaxation (HSSOR) iterative method for solving this linear system. In order to verify the effectiveness of the HSSOR iterative method, this paper also included the Fullsweep Successive OverRelaxation (FSSOR) and Full-Sweep Gauss-Seidel (FSGS) iterative methods. The performance analysis of these three proposed iterative methods is illustrated by solving four proposed Burger’s problems. The numerical results illustrate the great performance of the HSSOR iterative method together with half-sweep nonlocal arithmetic discretization scheme to solve the Burger’s equations in senses of execution time and number of iterations.