Performance analysis of the family of conjugate gradient iterative methods with non-polynomial spline scheme for solving second- and fourth-order two point boundary value problems

A numerical solution involving two-point boundary value problems has vast contributions especially to formulate problems mathematically in fields such as science, engineering, and economics. In response to that, this study was conducted to solve for the secondand fourth-order two-point boundary val...

Full description

Saved in:
Bibliographic Details
Main Author: Hynichearry Justine
Format: Thesis
Language:English
Published: 2018
Subjects:
Online Access:https://eprints.ums.edu.my/id/eprint/22608/1/Performance%20analysis.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-ums-ep.22608
record_format uketd_dc
spelling my-ums-ep.226082019-07-12T07:23:18Z Performance analysis of the family of conjugate gradient iterative methods with non-polynomial spline scheme for solving second- and fourth-order two point boundary value problems 2018 Hynichearry Justine QA Mathematics A numerical solution involving two-point boundary value problems has vast contributions especially to formulate problems mathematically in fields such as science, engineering, and economics. In response to that, this study was conducted to solve for the secondand fourth-order two-point boundary value problems (BVPs) by using cubic and quartic non-polynomial spline discretization schemes for full-, half- and quarter-sweep cases. The derivation process based on the cubic and quartic non-polynomial spline functions were implemented to generate the full-, half- and quarter-sweep cases non-polynomial spline approximation equations. After that, the non-polynomial spline approximation equations were used to generate the corresponding systems of linear equations in a matrix form. Since the systems of linear equations have large and sparse coefficient matrices, therefore the linear systems were solved by using the family of Conjugate Gradient (CG) iterative method. In order to conduct the performances comparative analysis of the CG iterative method, there are two other iterative methods were considered which are Gauss-Seide(l GS) and Successive-Over-Relaxatio(nS OR)a long with the full-, half- and quarter-sweep concepts. Furthermore, the numerical experiments were demonstrated by solving three examples of second- and fourth-order two-point BVPs in order to investigate the performance analysis in terms of the number of iterations, execution time and maximum absolute error. Based on the numerical results obtained from the implementation of the three iteration families together with the cubic and quartic non-polynomial spline schemes, the performance analysis of the CG iterative method was found to be superior to the GS and SOR iteration families in terms of the number of iteration, execution time and maximum absolute error when solving the two-point BVPs. Hence, it can be stated that the CG iteration family is more efficient and accurate than the GS and SOR iteration families when solving the secondorder two-point BVPs based on the cubic and quartic non-polynomial spline schemes. However, for the fourth-order two-point BVPs, the numerical results have shown that the implementation of the CG iteration family over the reduced system of second-order two-point BVPs failed to satisfy the convergence iteration criteria. As a result, the SOR iteration family is superior to GS iteration family in terms of the number of iteration, execution time and maximum absolute error. 2018 Thesis https://eprints.ums.edu.my/id/eprint/22608/ https://eprints.ums.edu.my/id/eprint/22608/1/Performance%20analysis.pdf text en public phd masters University Malaysia Sabah Faculty of Science and Natural
institution Universiti Malaysia Sabah
collection UMS Institutional Repository
language English
topic QA Mathematics
spellingShingle QA Mathematics
Hynichearry Justine
Performance analysis of the family of conjugate gradient iterative methods with non-polynomial spline scheme for solving second- and fourth-order two point boundary value problems
description A numerical solution involving two-point boundary value problems has vast contributions especially to formulate problems mathematically in fields such as science, engineering, and economics. In response to that, this study was conducted to solve for the secondand fourth-order two-point boundary value problems (BVPs) by using cubic and quartic non-polynomial spline discretization schemes for full-, half- and quarter-sweep cases. The derivation process based on the cubic and quartic non-polynomial spline functions were implemented to generate the full-, half- and quarter-sweep cases non-polynomial spline approximation equations. After that, the non-polynomial spline approximation equations were used to generate the corresponding systems of linear equations in a matrix form. Since the systems of linear equations have large and sparse coefficient matrices, therefore the linear systems were solved by using the family of Conjugate Gradient (CG) iterative method. In order to conduct the performances comparative analysis of the CG iterative method, there are two other iterative methods were considered which are Gauss-Seide(l GS) and Successive-Over-Relaxatio(nS OR)a long with the full-, half- and quarter-sweep concepts. Furthermore, the numerical experiments were demonstrated by solving three examples of second- and fourth-order two-point BVPs in order to investigate the performance analysis in terms of the number of iterations, execution time and maximum absolute error. Based on the numerical results obtained from the implementation of the three iteration families together with the cubic and quartic non-polynomial spline schemes, the performance analysis of the CG iterative method was found to be superior to the GS and SOR iteration families in terms of the number of iteration, execution time and maximum absolute error when solving the two-point BVPs. Hence, it can be stated that the CG iteration family is more efficient and accurate than the GS and SOR iteration families when solving the secondorder two-point BVPs based on the cubic and quartic non-polynomial spline schemes. However, for the fourth-order two-point BVPs, the numerical results have shown that the implementation of the CG iteration family over the reduced system of second-order two-point BVPs failed to satisfy the convergence iteration criteria. As a result, the SOR iteration family is superior to GS iteration family in terms of the number of iteration, execution time and maximum absolute error.
format Thesis
qualification_name Doctor of Philosophy (PhD.)
qualification_level Master's degree
author Hynichearry Justine
author_facet Hynichearry Justine
author_sort Hynichearry Justine
title Performance analysis of the family of conjugate gradient iterative methods with non-polynomial spline scheme for solving second- and fourth-order two point boundary value problems
title_short Performance analysis of the family of conjugate gradient iterative methods with non-polynomial spline scheme for solving second- and fourth-order two point boundary value problems
title_full Performance analysis of the family of conjugate gradient iterative methods with non-polynomial spline scheme for solving second- and fourth-order two point boundary value problems
title_fullStr Performance analysis of the family of conjugate gradient iterative methods with non-polynomial spline scheme for solving second- and fourth-order two point boundary value problems
title_full_unstemmed Performance analysis of the family of conjugate gradient iterative methods with non-polynomial spline scheme for solving second- and fourth-order two point boundary value problems
title_sort performance analysis of the family of conjugate gradient iterative methods with non-polynomial spline scheme for solving second- and fourth-order two point boundary value problems
granting_institution University Malaysia Sabah
granting_department Faculty of Science and Natural
publishDate 2018
url https://eprints.ums.edu.my/id/eprint/22608/1/Performance%20analysis.pdf
_version_ 1747836531804995584