Kholoud Abdulaah Alzahrani

Mrs. Kholoud Abdulaah Alzahrani


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 April 2024 in Axioms
Verified
Journal Article
Open access
PDF file
KAKholoud Abdulaah Alzahrani
Kholoud Abdulaah Alzahrani
NANawal Alzaid
Nawal Alzaid
RNRahmatullah Ibrahim Nuruddeen
Rahmatullah Ibrahim Nuruddeen
MAM. Al-Mazmumy
M. Al-Mazmumy
The present manuscript proposes a computational approach to efficiently tackle a class of two-point boundary value problems that features third-order nonlinear ordinary differential equations. Specifically, this approach is based upon a combination of the shooting method with a modification of the renowned Adomian decomposition method. The approach starts by transforming the governing BVP into two appropriate initial-value problems, and thereafter, solves the resulting IVPs recurrently. In addition, the application of this method to varied test models remains feasible—of course, this is supported by the competing Runge–Kutta method, among others, and reported through comparison plots and tables.

22 May 2024 in Journal of Umm Al-Qura University for Applied Sciences
Verified
Journal Article
Open access
PDF file
RNRahmatullah Ibrahim Nuruddeen
Rahmatullah Ibrahim Nuruddeen
KAKholoud Abdulaah Alzahrani
Kholoud Abdulaah Alzahrani
NANawal Alzaid
Nawal Alzaid
MAM. Al-Mazmumy
M. Al-Mazmumy
This research aims to present an efficient numerical method to find approximate numerical solutions for ordinary differential equations (ODEs), specifically, the class of two-point boundary value models. This approach is predicated on coupling the shooting method and the decomposition method, which the method is named as Efficient Decomposition Shooting Method (EDSM). Thus, we provide the complete outline of EDSM, and thereafter, apply it to some test models, comprising linear and nonlinear models. Further, the results are then validated by comparing them to the exact solution and other computational methods. Thus, the proposed method performs excellently over its peers, and is found to converge rapidly to the available exact solution with a good precision.