2014
DOI: 10.1515/cmam-2013-0022
|View full text |Cite
|
Sign up to set email alerts
|

High Order Numerical Methods for Fractional Terminal Value Problems

Abstract: -In this paper we present a shooting algorithm to solve fractional terminal (or boundary) value problems. We provide a convergence analysis of the numerical method, derived based upon properties of the equation being solved and without the need to impose smoothness conditions on the solution. The work is a sequel to our recent investigation where we constructed a nonpolynomial collocation method for the approximation of the solution to fractional initial value problems. Here we show that the method can be adap… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(14 citation statements)
references
References 20 publications
0
14
0
Order By: Relevance
“…Obviously, this investigation can only cover a limited number of alternatives to the Adams method and might be extended to other schemes. A different replacement for the Adams scheme, namely a collocation method using a combination of classical piecewise polynomials and generalized polynomials (with non-integer exponents) has been shown to also provide relatively good results in [95].…”
Section: Terminal Value Problemsmentioning
confidence: 99%
“…Obviously, this investigation can only cover a limited number of alternatives to the Adams method and might be extended to other schemes. A different replacement for the Adams scheme, namely a collocation method using a combination of classical piecewise polynomials and generalized polynomials (with non-integer exponents) has been shown to also provide relatively good results in [95].…”
Section: Terminal Value Problemsmentioning
confidence: 99%
“…or [10,13]. For the numerical solution of such problems, one may apply a so-called shooting method [8,9,11,13,14], i.e. one starts with a first guess x 0,1 for x(0), (numerically) solves the initial value problem consisting of the differential equation given in (1.2) and the initial condition x(0) = x 0,1 , and in this way obtains a first approximate solution x * 1 for x(T ) = x * .…”
Section: Motivationmentioning
confidence: 99%
“…We shall address additional questions related to problems of this sort, and the quest for numerical methods for their solution (in this context, see [11] for first results), in a forthcoming separate paper.…”
Section: G(t S)| · |Y(s) −ỹ(S)| Dsmentioning
confidence: 99%