2021
DOI: 10.1108/hff-07-2021-0466
|View full text |Cite
|
Sign up to set email alerts
|

Robustness of convergence demonstrated byparametric-guiding andcomplex-root-tunneling algorithms for Bratu’s problem

Abstract: Purpose This study aims to propose the parametric-guiding algorithm, the complex-root (CR) tunneling algorithm and the method that integrates both algorithms for the heat and fluid flow (HFF) community, and apply them to nonlinear Bratu’s boundary-value problem (BVP) and Blasius BVP. Design/methodology/approach In the first algorithm, iterations are primarily guided by a diminishing parameter that is introduced to reduce magnitudes of fictitious source terms. In the second algorithm, when iteration-related b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 29 publications
0
2
0
Order By: Relevance
“…Saravi et al (2013) and Das et al (2016) used the variational iteration method (VIM) to analyse the numerical solution of Bratu’s problem. Similarly, the Adomian decomposition method (ADM) (Deeba et al , 2000; Wazwaz, 2005), finite difference method (Temimi and Ben-Romdhane, 2016), Laplace transform decomposition (LTM) (Khuri, 2004), neural network method (Kumar and Yadav, 2015), Laguerre wavelet method (Shiralashetti and Kumbinarasaiah, 2018), restarted Adomian method (Vahidi and Hasanzade, 2012), Bernstein polynomial approximation (Ghomanjani and Shateyi, 2019), Bessel collocation method (BCM) (Roul and Prasad Goura, 2020), Picard’s method (Tomar and Pandey, 2019), parametric-guiding and the complex-root tunnelling algorithm (Liu et al , 2022), the hybrid method (Raja et al , 2016), etc., have been used to analyse the solution of Bratu’s problem.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Saravi et al (2013) and Das et al (2016) used the variational iteration method (VIM) to analyse the numerical solution of Bratu’s problem. Similarly, the Adomian decomposition method (ADM) (Deeba et al , 2000; Wazwaz, 2005), finite difference method (Temimi and Ben-Romdhane, 2016), Laplace transform decomposition (LTM) (Khuri, 2004), neural network method (Kumar and Yadav, 2015), Laguerre wavelet method (Shiralashetti and Kumbinarasaiah, 2018), restarted Adomian method (Vahidi and Hasanzade, 2012), Bernstein polynomial approximation (Ghomanjani and Shateyi, 2019), Bessel collocation method (BCM) (Roul and Prasad Goura, 2020), Picard’s method (Tomar and Pandey, 2019), parametric-guiding and the complex-root tunnelling algorithm (Liu et al , 2022), the hybrid method (Raja et al , 2016), etc., have been used to analyse the solution of Bratu’s problem.…”
Section: Introductionmentioning
confidence: 99%
“…algorithm (Liu et al, 2022), the hybrid method (Raja et al, 2016), etc., have been used to analyse the solution of Bratu's problem.…”
Section: Introductionmentioning
confidence: 99%