QSSOR and cubic non-polynomial spline method for the solution of two- point boundary value problems

Andang Sunarto and P Agarwal and Chew, Jackel Vui Lung and H Justine and Jumat Sulaiman (2021) QSSOR and cubic non-polynomial spline method for the solution of two- point boundary value problems.

[img] Text
ABSTRACT.pdf

Download (54kB)
[img] Text
FULLTEXT.pdf
Restricted to Registered users only

Download (1MB) | Request a copy

Abstract

Two-point boundary value problems are commonly used as a numerical test in developing an efficient numerical method. Several researchers studied the application of a cubic non-polynomial spline method to solve the two-point boundary value problems. A preliminary study found that a cubic non-polynomial spline method is better than a standard finite difference method in terms of the accuracy of the solution. Therefore, this paper aims to examine the performance of a cubic non-polynomial spline method through the combination with the full-, half-, and quarter-sweep iterations. The performance was evaluated in terms of the number of iterations, the execution time and the maximum absolute error by varying the iterations from full-, half-to quarter-sweep. A successive over-relaxation iterative method was implemented to solve the large and sparse linear system. The numerical result showed that the newly derived QSSOR method, based on a cubic non-polynomial spline, performed better than the tested FSSOR and HSSOR methods.

Item Type: Proceedings
Keyword: QSSOR , Two-point boundary value problems , Cubic non-polynomial spline
Subjects: Q Science > QA Mathematics > QA1-939 Mathematics
Department: FACULTY > Faculty of Science and Natural Resources
Depositing User: DG MASNIAH AHMAD -
Date Deposited: 31 Oct 2022 11:05
Last Modified: 31 Oct 2022 11:05
URI: https://eprints.ums.edu.my/id/eprint/34631

Actions (login required)

View Item View Item