Quartic non-polynomial spline solution for solving two-point boundary value problems by using Conjugate Gradient Iterative Method

UNSPECIFIED (2017) Quartic non-polynomial spline solution for solving two-point boundary value problems by using Conjugate Gradient Iterative Method. Journal of Applied Mathematics and Computational Mechanics, 16 (1). pp. 41-50. ISSN p-2299-9965, e-2353-0588,

[img]
Preview
Text
Cubic Non-Polynomial Solution for Solving Two-Point Boundary Value Problems Using SOR Iterative Method.pdf

Download (126kB) | Preview
[img]
Preview
Text
Quartic non-polynomial spline solution for solving two-point boundary value problems by using Conjugate Gradient Iterative Method.pdf

Download (432kB) | Preview

Abstract

Solving two-point boundary value problems has become a scope of interest among many researchers due to its significant contributions in the field of science, engineering, and economics which is evidently apparent in many previous literary publications. This present paper aims to discretize the two-point boundary value problems by using a quartic non-polynomial spline before finally solving them iteratively with Conjugate Gradient (CG) method. Then, the performances of the proposed approach in terms of iteration number, execution time and maximum absolute error are compared with Gauss-Seidel (GS) and Successive Over-Relaxation (SOR) iterative methods. Based on the performances analysis, the two-point boundary value problems are found to have the most favorable results when solved using CG compared to GS and SOR methods.

Item Type: Article
Keyword: two-point boundary value problems, quartic non-polynomial spline,Conjugate Gradient,Successive Over-Relaxation,Gauss-Seidel
Subjects: Q Science > QA Mathematics
Depositing User: OTHMAN HJ RAWI -
Date Deposited: 19 Mar 2019 11:18
Last Modified: 28 Apr 2020 22:23
URI: https://eprints.ums.edu.my/id/eprint/21660

Actions (login required)

View Item View Item