Mohd Norfadli Suardi and Jumat Sulaiman (2021) On redlichkister finite difference solution of twopoint boundary value problems using halfsweep kaudd successive over relaxation iteration. International Journal of Engineering Trends and Technology, 69 (2). pp. 7782. ISSN 2231 – 5381
Text
On redlichkister finite difference solution of twopoint boundary value problems using halfsweep kaudd successive over relaxation iteration FULL TEXT.pdf Restricted to Registered users only Download (525kB)  Request a copy 

Text
On redlichkister finite difference solution of twopoint boundary value problems using halfsweep kaudd successive over relaxation iteration ABSTRACT.pdf Download (36kB) 
Abstract
This paper deals with the application of two newly established RedlichKister Finite Difference (RKFD) discretization schemes for approximating and solving twopoint boundary value problems (TPBVPs). To get the RedlichKister Finite Difference Solution of the proposed problem, firstly, two newly secondorder halfsweep RKFD discretization schemes are established and used to discretize overall derivative terms of the TPBVPs regarding getting the secondorder halfsweep RKFD approximation equation. Then this RKFD approximation equation leads to the construct of the linear system. Due to the increase in the convergence rate iteratively in solving this linear system, the combination of the Kaudd Successive Over Relaxation (KSOR) method with a halfsweep approach is formulated and then known as Halfsweep Kaudd Successive Over Relaxation (HSKSOR) method. With the purpose of evaluating the efficiency of the HSKSOR method, other methods such as Fullsweep Kaudd Successive Over Relaxation (FSKSOR) and Fullsweep GaussSeidel (FSGS) are also presented as a control method. The results of the examples of TPBVPs are tested to prove that the HSKSOR iteration is more efficient compared with FSGS and FSKSOR iterations in terms of iterations, execution time, and maximum norm.
Item Type:  Article 

Keyword:  Boundary Value Problems , RedlichKister Finite Difference Scheme , KSOR Iteration , Halfsweep concept. alue problems, RedlichKister Finite Difference scheme, KSOR iteration, Halfsweep concept. 
Subjects:  Q Science > Q Science (General) Q Science > QA Mathematics 
Department:  FACULTY > Faculty of Science and Natural Resources 
Depositing User:  SAFRUDIN BIN DARUN  
Date Deposited:  07 May 2021 07:58 
Last Modified:  07 May 2021 07:58 
URI:  https://eprints.ums.edu.my/id/eprint/26959 
Actions (login required)
View Item 