Semi-approximate solution for burgers’ equation using SOR iteration

• Main Authors: N. F. A. Zainal, Jumat Sulaiman, N. A. M. Ali, Azali Saudi
• Format: Conference or Workshop Item
• Language: English; English
• Published: 2020
• Subjects: Q Science (General); QA299.6-433 Analysis
• Online Access: https://eprints.ums.edu.my/id/eprint/30197/2/Semi-approximate%20Solution%20for%20Burgers%E2%80%99%20Equation%20Using%20SOR%20Iteration.pdf; https://eprints.ums.edu.my/id/eprint/30197/5/Semi-approximate%20solution%20for%20burgers%E2%80%99%20equation%20using%20SOR%20iteration-Abstract.pdf; https://eprints.ums.edu.my/id/eprint/30197/; https://link.springer.com/chapter/10.1007/978-981-33-4069-5_39
• Institution: Universiti Malaysia Sabah

In this article, we propose semi-approximate approach in finding a solution of Burgers’ equation which is one of the partial differential equations (PDEs).Without using the Newton method for linearization, we derive the approximation equation of the proposed problem by using second-order implicit scheme together with the semi-approximate approach. Then this approximation equation leads a huge scale and sparse linear system. Having this linear system, the Successive Overrelaxation (SOR) iteration will be performed as a linear solver. The formulation and execution of SOR iteration are included in this paper. This paper proposed four examples of Burgers’ equations to determine the performance of the suggested method. The test results discovered that the SOR iteration is more effective than GS iteration with less time of execution and minimum iteration numbers.