 Research
 Open access
 Published:
An efficient numerical approach for solving twopoint fractional order nonlinear boundary value problems with Robin boundary conditions
Advances in Difference Equations volume 2021, Article number: 193 (2021)
Abstract
This article proposes new strategies for solving twopoint Fractional order Nonlinear Boundary Value Problems (FNBVPs) with Robin Boundary Conditions (RBCs). In the new numerical schemes, a twopoint FNBVP is transformed into a system of Fractional order Initial Value Problems (FIVPs) with unknown Initial Conditions (ICs). To approximate ICs in the system of FIVPs, we develop nonlinear shooting methods based on Newton’s method and Halley’s method using the RBC at the right end point. To deal with FIVPs in a system, we mainly employ Highorder Predictor–Corrector Methods (HPCMs) with linear interpolation and quadratic interpolation (Nguyen and Jang in Fract. Calc. Appl. Anal. 20(2):447–476, 2017) into Volterra integral equations which are equivalent to FIVPs. The advantage of the proposed schemes with HPCMs is that even though they are designed for solving twopoint FNBVPs, they can handle both linear and nonlinear twopoint Fractional order Boundary Value Problems (FBVPs) with RBCs and have uniform convergence rates of HPCMs, \(\mathcal{O}(h^{2})\) and \(\mathcal{O}(h^{3})\) for shooting techniques with Newton’s method and Halley’s method, respectively. A variety of numerical examples are demonstrated to confirm the effectiveness and performance of the proposed schemes. Also we compare the accuracy and performance of our schemes with another method.
1 Introduction
Fractional calculus has proven to describe many phenomena in science and engineering more accurately than integerorder calculus because of the nonlocal property of the fractional derivative [2–7]. Many authors have introduced numerical methods for solving fractional differential equations arising in science and engineering. The authors in Refs. [8, 9] proposed a computational algorithm based on reproducing kernel Hilbert space for solving timefractional partial differential equations in porous media and nonlinear homogeneous and nonhomogeneous timefractional equations. In Ref. [10], a numerical method based on multiple fractional power series solution was introduced to deal with the Schrödinger equation. The authors in Refs. [11–14] proposed several numerical methods based on collocation method, finite difference method, and L1 approximation for solving timefractional diffusion equations. Regarding Fractional order Boundary Value Problems (FBVPs), Ref. [15] (and the references therein) investigated a Caputo fractional hybrid twopoint boundary value problem describing the thermostat models. In Ref. [16], the authors studied a fractionalorder nonlocal continuum model of a Euler–Bernoulli beam whose governing equation is described as a FBVP, using the fractional finite element model.
Recently, the authors in Ref. [17] developed a spectral collocation method to deal with twopoint linear multiterm FBVPs with Caputo fractional operator. In Ref. [18], the authors reformulated twopoint FBVPs with a Riemann–Liouville fractional operator to a Volterra integral equation of the second kind and then developed an integral discrete scheme based on finite difference method.
However, numerical methods for solving FNBVPs with Robin Boundary Conditions (RBCs) have been paid less attention to and, in this paper, we consider the twopoint Fractional order Nonlinear Boundary Value Problem (FNBVP) with RBCs:
where \(0 < \alpha _{1} \le 1\), \(1 < \alpha _{2} < 2\), \(\alpha _{1},\alpha _{2}, \gamma _{1}, \gamma _{2} \in \mathbb {R}\). \(D_{a}^{\alpha _{1}}\) and \(D_{a}^{\alpha _{2}}\) are Caputo fractional differentiations defined as follows.
Definition 1.1
Let \(\alpha \in \mathbb {R}^{+}\). The operator \(J^{\alpha }_{a,t}\), defined on \(L_{1}[a,b]\) by
for \(a \leq t \leq b\), is called the Riemann–Liouville fractional integral operator of order α.
We set \(\alpha = 0 \), \(J^{0}_{a} = I\), the identity operator.
Definition 1.2
let \(\alpha \in \mathbb {R}^{+}\). The operator \(D^{\alpha }_{a}\) is defined by
where \(\lceil \ \rceil \) is the ceiling function and \(\lfloor \ \rfloor \) is the floor function.
The multiterm Caputo sense FIVP can be transformed into the system of FIVPs by Theorem 1.1 [19].
Theorem 1.1
Let us consider the following multiterm Caputo sense fractional differential equation with initial conditions:
where \(y^{(j)}(a)\) is the jth derivative at \(t=a\), \(\alpha _{n} > \alpha _{n1} > \cdots \alpha _{1} > 0\), \(\alpha _{i} \alpha _{i1} \leq 1\) for all \(i=2,3,\ldots,n\) and \(0 < \alpha _{1} < 1\). Then we can define \(\beta _{i}\),
Then the multiterm fractional differential equation with initial conditions (2) is equivalent to the following system of fractional differential equations:
together with the initial conditions:
in the following sense:
1. Whenever the function \(y \in C^{\lceil \alpha _{n} \rceil }[a,b]\) is a solution of the multiterm equation with initial conditions (2), the vectorvalued function \(Y := (y_{1},\ldots,y_{n})^{T}\) with
is a solution of the system of fractional differential equations (3a) with initial conditions (3b)
2. Whenever the vectorvalued function \(Y := (y_{1},\ldots,y_{n})^{T}\) is a solution of the system of multiorder fractional differential equations (3a) with initial conditions (3b), the function \(y:=y_{1}\) is a solution of the multiterm equation with initial conditions (2).
In this paper, we propose new schemes to deal with FNBVPs and the algorithms are summarized as follows:

1
In the case that \(0 < \alpha _{1} <1\), we transform the FNBVP (1) with \(a=0\) into a system of FIVPs using Theorem 1.1.
In the case of \(\alpha _{1} = 1\), i.e. the FNBVP (1) has a single term of fractional order \(\alpha _{2}\), we substitute the integer order \(\alpha _{1} = 1\) with the fractional order \(\alpha _{1} = 1\varepsilon \), \(\varepsilon \rightarrow 0+\) so that the FNBVP satisfies the assumption, \(0 < \alpha _{1} < 1\) in Theorem 1.1. First, the Gronwall inequality for twoterm equations in [19] guarantees that the difference between the solution of FNBVP with \(\alpha _{1}=1\) and with \(\alpha _{1} = 1\varepsilon \) approaches 0 as \(\varepsilon \rightarrow 0+\). The FNBVP with \(\alpha _{1} = 1 \varepsilon \) is transformed into a system of FIVPs and then we reduce the number of equations in the system. We prove the reduced system is equivalent to the original system as \(\varepsilon \rightarrow 0+\) in Sect. 2.

2
To deal with FIVPs, we adopt highorder predictor–corrector methods (HPCMs) with linear interpolation and quadratic interpolation [1] into Volterra integral equations which are equivalent to FIVPs.

3
ICs of the FIVPs in the system equivalent to (1) are obtained by RBC at \(t=0\). But ICs include \(s:=y'(0)\) and since s is unknown, we approximate s by means of nonlinear shooting techniques based on Newton’s method and Halley’s method. The error function \(\vert a_{2}y(b, s) + b_{2}y'(b, s)  \gamma _{2} \vert \) is used to construct the rootfinding problem in order to make the approximate solution to \(y(t)\) satisfy the RBC at \(t=b\).

4
The algorithm of the proposed shooting technique is as follows: The system of FIVPs is solved with an initial approximation to s, \(s_{k}\) at the kth iteration. Using the approximate solution to the system obtained by HPCMs with \(s_{0}\), we find \(s_{1}\) by solving Newton’s (Halley’s) formula. We update the approximate solution to the system with \(s_{1}\) and measure the norm of the error function. We repeat this process until the norm of the error function is within the tolerance.
Similar to our proposed schemes, the authors in Refs. [20, 21] introduced numerical methods for solving FBVPs with RBCs. In Refs. [20, 21], the FBVP with RBCs is turned into the FIVP by using a shooting method with a guess for the unknown IC \(y(0)\) and then the FIVP is transformed into the Volterra integral equation. The integral–differential term in the Volterra integral equation is approximated by an integral discretization scheme with constant and firstorder interpolating polynomials in paper [20] and [21], respectively. However, the integral discretization schemes can only handle linear FBVPs and the rate of convergence depends on the fractional order α. This is elaborately addressed in Sect. 4. The main advantages of our proposed schemes are as follows:

1
The proposed schemes can handle both linear and nonlinear FBVPs with general RBCs.

2
Our proposed schemes can deal with multiterm FBVPs where \(0<\alpha _{1}\le 1\) and \(1<\alpha _{2}<2\).

3
Our proposed methods with HPCMs have uniform convergence rates \(\mathcal{O}(h^{2})\) and \(\mathcal{O}(h^{3})\) for shooting techniques based on Newton’s method and Halley’s method, respectively, with enough iterations, regardless of fractional orders thanks to the global error estimates of HPCMs in [1].

4
It is not required to solve a matrix system as Newton’s method and Halley’s method are applied into a system of FIVPs.
This article is organized as follows. In Sect. 2, we describe an idea about the transformation of FNBVP with RBCs (1) into a system of FIVPs. In Sect. 3, we describe nonlinear shooting methods based on Newton’s method and Halley’s method, to approximate unknown IC \(s:=y(0)\) of FIVPs in the system. Also, we briefly mention how to apply the HPCMs into a system of FIVPs in Sect. 3. In Sect. 4, we demonstrate numerical examples verifying that the proposed shooting techniques combined with HPCMs guarantee the global convergence rates of HPCMs. We also confirm the performance and effectiveness of the proposed methods by comparing with the modified integral discretization scheme in Ref. [21]. A conclusion will be given in Sect. 5. Finally tables of numerical results and the linear explicit method which is an alternative method for solving FIVPs are described in the Appendix.
2 Problem formulation
In this section, we describe how to transform the FNBVP with RBCs (1) into a system of FIVPs according to the value of \(\alpha _{1}\). Basically, we apply Theorem 1.1 with \(\beta _{1}:=\alpha _{1}\), \(\beta _{2}:=1\alpha _{1}\), \(\beta _{3}:= \alpha _{2}1\) to the FNBVP in the case of \(0<\alpha _{1}<1\). If \(\alpha _{1}\) is equal to 1, then we replace \(\alpha _{1}\) with \(1\epsilon \), \(\epsilon \rightarrow 0+\) and set \(\beta _{1}:=1\epsilon \), \(\beta _{2}:=\epsilon \), \(\beta _{3}:= \alpha _{2}  1\). We reduce the size of system using the fact \(\beta _{2} \rightarrow 0+\).

Case 1: \(0<\alpha _{1}<1\)
First, we consider a FNBVP with Dirichlet boundary conditions as follows:
Applying Theorem 1.1 with \(\beta _{1}:=\alpha _{1}\), \(\beta _{2}:=1\alpha _{1}\), \(\beta _{3}:= \alpha _{2}1\), the FNBVP with Dirichlet boundary conditions (4) can be transformed as follows:
From the system of fractional differential equations (5), we obtain the following system of FIVPs:
where the IC s is unknown and so needs to be approximated.
Similar to the case of Dirichlet boundary conditions, the FNBVP with RBCs (1) can be written as follows:

Case 2: \(\alpha _{1} = 1\)
We consider the following FBVP with Dirichlet boundary conditions:
where \(1 < \alpha _{2} < 2\), \(\alpha _{2} \in \mathbb {R}\). Since the fractional differential equation in (8) does not satisfy the assumption, \(0<\alpha _{1}<1\) in Theorem 1.1, we cannot apply the strategy used in (4) to (8). So we modify the equation in (8) to meet the assumption, with the same boundary conditions as in (8) as follows:
where \(\alpha _{2} \in (1,2)\), \(\epsilon \rightarrow 0+\). By Lemma 2.1, solutions of the two FBVPs (8) and (9) are approximately equal and the absolute error depends on ϵ.
Lemma 2.1
(First Gronwall inequality for twoterm equations in [19])
Let \(\alpha _{2} > 0\) and \(\alpha _{1},\tilde{\alpha }_{1} \in (0,\alpha _{2})\) be chosen so that the equation
subject to the initial conditions
and
subject to the same initial conditions
(where f satisfies a Lipschitz condition in its second and third arguments on a suitable domain) has unique continuous solutions \(y,z:[0,T]\rightarrow \mathbb {R}\). We assume further that \(\lfloor \alpha _{1}\rfloor = \lfloor \tilde{\alpha _{1}}\rfloor \). Then there exist constants \(K_{1}\) and \(K_{2}\) such that
where \(E_{\alpha _{n}}\) denotes the MittagLeffler function of order \(\alpha _{n}\).
Applying Theorem 1.1 to (9), we obtain the following system of FIVPs:
Now, we show that the system of FIVPs (10) is equivalent to the following system as \(\epsilon \rightarrow 0\) using Lemmas 2.2 through 2.4 and Theorem 2.1:
Lemma 2.2
(Theorem 2.10 in [19])
Let \(f\in C[a,b]\) and \(\alpha \ge 0\). Moreover, assume that \(\alpha _{k}\) is a sequence of positive numbers such that \(\alpha _{k} \rightarrow \alpha \) as \(k \rightarrow \infty \). Then, for every \(\delta >0\),
Lemma 2.3
(Lemma 6.19 in [19])
Let \(\alpha , T, \phi _{1}, \phi _{2}\in \mathbb{R}^{+}\). Moreover, assume that \(\delta : [0,T]\rightarrow \mathbb{R}\) is a continuous function satisfying the inequality
Then
Lemma 2.4
Let \(0<\gamma \leq \alpha \leq \beta \). Then, for any \(t\in [a,b]\),
Proof
By Definition 1.1,
Then
□
Theorem 2.1
Let \(1<\alpha _{2}<2\), \(^{\forall } T\in \mathbb {R}^{+}\) and \(f:[0,T]\times \mathbb {R}\times \mathbb {R}\rightarrow \mathbb {R}\) satisfies the Lipschiz condition in its second and third arguments on a suitable domain. Then we have the following inequality:
where \(^{\forall } t \in [0,T]\), \(x_{1},x_{2},y_{1},y_{2} : [0,T] \rightarrow \mathbb {R}\) and \(0< L\).
If, for any \(0 <\epsilon \ll 1\), ŷ and ỹ are solutions of the following systems, respectively:
and
then
Proof
By Lemma 6.2 in [19], FIVPs \(D^{1\epsilon }_{0}\hat{y}(t) = w(t)\), \(y(0) = y_{0}\), and \(D^{1 \epsilon }_{0}\tilde{y}(t) = \tilde{z}(t)\), \(\tilde{y}(0) = y_{0}\) are equivalent to Volterra integral equations of the second kind, respectively, as follows:
Then \(\hat{y}(t)  \tilde{y}(t)\) can be expressed as a Riemann–Liouville fractional integral of \(w(t)\tilde{z}(t)\) as follows:
Since \(w(t) = J^{\epsilon }z(t)\) by Lemma 6.2 in [19] and rewriting \(w(t)  \tilde{z}(t)\) as \(w(t)J^{\epsilon }_{0}\tilde{z}(t)+J^{\epsilon }_{0}\tilde{z}(t) \tilde{z}(t)\), we obtain the following inequality:
Since \(D^{\alpha _{2}1}_{0}z(t) = f(t,\hat{y}(t),w(t))\) and \(D^{\alpha _{2}1}_{0}\tilde{z}(t) = f(t,\tilde{y}(t),\tilde{z}(t))\) are equivalent to Volterra integral equations \(z(t) = s+ J^{\alpha _{2}1}_{0}f(t,\hat{y}(t),w(t))\) and \(\tilde{z}(t) = s + J^{\alpha _{2}1}_{0}f(t,\tilde{y}(t),w(t))\) by Lemma 6.2 in [19] respectively, using the Lipschitz condition, (12), and (13), we obtain the following inequalities:
Since \(1<\alpha _{2} <2\) and \(\Gamma (\alpha _{2}) = (\alpha _{2}  1)\Gamma (\alpha _{2}  1)\), we have the following inequalities for \(J^{\alpha _{2}  1}_{0} \vert J^{\epsilon } \tilde{z}(t)  \tilde{z}(t) \vert \):
Similarly, we can obtain the following inequality:
Applying the inequality (16) into (14), we have the following inequality:
Using the inequalities (13) and (17), we have the following inequalities:
Applying the inequality (19) into (18) and using Lemma 2.4 with \(\gamma =\alpha _{2}  1\), \(\alpha = \alpha _{2}  1 + \epsilon \), \(\beta = \alpha _{2}\), we have the following inequalities:
so that
where
Applying Lemma 2.3 to inequality (20), we obtain the following inequality:
Therefore,
We have \(C_{\epsilon } \equiv TLC^{2}_{\epsilon }E_{\alpha _{2}1}[LC^{1}_{ \epsilon }T^{\alpha _{2}1}] + \frac{T^{1\epsilon }}{\Gamma (2\epsilon )}\). Then
Thus, by Lemma 2.2,
□
For the FNBVP with RBCs (1), similarly, by Lemma 2.1 and using Theorem 1.1, we obtain the following FIVPs:
The system (21) can be reduced as follows:
3 Nonlinear shooting methods and highorder predictor–corrector methods
FBVPs have been transformed to systems of FIVPs in Sect. 2. Before we address how to deal with systems of FIVPs (6), (7), (11), and (22) using Highorder Predictor–Corrector Methods (HPCMs), the unknown IC \(z(0)=s\) should be handled first. In this section, we describe two nonlinear shooting techniques based on Newton’s method and Halley’s method to approximate s. Both Newton’s formula and Halley’s formula are designed to determine the solution of a system of FIVPs satisfying the RBC at the right end point of an interval. Without loss of generality, we consider the system of FIVPs (7) that is equivalent to the FNBVP with RBCs (1).
In order that the RBC at the right end point \(a_{2}y(b) + b_{2}y'(b)=\gamma _{2}\) is involved in approximating s, we define \(y(s) := y(s,t) _{t=b}\) and let the error function be \(F(s) := a_{2}y(s)+b_{2}\frac{\partial }{\partial t}y(s)\gamma _{2}\). We approximate the solution of the rootfinding problem \(F(s)=0\) by using Newton’s method and Halley’s method, respectively. For convenience, we denote
throughout this section.
3.1 Shooting with Newton’s method
The conventional Newton formula for \(F(s)=0\) can be expressed as follows:
where m is the maximum number of iterations and
Observing \(y_{s}(s_{k})\) and \(y_{ts}(s_{k})\), it turns out that they are equal to \(\frac{\partial }{\partial s}y(t) _{s=s_{k}, t=b}\) and \(\frac{\partial }{\partial s}z(t) _{s=s_{k}, t=b}\), respectively, in the system of FIVPs (7). Thus we solve the following system obtained from the system of FIVPs (7) by applying the operator \(\frac{\partial }{\partial s}\) using HPCMs for each k:
Since both t and s are independent variables, \(f_{s}(t,y(t),w(t))\) can be written as
The detailed description of HPCMs dealing with a system of FIVPs is in Sect. 3.3. By solving the system (25), \(s_{k+1}\) in Newton’s formula (23) is computed. Using the updated approximate value of IC s, \(s_{k+1}\), we update approximate solutions of systems of FIVPs (6), (7), (11), and (22). Repeating this process, we obtain an \(s_{k}\) having an acceptable error of the rootfinding problem \(F(s)=0\) at an appropriate number of iterations k.
3.2 Shooting with Halley’s method
The conventional Halley formula for \(F(s)=0\) is as follows:
where \(F_{s}(s_{k})\) is described in (24) and
Similar to the way we found \(y_{s}(s_{k})\) and \(y_{ts}(s_{k})\) in the shooting with Newton’s method, we find \(y_{ss}(s_{k})\) and \(z_{ss}(s_{k})\) by solving the following system of FIVPs obtained by applying the operator \(\frac{\partial ^{2}}{\partial s^{2}}\) using HPCMs for each k:
Since t and s are independent variables, \(f_{ss}(t,y(t),w(t))\) can be written as
3.3 Highorder predictor–corrector methods for system of FIVPs
In order to find a \(s_{k}\) with an acceptable accuracy, we iteratively solve systems of FIVPs (25) or (28). Once we find the \(s_{k}\), we solve systems of FIVPs (6), (7), (11), or (22). In this subsection, we describe how to deal with those systems of FIVPs using Highorder Predictor–Corrector Methods (HPCMs) introduced in Ref. [1]. Without loss of generality, we consider the following FIVP:
For convenience, let us denote \(y_{j}\) as approximated value of \(y(t_{j})\) except for \(y_{0}=c_{0}\) and let \(f_{j} \equiv f(t_{j},y_{j})\), \(y^{c}_{j}\) be a corrector of \(y_{j}\), \(y^{p}_{j}\) be a predictor of \(y_{j}\), and \(f_{j}^{p}\equiv f(t_{j}, y_{j}^{p})\), \(j=1,\ldots,N\). If \(j=0\) then \(f_{0} = f(0,c_{0})\). We divide the domain Ω as follows:
For simplicity, let the step size be uniform, which means \(t_{j+1}t_{j} = h\), \(j = 0,1,\ldots,N1\). Then (30) can be rewritten at time \(t_{n+1}\) as follows:
where \(g(t_{n+1}) = \sum_{i=0}^{\lfloor \alpha \rfloor } \frac{(t_{n+1})^{i}}{i!}c_{i}\). We interpolate \(f(\tau ,y(\tau ))\) using linear or quadratic Lagrange polynomials over each interval \(I_{j} = [ t_{j},t_{j+1}]\), \(j=0,1,\ldots,N1\). Then we obtain the following predictor–corrector schemes.

1
HPCM with linear Lagrange polynomial:
$$ \begin{aligned} y^{c}_{n+1} = {}&g(t_{n+1}) + \frac{1}{\Gamma (\alpha )} \Biggl[\sum _{j=0}^{n1} \bigl( B^{1,j}_{n+1}f_{j}+B^{2,j}_{n+1}f_{j+1} \bigr) \\ & {} + B^{1,n}_{n+1}f_{n}+B^{2,n}_{n+1}f^{P}_{n+1} \Biggr], \end{aligned} $$(32)where
$$\begin{aligned}& B^{1,j}_{n+1} = \frac{1}{h} \int _{t_{j}}^{t_{j+1}}(t_{n+1}\tau )^{ \alpha 1}(t_{j+1}\tau )\,d\tau , \\& B^{2,j}_{n+1} = \frac{1}{h} \int _{t_{j}}^{t_{j+1}}(t_{n+1}\tau )^{ \alpha 1}(t_{j}\tau )\,d\tau , \\& y^{P}_{n+1} = g(t_{n+1}) + G_{\alpha , f}(t_{n+1}) + b^{1}_{n+1}f_{n1} + b^{2}_{n+1}f_{n}, \\& b^{1}_{n+1} = \frac{1}{h} \int _{t_{n}}^{t_{n+1}}(t_{n+1}\tau )^{ \alpha 1}(t_{n}\tau )\,d\tau , \\& b^{2}_{n+1} = \frac{1}{h} \int _{t_{n}}^{t_{n+1}}(t_{n+1}\tau )^{ \alpha 1}(t_{n1}\tau )\,d\tau , \\& G_{\alpha , f}(t_{n+1}) = \frac{1}{\Gamma (\alpha )}\sum _{j=0}^{n1} \bigl( B^{1,j}_{n+1}f_{j} + B^{2,j}_{n+1}f_{j+1} \bigr). \end{aligned}$$(33) 
2
HPCM with quadratic Lagrange polynomial:
$$ \begin{aligned} y^{c}_{n+1} = {}&g(t_{n+1}) + \frac{1}{\Gamma (\alpha )} \Biggl[ A^{1,0}_{n+1}f_{0} + A^{2,0}_{n+1}f_{1/2} + A^{3,0}_{n+1}f_{1} \\ & {} +\sum_{j=1}^{n1} \bigl( A^{1,j}_{n+1}f_{j1}+A^{2,j}_{n+1}f_{j}+A^{3,j}_{n+1}f_{j+1} \bigr) \\ & {} + A^{1,n}_{n+1}f_{n1} + A^{2,n}_{n+1}f_{n} + A^{3,n}_{n+1}f^{P}_{n+1} \Biggr], \end{aligned} $$(34)where
$$\begin{aligned}& A^{1,0}_{n+1} = \frac{2}{h^{2}} \int _{t_{j}}^{t_{j+1}}(t_{n+1}\tau )^{ \alpha 1}(t_{1/2}\tau ) (t_{1}\tau )\,d\tau , \\& A^{2,0}_{n+1} = \frac{4}{h^{2}} \int _{t_{j}}^{t_{j+1}}(t_{n+1} \tau )^{\alpha 1}(t_{0}\tau ) (t_{1}\tau )\,d\tau , \\& A^{3,0}_{n+1} = \frac{2}{h^{2}} \int _{t_{j}}^{t_{j+1}}(t_{n+1}\tau )^{ \alpha 1}(t_{0}\tau ) (t_{1/2}\tau )\,d\tau , \\& A^{1,j}_{n+1} = \frac{1}{2h^{2}} \int _{t_{j}}^{t_{j+1}}(t_{n+1} \tau )^{\alpha 1}(t_{j}\tau ) (t_{j+1}\tau )\,d\tau , \\& A^{2,j}_{n+1} = \frac{1}{h^{2}} \int _{t_{j}}^{t_{j+1}}(t_{n+1} \tau )^{\alpha 1}(t_{j1}\tau ) (t_{j+1}\tau )\,d\tau , \\& A^{3,j}_{n+1} = \frac{1}{2h^{2}} \int _{t_{j}}^{t_{j+1}}(t_{n+1} \tau )^{\alpha 1}(t_{j1}\tau ) (t_{j}\tau )\,d\tau , \end{aligned}$$and the predictor \(f^{p}_{n+1}\) is found as follows:
$$ y^{P}_{n+1} = g(t_{n+1}) + G_{\alpha , f}(t_{n+1}) + a^{1}_{n+1}f_{n2} + a^{2}_{n+1}f_{n1} + a^{3}_{n+1}f_{n}, $$(35)where
$$\begin{aligned}& \begin{aligned} G_{\alpha , f}(t_{n+1}) ={}& \frac{1}{\Gamma (\alpha )} \Biggl[ A^{1,0}_{n+1}f_{0} + A^{2,0}_{n+1}f_{1/2} + A^{3,0}_{n+1}y(t_{1}) \\ & {} + \sum_{j=0}^{n1} \bigl( A^{1,j}_{n+1}f_{j1} + A^{2,j}_{n+1}f_{j} + A^{3,j}_{n+1}f_{j+1} \bigr) \Biggr], \end{aligned} \\& {2} a^{1}_{n+1} = \frac{1}{2h^{2}} \int _{t_{n}}^{t_{n+1}}(t_{n+1} \tau )^{\alpha 1}(t_{n1}\tau ) (t_{n}\tau )\,d\tau , \\& a^{2}_{n+1} = \frac{1}{h^{2}} \int _{t_{n}}^{t_{n+1}}(t_{n+1}\tau )^{ \alpha 1}(t_{n2}\tau ) (t_{n}\tau )\,d\tau , \\& a^{3}_{n+1} = \frac{1}{2h^{2}} \int _{t_{n}}^{t_{n+1}}(t_{n+1}\tau )^{ \alpha 1}(t_{n2}\tau ) (t_{n1}\tau )\,d\tau . \end{aligned}$$
Remark 3.1
Using the HPCM with linear and quadratic interpolations, we find predictors \(y^{p}_{n+1}\), \(w^{p}_{n+1}\), \(z^{p}_{n+1}\) individually and then find correctors \({y}^{c}_{n+1}\), \({w}^{c}_{n+1}\), \({z}^{c}_{n+1}\). The entire steps of the proposed schemes are summarized in Appendix B.
The following theorems [1] bound the global error \(E_{n+1}\) of the HPCM with linear and quadratic interpolations, respectively.
Theorem 3.1
(Theorem 2.4 in [1]: Global error of HPCM with linear interpolation)
Define \(E_{n+1}\) to be global error. Suppose \(f(\cdot ,y(\cdot ))\in C^{2}[a,b]\) and furthermore is Lipschitz continuous in the second argument, then we have
given \(E_{1}\le Ch^{2}\).
Theorem 3.2
(Theorem 3.4 in [1]: Global error of HPCM with quadratic interpolation)
Suppose \(f(\cdot ,y(\cdot ))\in C^{3}[a,b]\) and is Lipschitz continuous in the second argument, then we have
given \(E_{1},E_{2} \leq \mathcal{O}(h^{3})\) and \(E_{1/2} \leq O(h^{3\alpha })\), \(0 < \alpha < 1\).
4 Numerical examples
In this section, we experimentally illustrate the performance of the proposed schemes. Numerically, we verify that our proposed schemes can deal with more complex FBVPs than the integral discretization schemes in [20, 21]. For that purpose, the proposed schemes are implemented in FNBVPs with \(0 < \alpha _{1} < 1\) whose exact solutions are polynomial, exponential, and sine functions in Examples 4.1 through 4.3. We investigate absolute errors in maximum norm, convergence rates, and absolute values of the approximated error function \(\vert \tilde{F}(s_{k}) \vert \) with various values of parameters. We discuss linear FBVPs with \(\alpha _{1}=1\) whose exact solutions have low regularity and high regularity in Examples 4.4 and 4.5, respectively. We compare numerical results obtained by our proposed schemes with the integral discretization schemes. But we emphasize that our proposed methods can deal with many different FBVPs unlike the another method in Examples 4.4 and 4.5. Regarding the numerical results shown in the Appendix, let us summarize the parameters used:

h denotes the size of time subinterval.

\(s_{0}\) denotes the initial approximation of the sequence \(\{s_{k}\}\) in proposed shooting methods.

k denotes the number of iterations needed to meet a tolerance in the sequence \(\{s_{k}\}\) generated by the proposed Newton’s method or Halley’s method.

m denotes the maximum number of iterations in Newton’s and Halley’s methods.

Tol denotes the tolerance used to measure the error of the approximated error function \(\vert \tilde{F}(s_{k}) \vert \) in Newton’s method and Halley’s method.

N denotes the number of time subintervals.

\(y^{c}_{j}\) denotes the approximate solution at \(t_{j}\) obtained by the proposed shooting technique based on either Newton’s method or Halley’s method, with HPCM. \(y(t_{j})\) denotes the exact solution at \(t_{j}\).

Max. error denotes the pointwise absolute errors in the maximum norm. (i.e. \(\max_{1\le j \le N} \vert y^{c}_{j}  y(t_{j}) \vert \))

\(E_{\alpha , \beta }(t)\) denotes the twoparameter function of MittagLeffler type [7].
In Examples 4.1 through 4.3, we transform the FNBVP into the system of FIVPs (7) and \(s_{0}\) means an initial approximation to \(y'(0)\). In Examples 4.4 and 4.5, the linear FBVP is transformed into the system of FIVPs (22) with \(\epsilon = 10^{10}\) and \(s_{0}\) means an initial approximation to \(y(0)\). For all examples except for Example 4.4, we implement the shooting technique based on Newton’s method (Halley’s method) combined with HPCM with linear (quadratic) interpolation to verify the order of convergence \(\mathcal{O}(h^{2})\) (\(\mathcal{O}(h^{3}) \)), respectively.
Example 4.1
Consider the following doubleterm FNBVP with RBCs:
where the exact solution is \(y(t)=t^{4}\).
Example 4.2
Consider the following doubleterm FNBVP with RBCs:
where
and the exact solution is \(y(t) = e^{\lambda t}  ( 1+\lambda t + \frac{\lambda ^{2}}{2}t^{2} + \frac{\lambda ^{3}}{3!}t^{3} )\).
Example 4.3
Consider the following doubleterm FNBVP with RBCs:
where
and the exact solution is \(y(t) = \sin (\lambda t)  t + \frac{t^{3}}{6}\).
In Examples 4.1, 4.2, and 4.3, we observe the following:

1
For all three examples, \(w(t)\), \(z(t)\), \(f(t,y,w)\) (e.g. \(D_{0}^{\alpha _{1}}y(t)\), \(y'(t)\), \(f(t,y, D_{0}^{\alpha _{2}}y(t))\)) belong to \(C^{3}[0,1]\). By Theorems 3.1 and 3.2, thus, computed convergence profiles are estimated \(\mathcal{O}(h^{2})\) and \(\mathcal{O}(h^{3})\) for the HPCM with linear (quadratic) interpolation combined with shooting technique based on Newton’s (Halley’s) method, respectively.

2
Tables 1, 4, 7 show the absolute values of approximated error function (41) at \(s_{m}\) (i.e. \(\vert a_{2}y^{c}_{N}(s_{m}) + b_{2}z^{c}_{N}(s_{m})  \gamma _{2} \vert \)) versus the maximum number of iterations m with various initial values \(s_{0}\). \(y^{c}_{N}(s_{m})\) and \(z^{c}_{N}(s_{m})\) are computed by using proposed schemes. We set \(\alpha _{1} = 0.4\), \(\alpha _{2} = 1.7\), \(h=0.01\) in all tables. From numerical results in those tables, we can verify that the sequence \(\{s_{k}\}\) obtained by the proposed shooting algorithms approaches to the IC s within the error at least 10^{−16} when m is at most 10 with \(s_{0}=0.2, 0.4, 0.6, 0.8, 1.0\) for each. This leads us to the conclusion that the proposed shooting techniques show a good performance with remarkable accuracy regarding to approximation of the IC s.

3
Tables 2, 5, 8 show pointwise absolute errors in the maximum norm and convergence rates computed versus the number of subintervals N in the cases of \(s_{0}=0.2, 1.0\) for each of Newton’s and Halley’s method. We set \(\alpha _{1} = 0.4\), \(\alpha _{2} = 1.7\). The sequence \(\{s_{k}\}\) was computed up to \(s_{10}\) so, based on the observation of Tables 1, 4, 7, we see that the error of the approximated error function \(\vert \tilde{F}(s_{k}) \vert \) does not have an effect on the convergence rate of \(y^{c}_{j}\) obtained by HPCMs. In Tables 2, 5, 8, we can see that computed convergence profiles obtained by the proposed schemes approach 2 for Newton’s method and 3 for Halley’s method as N is increased. Thus numerical results shown in those tables support that the proposed methods follow global error estimates of HPCMs.

4
Proposed methods are tested for a variety of values of \(\alpha _{1}\), \(\alpha _{2}\) and numerical results for each pair of \((\alpha _{1}, \alpha _{2})\) are shown in Tables 3, 6, 9. For each pair of fractional orders \((\alpha _{1}, \alpha _{2})\) pointwise absolute errors in the maximum norm, computed convergence rates, CPU time executed in seconds, and number of iterations k such that \(\vert \tilde{F}(s_{k}) \vert < \mathit{Tol}\) versus the number of subintervals N are listed in the tables. The initial approximation to s was set \(s_{0} = 0.2\) in all three tables. In order to minimize the number of iterations k, the tolerance was set \(\mathit{Tol}=10^{5}\) for Newton’s method and \(\mathit{Tol}=10^{10}\) for Halley’s method in Table 3, \(\mathit{Tol}=10^{10}\) for both shooting techniques in Table 6, and \(\mathit{Tol}=10^{15}\) for Newton’s method and \(\mathit{Tol}=10^{16}\) for Halley’s method in Table 9. Numerical results shown in the tables demonstrate that, for all suggested pairs of fractional orders, rates of convergence approach 2 for Newton’s method, 3 for Halley’s method that are theoretical convergence rates of HPCMs. In Tables 3 and 9, we observe that the number of iterations k required to meet the tolerance at \((0.9, 1.1)\) is relatively greater than other pairs of fractional orders for both Newton’s and Halley’s method.

5
Figures 1, 2, and 3 illustrate convergence profiles obtained by the proposed methods with the variety of fractional orders. From the figures, we can see that computed rates of convergence are nearly \(\mathcal{O}(h^{2})\) and \(\mathcal{O}(h^{3})\) for the proposed shooting method with Newton’s and Halley’s schemes, respectively. Figures 4 and 5 display graphs of pointwise absolute errors versus the time step h. The approximate solution is computed by the proposed method with Newton’s method (in Fig. 4) and Halley’s method (in Fig. 5), respectively.
Example 4.4
Consider the following singleterm linear FBVP with RBCs:
where \(1 < \alpha _{2} < 2\),
and the exact solution is \(y(t) = t^{\alpha _{2}}+t^{2\alpha _{2}1}+1+3t+4t^{3}+t^{4}\) [21].
Since \(D_{0}^{\alpha _{1}}y(t)\), \(y'(t)\), \(D_{0}^{\alpha _{2}}y(t)\) do not belong to \(C^{3}[0,1]\), global error estimates of HPCMs in Theorems 3.1 and 3.2 cannot be applied to Example 4.4. Alternatively, we adopt the linear explicit method described in Appendix A with proposed shooting techniques. In this example, we compare the accuracy and convergence rate of the approximate solution obtained by the proposed shooting technique based on Newton’s method with the modified integral discretization scheme [21] for each \(\alpha _{2} = 1.1, 1.3, 1.5, 1.7, 1.9\). In Table 10, we can observe that our proposed method consumes less CPU time than the modified integral discretization scheme [21] even though both methods shows the equal performance.
Example 4.5
Consider the following singleterm linear FBVP with RBCs:
whose \(1 < \alpha < 2\) and the exact solution is
In Example 4.5, we compare the performance of our proposed methods with the modified integral discretization scheme [21]. Table 11 shows pointwise absolute errors and computed convergence profiles versus the number of subintervals for each \(\alpha _{2} = 1.1, 1.3, 1.5, 1.7, 1.9\). In Table 11, we can see that, for all values of \(\alpha _{2}\), the computed rates of convergence obtained by the proposed shooting technique based on Halley’s method combined with thirdorder HPCM are around 3.0 while the computed rates of convergence obtained by the modified integral discretization scheme [21] are around 2.0.
The algorithm of the proposed shooting techniques with secondorder HPCM requires less than the number of arithmetic operations needed by the modified integral discretization scheme to solve a FBVP with RBCs than the modified integral discretization scheme [21] because the predictor and corrector in HPCMs share the computation of the memory effect. As a result the proposed shooting technique based on Newton’s method consumes less CPU than the modified discretization scheme [21] and the CPU time executed by the proposed shooting technique based on Halley’s method is approximately equal to the CPU time executed by the modified integral discretization scheme [21], as shown in Table 11.
Figure 6 illustrates convergence profiles obtained by the proposed methods and the modified integral discretization scheme [21] with the variety of fractional orders. From the graphs, we can see that computed rates of convergence are nearly \(\mathcal{O}(h^{2})\) for the proposed shooting method with Newton’s technique and the modified integral discretization scheme [21], \(\mathcal{O}(h^{3})\) for the proposed shooting method with Halley’s scheme, respectively. Plots exhibited in Figs. 7, 8, 9 display pointwise absolute errors in maximum norm versus the time step h and the approximate solution is computed by the modified integral discretization scheme [21] (in Fig. 7), the proposed shooting technique with Newton’s method (in Fig. 8), the proposed shooting technique with Halley’s method (in Fig. 9), respectively.
Example 4.6
Consider the following singleterm linear FBVP with RBCs:
where \(1 < \alpha _{2} < 2\).
The exact solution of Example 4.6 is unknown so we alter the measure to estimate the errors employing the uniform twomesh differences and orders of convergence introduced in [22]:
where \(y^{c}_{2j}\) denotes the approximate solution at \(t_{2j}\) by the proposed methods with \(h=1/2N\). Using the errors \(e_{N}\), we estimate the convergence profiles as follows:
In this example, we compare performances of our proposed shooting methods with the finite difference method proposed in [22] and the numerical results are shown in Table 12. We observe the following from the results:

1
In Table 12, uniform twomesh difference errors and convergence rates computed by

(a)
the finite difference method [22],

(b)
the proposed shooting technique based on Newton’s method with linear explicit method described in Appendix A,

(c)
the proposed shooting technique based on Newton’s method with HPCM,

(d)
the proposed shooting technique based on Halley’s method with HPCM
versus the number of time step N as \(\alpha _{2}=1.3,1.5,1.7,1.9\) are demonstrated. We set \(s_{0}=0.2\), \(\mathit{Tol}=10^{10}\) as our proposed methods are implemented.

(a)

2
It is evident that the uniform twomesh difference errors computed by our proposed methods are less than the finite difference method [22] for all N and \(\alpha _{2}\).

3
The convergence rates obtained by the proposed method with Newton’s method are nearly 2 for all \(\alpha _{2}\) but the rates of convergence computed by Halley’s method are nearly 3 when \(\alpha _{2} = 1.3\) only. Nevertheless we can see that the convergence profiles obtained by our proposed methods are higher than the finite difference method [22]. Figure 10 shows twopoint difference errors in maximum norms versus the number of step N.
5 Conclusion
We introduced new numerical schemes for solving FNBVPs with any RBCs. The idea was to transform a FNBVP into a system of FIVPs. By doing that we could adopt a preexisting numerical method for solving the system of FIVPs and we mainly employed HPCMs. The unknown IC s in the system was approximated by the proposed shooting methods based on Newton’s and Halley’s method and this is the main algorithm of the proposed schemes. Under the assumption that m is large enough so that \(\vert \tilde{F}(s_{m}) \vert \) is small enough, theoretical convergence rates of proposed methods were \(\mathcal{O}(h^{2})\) for shooting with Newton’s method and \(\mathcal{O}(h^{3})\) for shooting with Halley’s method on account of global error estimates in HPCMs.
In Examples 4.1 through 4.3, we verified that the proposed schemes can handle doubleterm FNVBPs with RBCs whose exact solutions include polynomial, exponential, and sine function. Convergence profiles obtained by the proposed schemes were computed as expected by the global error estimates. However, Tables 3, 6, and 9 suggest that the convergence rate of the sequence \(\{s_{k}\}\) depends on fractional orders. We still need to address an error analysis of shooting techniques based on Newton’s and Halley’s methods for solving a system of FIVPs. This will be considered in a subsequent paper. Examples 4.4 and 4.5 demonstrated the performance of proposed methods for solving singleterm linear FBVPs with exact solutions having low regularity and high regularity, respectively. Tables 10 and 11 showed that the proposed methods can deal with not only nonlinear FBVPs but also linear FBVPs. In Example 4.4, we adopted the linear explicit method described in Appendix A and this shows that the proposed shooting techniques can be assembled with not only HPCMs but also other preexisting numerical schemes for solving a system of FIVPs. In Example 4.5, we observed that computed convergence rates obtained by our proposed shooting technique based on Halley’s method with thirdorder HPCM are higher than the modified integral discretization scheme [21].
Availability of data and materials
Not applicable.
References
Nguyen, T.B., Jang, B.: A highorder predictor–corrector method for solving nonlinear differential equations of fractional order. Fract. Calc. Appl. Anal. 20(2), 447–476 (2017)
Caputo, M.: Linear model of dissipation whose Q is almost frequency independent—II. Geophys. J. R. Astron. Soc. 13, 529–539 (1967)
Dalir, M., Bashour, M.: Applications of fractional calculus. Appl. Math. Sci. 4, 1021–1032 (2010)
Das, S.: Functional Fractional Calculus for System Identification and Controls. Springer, Berlin (2008)
Hilfer, R.: Applications of Fractional Calculus in Physics. World Scientific, Singapore (2000)
Magin, R.L.: Fractional Calculus in Bioengineering. Begell House Publishers (2006)
Podlubny, I.: Fractional Differential Equations. Academic Press, San Diego (1999)
Arqub, O.A., Shaqagfeh, N.: Application of reproducing kernel algorithm for solving Dirichlet timefractional diffusionGordon types equations in porous media. J. Porous Media 22(4), 411–434 (2019)
Arqub, O.A.: Numerical algorithm for the solutions of fractional order systems of Dirichlet function types with comparative analysis. Fundam. Inform. 166(2), 111–137 (2019)
Arqub, O.A.: Application of residual power series method for the solution of timefractional Schrödinger equations in onedimensional space. Fundam. Inform. 166(2), 87–110 (2019)
Roul, P., Goura, V.M.K.P.: A high order numerical scheme for solving a class of nonhomogeneous timefractional reaction diffusion equation. Numer. Methods Partial Differ. Equ. https://doi.org/10.1002/num.22594
Roul, P., Rohil, V., EspinosaParedes, G., Goura, V.M.K.P., Gedam, R.S., Obaidurrahman, K.: Design and analysis of a numerical method for fractional neutron diffusion equation with delayed neutrons. Appl. Numer. Math. 157, 634–653 (2020)
Roul, P., Goura, V.M.K.P.: A highorder bspline collocation scheme for solving a nonhomogeneous timefractional diffusion equation. Math. Methods Appl. Sci. 44(1), 546–567 (2020)
Roul, P., Rohil, V., EspinosaParedes, G., Obaidurrahman, K.: An efficient numerical method for fractional neutron diffusion equation in the presence of different types of reactivities. Ann. Nucl. Energy 152, 108038 (2021)
Baleanu, D., Etemad, S., Rezapour, S.: A hybrid Caputo fractional modeling for thermostat with hybrid boundary value conditions. Bound. Value Probl. 2020(1), 64 (2020). https://doi.org/10.1186/s13661020013610
Patnaik, S., Sidhardh, S., Semperlotti, F.: A Ritzbased finite element method for a fractionalorder boundary value problem of nonlocal elasticity. Int. J. Solids Struct. 202, 398–417 (2020)
Cai, H., An, Q.: A fractional spectral collocation method for general Caputo twopoint boundary value problems. Appl. Numer. Math. (2021). https://doi.org/10.1016/j.apnum.2021.01.006
Liu, L.B., Liang, Z., Long, G., Liang, Y.: Convergence analysis of a finite difference scheme for a Riemann–Liouville fractional derivative twopoint boundary value problem on an adaptive grid. J. Comput. Appl. Math. 375, 112809 (2020). https://doi.org/10.1016/j.cam.2020.112809
Diethelm, K.: The Analysis of Fractional Differential Equations: An ApplicationOriented Exposition Using Differential Operators of Caputo Type. Springer, Berlin (2010)
Cen, Z., Huang, J., Le, A.: A modified integral discretization scheme for a twopoint boundary value problem with a Caputo fractional derivative. J. Comput. Appl. Math. 367(15), 112465 (2020)
Cen, Z., Huang, J., Xu, A.: An efficient numerical method for a twopoint boundary value problem with a Caputo fractional derivative an efficient numerical method for a twopoint boundary value problem with a Caputo fractional derivative. J. Comput. Appl. Math. 336, 1–7 (2018)
Stynes, M., Gracia, J.L.: A finite difference method for a twopoint boundary value problem with a Caputo fractional derivative. IMA J. Numer. Anal. 35, 698–721 (2015)
Acknowledgements
We would like to thank the editors of the journal as well as the anonymous reviewers for their valuable suggestions that make the manuscript more consistent.
Funding
This work was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIP) (NRF2016R1D1A1B03935514, NRF2019R1A2C1005142).
Author information
Authors and Affiliations
Contributions
HK: Methodology, Writing—Original and Revision draft, JL: Data curation, Simulation, BJ: Conceptualization of this study, Analysis, Writing—Original and Revision draft. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Consent for publication
Not applicable.
Appendices
Appendix A: Linear explicit method
Let us consider the following linear singleterm FBVP with RBCs:
where \(1 < \alpha _{2} < 2\). By Lemmas 2.1 through 2.4 and Theorem 2.1, the FBVP (36) is equivalent to the following system:
Expressing the solution of (37) as the discretized form of the Volterra integral equation, which is equivalent to (37), we obtain
The approximation solutions to \(y(t_{n+1})\) and \(z(t_{n+1})\) in (38) with \(s_{k}\) can be explicitly described as follows:
Replacing \(y(\tau )\) and \(z(\tau )\) with linear interpolation, we have
Let us shorten the expression of \(y_{n+1}\), \(z_{n+1}\) in (39) as follows:
We omit describing the definitions of \(A^{i}_{j}\), \(B^{i}_{j}\), \(i=1,2\), \(j=0,\ldots, n\), because that is straightforward. Substituting the explicit form of \(y_{n+1}\) into the righthand side of \(z_{n+1}\), we have
Since the righthand side of (40) is linear in \(z_{j}\), \(j=0,\ldots, n+1\), \(z_{n+1}\) can be explicitly expressed as follows:
Appendix B: Step of algorithm
Steps of the proposed algorithms for solving the FNVBP (7)
Input parameters: fractional orders \(\alpha _{1}\), \(\alpha _{2}\); endpoints 0, b; RBCs \(a_{1}\), \(b_{1}\), \(\gamma _{1}\), \(a_{2}\), \(b_{2}\), \(\gamma _{2}\); number of time subintervals N; maximum number of iterations in Newton’s and Halley’s methods m; initial approximation of s \(s_{0}\); tolerance Tol.
 Step 1):

Set \(h=b/N\), \(t_{n} = n\cdot h\), \(k=0\).
 Step 2):

While \((k\le m)\) do Steps \(3\cdots 6\).
 Step 3):

For \(n = 0,\ldots, N1\) do Steps \(31\cdots 33\).
 \(31)\):

Compute predictors \(y^{p}_{n+1}\), \(w^{p}_{n+1}\), \(z^{p}_{n+1}\) using the formulas (33) (Newton’s method) or (35) (Halley’s method) with \(s_{k}\) individually.
 \(32)\):

Compute \(f^{p}_{n+1}\equiv f(t_{n+1}, y^{p}_{n+1}, w^{p}_{n+1})\).
 \(33)\):

Compute correctors \(y^{c}_{n+1}\), \(w^{c}_{n+1}\), \(z^{c}_{n+1}\) using the formulas (32) (Newton’s method) or (34) (Halley’s method) individually.
 Step 4):

Compute the approximated error function with \(s_{k}\):
$$ \bigl\vert \tilde{F}(s_{k}) \bigr\vert = \bigl\vert a_{2}y^{c}_{N}(s_{k}) + b_{2}z^{c}_{N}(s_{k})  \gamma _{2} \bigr\vert . $$(41)If \(\vert \tilde{F}(s_{k}) \vert \le \mathit{Tol}\) then STOP.
Do Step 5 to compute \(F_{s}(s_{k})\) (Newton’s or Halley’s method) and \(F_{ss}(s_{k})\) (Halley’s method).
 Step 5):

For \(n = 0,\ldots, N1\) do Steps \(51\cdots 55\).
 \(51)\):

Compute predictors \(y^{p}_{s, n+1}\), \(w^{p}_{s, n+1}\), \(z^{p}_{s, n+1}\) in (25) using the formulas (33) (Newton’s method) or (35) (Halley’s method) individually.
 \(52)\):

Compute predictors \(y^{p}_{ss, n+1}\), \(w^{p}_{ss, n+1}\), \(z^{p}_{ss, n+1}\) in (28) using the formulas (35) (Halley’s method) individually. (Skip step for Newton’s method.)
 \(53)\):

Compute \(f^{p}_{s, n+1}\) defined by (26) (Newton’s and Halley’s methods). Compute \(f^{p}_{ss, n+1}\) defined by (29) (Halley’s method).
 \(54)\):

Compute correctors \(y^{c}_{s, n+1}\), \(w^{c}_{s, n+1}\), \(z^{c}_{s, n+1}\) in (25) using the formulas (32) (Newton’s method) or (35) (Halley’s method) individually.
 \(55)\):

Compute predictors \(y^{c}_{ss, n+1}\), \(w^{c}_{ss, n+1}\), \(z^{c}_{ss, n+1}\) in (28) using the formulas (34) (Halley’s method) individually. (Skip step for Newton’s method.)
 Step 6):

Compute \(s_{k+1}\) using the formulas (23) (Newton’s method) or (27) (Halley’s method).
\(k=k+1\).
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Kim, H., Lee, J. & Jang, B. An efficient numerical approach for solving twopoint fractional order nonlinear boundary value problems with Robin boundary conditions. Adv Differ Equ 2021, 193 (2021). https://doi.org/10.1186/s13662021033553
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662021033553