Quartic non-polynomial spline solution for solving two-point boundary value problems by using Conjugate Gradient Iterative Method
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 t...
Saved in:
| Format: | Article |
|---|---|
| Language: | English English |
| Published: |
16(1):41-50 · March 2017
2017
|
| Subjects: | |
| Online Access: | https://eprints.ums.edu.my/id/eprint/21660/1/Cubic%20Non-Polynomial%20Solution%20for%20Solving%20Two-Point%20Boundary%20Value%20Problems%20Using%20SOR%20Iterative%20Method.pdf https://eprints.ums.edu.my/id/eprint/21660/7/Quartic%20non-polynomial%20spline%20solution%20for%20solving%20two-point%20boundary%20value%20problems%20by%20using%20Conjugate%20Gradient%20Iterative%20Method.pdf https://eprints.ums.edu.my/id/eprint/21660/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|