Skip to content
naulon
Not checkedNot checked for notices yet.

An efficient numerical approach for solving two-point fractional order nonlinear boundary value problems with Robin boundary conditions

Hyunju Kim, Junseo Lee, Bongsoo Jang

Advances in Difference Equations · 2021

doi:10.1186/s13662-021-03355-3 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

This article proposes new strategies for solving two-point Fractional order Nonlinear Boundary Value Problems (FNBVPs) with Robin Boundary Conditions (RBCs). In the new numerical schemes, a two-point 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 High-order 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 two-point FNBVPs, they can handle both linear and nonlinear two-point Fractional order Boundary Value Problems (FBVPs) with RBCs and have uniform convergence rates of HPCMs, $\mathcal{O}(h^{2})$ O ( h 2 ) and $\mathcal{O}(h^{3})$ 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.

Abstract licence: CC BY

References23

    23 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.