Have a personal or library account? Click to login

Solving coupled non-linear higher order BVPs using improved shooting method

Open Access
|Jan 2024

Figures & Tables

Fig. 1

Shooting Method
Shooting Method

Fig. 2

Problem 1: Comparison of Algorithm 1, 2 and 3 in approaching f (1) = 0.4, f″(1) = 0 and θ′(1) = 0 after 4 time recursive iterations with h = 0.001.
Problem 1: Comparison of Algorithm 1, 2 and 3 in approaching f (1) = 0.4, f″(1) = 0 and θ′(1) = 0 after 4 time recursive iterations with h = 0.001.

Fig. 3

Problem 1: Comparison of Algorithm 1, 2 and 3 in approaching f (1) = 0.4, f ″(1) = 0 and θ′(1) = 0 after 21 time recursive iterations with h = 0.001.
Problem 1: Comparison of Algorithm 1, 2 and 3 in approaching f (1) = 0.4, f ″(1) = 0 and θ′(1) = 0 after 21 time recursive iterations with h = 0.001.

Fig. 4

Problem 2: Comparison of Algorithm 1, 2 and 3 in approaching f′(10) = 0 after 1 time recursive iterations with h = 0.01.
Problem 2: Comparison of Algorithm 1, 2 and 3 in approaching f′(10) = 0 after 1 time recursive iterations with h = 0.01.

Fig. 5

Problem 2: Comparison of Algorithm 1, 2 and 3 in approaching θ (10) = 0 after 12 times recursive iterations with h = 0.01.
Problem 2: Comparison of Algorithm 1, 2 and 3 in approaching θ (10) = 0 after 12 times recursive iterations with h = 0.01.

Fig. 6

Problem 2:Comparison of Algorithm 1, 2 and 3 in approaching f ′(10) = 0 after 4 times recursive iterations with h = 0.01.
Problem 2:Comparison of Algorithm 1, 2 and 3 in approaching f ′(10) = 0 after 4 times recursive iterations with h = 0.01.

Fig. 7

Problem 2: Comparison of Algorithm 1, 2 and 3 in approaching θ (10) = 0 after 69 times recursive iterations with h = 0.01.
Problem 2: Comparison of Algorithm 1, 2 and 3 in approaching θ (10) = 0 after 69 times recursive iterations with h = 0.01.

Comparison of absolute percentage error of Algorithms 1, 2 and 3 in hitting right BCs f (1) = 0_4, f″(1) = 0 and θ′(1) = 0_

AlgoAb err (%) fAb err (%) f″Ab err (%) θ′

15.999999999950489 × 10−40.00410000.0168000
22 × 10−40.00140000.0013000
30.00000000000.00000000.0000000

Comparison of Algorithms 1, 2 and 3 and their absolute percentage error and number of iterations in hitting conditions θ (10) = 0_

AlgotsθITCPU time [s]Abs err (%) θ

12.4142135623731321.3503838120704730.0000031736694.1733.1736 ×104
22.4142135623731391.3503760737818950.0000001639322.0391.6390 ×105
32.4142135623731491.3503756527243290.0000000000121.1130.0000000000

Comparison of Algorithms 1, 2 and 3 in hitting right BCs f (1) = 0_4, f″(1) = 0 and θ′(1) = 0_

Algotsff″θ′No. of IT

1−2.6809589589908−3.59597271167750.4000060.0000410.00016821
2−2.6809636175929−3.59599085009600.4000020.0000140.00001310
3−2.6809659852767−3.59599155462540.4000000.0000000.0000004

Comparison of Algorithms 1, 2 and 3 and their absolute percentage errors and number of iterations (IT) in hitting conditions f′(10) = 0_

Algotsf′ITAbs err (%) f′

12.4142135623797381.3504339884157890.000000005945.90000000×10−7
22.4142135589788721.350423606035475−0.000003046423.0464000×10−4
32.4142135623731491.3504014225892420.000000000010.0000000000
Language: English
Page range: 165 - 178
Submitted on: Jun 10, 2023
Accepted on: Sep 3, 2023
Published on: Jan 10, 2024
Published by: Harran University
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year

© 2024 Shumaila Javeed, Evren Hincal, published by Harran University
This work is licensed under the Creative Commons Attribution 4.0 License.