Next Article in Journal
State of Charge Estimation of Lithium-Ion Batteries Based on Fuzzy Fractional-Order Unscented Kalman Filter
Previous Article in Journal
New Results on Controllability for a Class of Fractional Integrodifferential Dynamical Systems with Delay in Banach Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Spline Collocation for Multi-Term Fractional Integro-Differential Equations with Weakly Singular Kernels

Institute of Mathematics and Statistics, University of Tartu, Narva Street 18, 51009 Tartu, Estonia
*
Author to whom correspondence should be addressed.
Fractal Fract. 2021, 5(3), 90; https://doi.org/10.3390/fractalfract5030090
Submission received: 17 June 2021 / Revised: 11 July 2021 / Accepted: 17 July 2021 / Published: 7 August 2021
(This article belongs to the Section Numerical and Computational Methods)

Abstract

:
We consider general linear multi-term Caputo fractional integro-differential equations with weakly singular kernels subject to local or non-local boundary conditions. Using an integral equation reformulation of the proposed problem, we first study the existence, uniqueness and regularity of the exact solution. Based on the obtained regularity properties and spline collocation techniques, the numerical solution of the problem is discussed. Optimal global convergence estimates are derived and a superconvergence result for a special choice of grid and collocation parameters is given. A numerical illustration is also presented.

1. Introduction

It is currently well established that differential and integral equations with derivatives of fractional (non-integer) order have great importance in the modeling of real-life processes. For details, including basic theory of fractional calculus and references to some applications, see the monographs [1,2,3,4] and review papers [5,6,7]. Some concrete examples can be found in the works [8] (modelling the behaviour of viscoelastic materials), [9,10] (kinetics of polymers), [11,12] (modelling the behaviour of humans), [13] (fractional processes in financial economics), [14] (atomic wall dynamics), [15] (viscoelastic laws for arterial wall mechanics), [16] (models of supercapacitor energy storage), [17] (transition of flow in fluid dynamics) and [18,19,20] (anomalous diffusion).
However, when working with problems stemming from real-world applications, it is only rarely possible to find the solution of a given fractional differential or integral equation in closed form, and even if such an analytic solution is available, it is typically too complicated to be used in practice. Therefore, in general, numerical methods are required for solving fractional differential and integral equations. As a consequence, the last few decades have witnessed a steadily increasing development and analysis of numerical methods for fractional differential equations, of which a good deal are concerned with the numerical solution of initial or boundary value problems with one fractional derivative in the equation, see, for example, the works [21,22,23,24,25] for initial value problems and [26,27,28,29,30,31] for boundary value problems. A comprehensive survey of the most important methods for fractional initial value problems, along with a detailed introduction to the subject and a brief summary about the convergence behaviour of the methods is given in the monograph [32]. Less attention has been paid to the numerical solution of equations with multiple fractional derivatives (the so-called multi-term equations) [33,34,35,36,37,38,39,40,41], fractional differential equations with non-local boundary conditions [42,43,44,45,46] and fractional integro-differential equations with weakly singular kernels [47,48,49]. This motivated us in the present paper to focus on constructing effective numerical methods for fractional weakly singular integro-differential equations with local or non-local boundary conditions.
In order to construct high-order numerical methods for solving fractional differential and integro-differential equations, one needs some information about the regularity of the exact solution of the underlying problem. This becomes even more significant if we wish to study the optimal order of convergence of the proposed algorithms. However, fractional differential and integral equations pose an extra challenge compared to integer order differential equations. For example, it is well known that, in the case of integer order differential equations, the smoothness properties of a solution are determined by certain assumptions on the given data. Very simple examples show (see also Theorem 1 below) that, in general, we can not expect this to be true for fractional differential equations—a solution of a fractional differential equation will generally exhibit non-smooth behaviour even in the case of smooth data. Thus, when constructing high order numerical methods for fractional differential and integral equations, one should take into account, in some way, the possible non-smooth behaviour of an exact solution. Numerical methods which assume smooth solutions for fractional differential equations are valid only for a tiny subclass of problems, as is made clear in [50,51]. In the numerical solution of weakly singular integral equations of the second kind by collocation methods the possible non-smooth behaviour of the exact solution of the underlying problem can be taken into account by using special non-uniform grids (see, for example, [52,53,54,55]). Similar ideas for solving certain types of fractional differential equations have been successfully used in [28,36,39,48,56].
The main purpose of the present paper is to extend the results of [39,48] and the corresponding results of [56] to a much larger class of linear multi-term fractional equations, where the terms can be Caputo fractional derivatives of arbitrary order and weakly singular integrals involving Caputo fractional derivatives (for the exact problem setting see Section 3 below). To the best of our knowledge, up to now there has been no discussion about the numerical solution of such equations. In the present paper, using special non-uniform grids reflecting the possible singular behaviour of the exact solution, we construct a high order collocation-based numerical method for these equations. Our analysis hinges on a smoothness result for the exact solution of the underlying problem, given by Theorem 1. The theoretical convergence results for the proposed algorithm are proved by Theorems 2 and 3. These theorems show how to choose grid and collocation parameters so that the best possible order of convergence is attained. Notably, we show that with a careful choice of collocation parameters and with a suitably graded grid, the constructed method will obtain a superconvergence rate on the whole interval of integration [ 0 , b ] . We also provide numerical results to verify the theoretical analysis.
Without loss of generality, in this paper we shall assume that the starting point for fractional operators is located at the origin 0.

2. Basic Notations and Definitions

By N we denote the set of all positive integers { 1 , 2 , } , by N 0 the set of all non-negative integers { 0 , 1 , 2 , } and by R the set of all real numbers ( , ) . By α we denote the smallest integer greater or equal to a real number α .
Let b > 0 be a fixed real number. By L 1 ( 0 , b ) we denote the Banach space of measurable functions u : [ 0 , b ] R such that u L 1 ( 0 , b ) = 0 b | u ( t ) | d t < . By L ( 0 , b ) we denote the Banach space of essentially bounded measurable functions u : [ 0 , b ] R such that
u L ( 0 , b ) = u = inf Ω [ 0 , b ] ; μ ( Ω ) = 0 sup t [ 0 , b ] Ω | u ( t ) | < ,
where μ ( Ω ) is the Lebesgue measure of the set Ω .
By C [ 0 , b ] we denote the Banach space of continuous functions u : [ 0 , b ] R with the norm u C [ 0 , b ] = u = max 0 t b | u ( t ) | . By C m [ 0 , b ] we denote the Banach space of m times ( m N 0 , for m = 0 we set C 0 [ 0 , b ] = C [ 0 , b ] ) continuously differentiable functions u : [ 0 , b ] R with the norm u C m [ 0 , b ] = i = 0 m u ( i ) .
By C m ( Δ ) we denote the set of m times ( m N 0 , for m = 0 we set C 0 ( Δ ) = C ( Δ ) ) continuously differentiable functions on Δ , with
Δ : = { ( t , s ) : 0 s t b } .
Next, we recall the definitions and some properties of Riemann–Liouville integral and Caputo fractional differential operators, see [1,2].
For given δ ( 0 , ) by J δ we denote the Riemann–Liouville integral operator of order δ , defined by
( J δ u ) ( t ) = 1 Γ ( δ ) 0 t ( t s ) δ 1 u ( s ) d s , t [ 0 , b ] , u L 1 ( 0 , b ) ,
where Γ ( δ ) : = 0 e s s δ 1 d s is the Euler gamma function. For δ = 0 we set J 0 : = I , where I is the identity operator. If δ > 0 , then ( J δ u ) ( t ) exists for almost all t [ 0 , b ] and the function J δ u is also an element of L 1 ( 0 , b ) . We have for any u L ( 0 , b ) that
( J δ u ) ( k ) C [ 0 , b ] , ( J δ u ) ( k ) ( 0 ) = 0 , δ > 0 , k = 0 , , δ 1 ,
J α J β u = J β J α u = J α + β u , α > 0 , β > 0 .
Moreover, it is well known (see, e.g., [57]) that the operator J δ ( δ > 0 ) is linear, bounded and compact from L ( 0 , b ) into C [ 0 , b ] .
Let m N . By Q m 1 [ u ] we denote the Taylor polynomial of degree m 1 for the function u C m 1 [ 0 , b ] at the point 0:
( Q m 1 [ u ] ) ( s ) = i = 0 m 1 u ( i ) ( 0 ) i ! s i , s R , 0 ! = 1 .
By D C a p δ we denote the Caputo fractional differential operator of order δ > 0 , defined by the formula
( D C a p δ u ) ( t ) = d n d t n ( J n δ ( u Q n 1 [ u ] ) ) ( t ) , t ( 0 , b ] , n : = δ .
In the definition (4) we assume that u C n 1 [ 0 , b ] is such that the integer order derivative J n δ ( u Q n 1 [ u ] ) ( n ) ( t ) exists for any t ( 0 , b ] . If δ N and u C δ [ 0 , b ] then we have ( D C a p δ u ) ( t ) = u ( δ ) ( t ) , t [ 0 , b ] .
A sufficient condition for the existence of D C a p δ u C [ 0 , b ] is u C δ [ 0 , b ] . However, this is not a necessary condition. In [58], Vainikko gives a comprehensive description of the range J δ C [ 0 , b ] ( δ > 0 ) of J δ as an operator from C [ 0 , b ] into C [ 0 , b ] . In particular, he has derived necessary and sufficient conditions for the existence of D C a p δ u C [ 0 , b ] for a function u C δ 1 [ 0 , b ] , δ > 0 .
For any u L ( 0 , b ) we have
D C a p δ 1 J δ 2 u = J δ 2 δ 1 u , 0 < δ 1 δ 2 .
Note that if u C δ 1 [ 0 , b ] ( δ > 0 ) and D C a p δ u C [ 0 , b ] , then (cf. [1])
u ( t ) = ( J δ z ) ( t ) + λ = 0 δ 1 c λ t λ , t [ 0 , b ] ,
where z : = D C a p δ u and c λ R ( λ = 0 , , δ 1 ) are some constants. Note also that for a function
v β ( t ) = t β , t 0 , β [ 0 , )
we have for δ > 0 that
( D C a p δ v β ) ( t ) = 0 if β = 0 , 1 , , δ 1 , Γ ( 1 + β ) Γ ( β + 1 δ ) t β δ if β δ ,
where t 0 .

3. Problem Setting

In the present paper, we will consider a general class of linear multi-term fractional weakly singular integro-differential equations in the form
( D C a p α p y ) ( t ) + i = 0 p 1 d i ( t ) ( D C a p α i y ) ( t ) + i = 0 q 0 t ( t s ) κ i K i ( t , s ) ( D C a p θ i y ) ( s ) d s = f ( t ) , 0 t b ,
subject to the conditions
j = 0 n 0 β i j 0 y ( j ) ( 0 ) + k = 1 l j = 0 n 1 β i j k y ( j ) ( b k ) + β i 0 b ¯ i y ( s ) d s = γ i , i = 0 , , n 1 , n : = α p .
Here y = y ( t ) is the unknown function and by D C a p α i y ( i = 0 , , p ) and D C a p θ j y ( j = 0 , , q ) are denoted the Caputo fractional derivatives of y of orders α i and θ j , respectively. We assume that the following conditions (10) are fulfilled:
0 α 0 < α 1 < < α p n , p N , n = α p , 0 θ j < α p , 0 κ j < 1 , j = 0 , , q , q N 0 , 0 < b 1 < < b l b , l N , 0 < b ¯ i b , i = 0 , , n 1 , n 0 , n 1 N 0 , n 0 < n , n 1 < n , β i j 0 , β i j k , β i , γ i R , d i C [ 0 , b ] ( i = 0 , , p 1 ) , f C [ 0 , b ] , K j C ( Δ ) , j = 0 , , q .
Note that for certain values of coefficients β i j 0 , β i j k and β i the problem (8)–(10) takes the form of an initial value problem or a multi-point boundary value problem.
Following some ideas of [39,48,56], we will construct a high-order method for the numerical solution of problem (8) and (9). We first introduce an integral equation reformulation of the underlying problem (Section 4) and prove some results about the existence, uniqueness and regularity of the exact solution of (8) and (9) (Section 5). Using this information and spline collocation techniques, the numerical solution of the problem is discussed (Section 6). Optimal global convergence estimates are derived and a superconvergence result for a special choice of collocation parameters is established (Section 7). Finally, numerical illustrations confirming the convergence estimates are given (Section 8).

4. Integral Equation Reformulation

Let n = α p N and let y C n 1 [ 0 , b ] be an arbitrary function such that D C a p α p y C [ 0 , b ] . We denote
z : = D C a p α p y .
Then, due to (6),
y ( t ) = ( J α p z ) ( t ) + λ = 0 n 1 c λ t λ , t [ 0 , b ] ,
where c λ R ( λ = 0 , , n 1 ) are some constants. From properties (2) and (5) we see that for y in the form (11) we can write
y ( j ) ( 0 ) = j ! c j , y ( j ) ( c ) = ( J α p j z ) ( c ) + λ = j n 1 λ ! c λ ( λ j ) ! c λ j , c [ 0 , b ] ,
where j = 0 , , n 1 , and, using (3), we have that
0 a y ( s ) d s = ( J α p + 1 z ) ( a ) + λ = 0 n 1 c λ λ + 1 a λ + 1 , a [ 0 , b ] .
Thus, a function y in the form (11) satisfies the conditions (9) if and only if
j = 0 n 0 β i j 0 j ! c j + k = 1 l j = 0 n 1 β i j k ( J α p j z ) ( b k ) + λ = j n 1 λ ! ( λ j ) ! b k λ j c λ + β i ( J α p + 1 z ) ( b ¯ i ) + λ = 0 n 1 c λ λ + 1 b ¯ i λ + 1 = γ i ,
where i = 0 , , n 1 . By setting β i j 0 = 0 for j = n 0 + 1 , , n 1 and β i j k = 0 for j = n 1 + 1 , , n 1 ( k = 1 , , l ) , we can write
j = 0 n 0 β i j 0 j ! c j = j = 0 n 1 β i j 0 j ! c j ( i = 0 , , n 1 )
and
j = 0 n 1 β i j k [ ( J α p j z ) ( b k ) + λ = j n 1 λ ! ( λ j ) ! b k λ j c λ ] = j = 0 n 1 β i j k ( J α p j z ) ( b k ) + j = 0 n 1 λ = 0 j β i λ k j ! ( j λ ) ! b k j λ c j ,
for k = 1 , , l , i = 0 , n 1 . The conditions (12) can thus be rewritten in the form
j = 0 n 1 j ! β i j 0 + k = 1 l λ = 0 j β i λ k j ! ( j λ ) ! b k j λ + β i j + 1 b ¯ i j + 1 c j = γ i k = 1 l j = 0 n 1 β i j k ( J α p j z ) ( b k ) β i ( J α p + 1 z ) ( b ¯ i ) , i = 0 , , n 1 ,
giving us an algebraic linear system of n equations with respect to c 0 , , c n 1 . Let
M : = j ! β i j 0 + k = 1 l λ = 0 j β i λ k j ! ( j λ ) ! b k j λ + β i j + 1 b ¯ i j + 1 i , j = 0 n 1
be the matrix of the system (13).
In the sequel, we assume that the matrix M is regular. Observe that the matrix M is regular if and only if from all polynomials y of degree n 1 only y = 0 satisfies the homogeneous conditions
j = 0 n 0 β i j 0 y ( j ) ( 0 ) + k = 1 l j = 0 n 1 β i j k y ( j ) ( b k ) + β i 0 b ¯ i y ( s ) d s = 0 , i = 0 , , n 1 ,
corresponding to the conditions (9) by γ i = 0 , i = 0 , , n 1 .
Indeed, substituting (11) with z = 0 into (14) we obtain a homogeneous system of algebraic equations with respect to c 0 , c 1 , , c n 1 . This system coincides with (13) by γ i = 0 ( i = 0 , , n 1 ) and z = 0 . Therefore, the homogeneous system corresponding to (13) has only the trivial solution c 0 = c 1 = = c n 1 = 0 (and thus M is regular) if and only if from all polynomials y of degree n 1 only y = 0 satisfies (14).
Let
M 1 = ( p i j ) i , j = 0 n 1
be the inverse of M. Using M 1 , the solution of the system (13) can be written in the form
c λ = ϕ λ ξ λ , λ = 0 , , n 1 ,
with
ϕ λ : = μ = 0 n 1 p λ μ γ μ , ξ λ : = k = 1 l j = 0 n 1 ψ λ j k ( J α p j z ) ( b k ) + ω λ ( J α p + 1 z ) ( b ¯ λ ) ,
where
ψ λ j k : = μ = 0 n 1 p λ μ β μ j k , ω λ : = μ = 0 n 1 p λ μ β λ .
Therefore, a function y in the form (11) satisfies the conditions (9) if and only if it can be expressed by the formula
y = G z + Q ,
where
( G z ) ( t ) : = ( J α p z ) ( t ) λ = 0 n 1 ξ λ t λ , t [ 0 , b ] ,
Q ( t ) : = λ = 0 n 1 ϕ λ t λ , t [ 0 , b ] .
Suppose now that y C n 1 [ 0 , b ] is a solution of problem (8) and (9) such that D C a p α p y C [ 0 , b ] . Then, it follows from the observations above that y has the form (17), where z = D C a p α p y C [ 0 , b ] , and G and Q are defined by the Formulas (18) and (19), respectively. Inserting (17) into (8), we see that
z ( t ) + i = 0 p 1 d i ( t ) ( D C a p α i [ G z + Q ] ) ( t ) + i = 0 q 0 t ( t s ) κ i K i ( t , s ) ( D C a p θ i [ G z + Q ] ) ( s ) d s = f ( t ) ,
for t [ 0 , b ] . Therefore, z = D C a p α p y satisfies the integral equation
z = T z + g ,
with
( T z ) ( t ) : = i = 0 p 1 d i ( t ) ( D C a p α i G z ) ( t ) i = 0 q 0 t ( t s ) κ i K i ( t , s ) ( D C a p θ i G z ) ( s ) d s ,
g ( t ) : = f ( t ) i = 0 p 1 d i ( t ) ( D C a p α i Q ) ( t ) i = 0 q 0 t ( t s ) κ i K i ( t , s ) ( D C a p θ i Q ) ( s ) d s ,
where t [ 0 , b ] . Conversely, it turns out that if z C [ 0 , b ] is a solution of Equation (20) then y defined by (17) belongs to C n 1 [ 0 , b ] and is a solution to (8) and (9). In this sense, Equation (20) is equivalent to the problem (8) and (9).
In the following, we find for (21) and (22) a different form. First, for i = 0 , , q we denote
L i ( t , s ) : = 0 1 τ α p θ i 1 ( 1 τ ) κ i K i ( t , ( t s ) τ + s ) d τ , 0 s t b ,
K i , λ ( t ) : = 0 1 ( 1 s ) κ i s λ θ i K i ( t , t s ) d s , 0 t b , λ 0 .
From (5), (7) and (18) it follows that for i = 0 , , p 1 we have
( D C a p α i G z ) ( t ) = ( J α p α i z ) ( t ) λ = α i α i n 1 n 1 ξ λ λ ! Γ ( λ + 1 α i ) t λ α i , t [ 0 , b ] ,
and for i = 0 , , q we have
0 t ( t s ) κ i K i ( t , s ) ( D C a p θ i G z ) ( s ) d s = 0 t ( t s ) κ i K i ( t , s ) ( J α p θ i z ) ( t ) d s λ = θ i θ i n 1 n 1 ξ λ λ ! Γ ( λ + 1 θ i ) 0 t ( t s ) κ i K i ( t , s ) s λ θ i d s = 1 Γ ( α p θ i ) 0 t ( t s ) α p θ i κ i L i ( t , s ) z ( s ) d s λ = θ i θ i n 1 n 1 ξ λ λ ! Γ ( λ + 1 θ i ) t 1 + λ θ i κ i K i , λ ( t ) , t [ 0 , b ] ;
from (5), (7) and (19) it follows that for i = 0 , , p 1 we have
( D C a p α i Q ) ( t ) = λ = α i α i n 1 n 1 λ ! Γ ( λ + 1 α i ) ϕ λ t λ α i , t [ 0 , b ]
and for i = 0 , , q we have
0 t ( t s ) κ i K i ( t , s ) ( D C a p θ i Q ) ( s ) d s = λ = θ i θ i n 1 n 1 λ ! Γ ( λ + 1 θ i ) ϕ λ K i , λ ( t ) t 1 + λ θ i κ i ,
where t [ 0 , b ] . Thus, on the basis of (21) and (22) we can write
( T z ) ( t ) = i = 0 p 1 d i ( t ) ( J α p α i z ) ( t ) λ = α i α i n 1 n 1 ξ λ λ ! Γ ( λ + 1 α i ) t λ α i i = 0 q 1 Γ ( α p θ i ) 0 t ( t s ) α p θ i κ i L i ( t , s ) z ( s ) d s + i = 0 q λ = θ i θ i n 1 n 1 ξ λ λ ! Γ ( λ + 1 θ i ) t 1 + λ θ i κ i K i , λ ( t ) ( t [ 0 , b ] )
and
g ( t ) = f ( t ) i = 0 p 1 d i ( t ) λ = α i α i n 1 n 1 λ ! Γ ( λ + 1 α i ) ϕ λ t λ α i i = 0 q λ = θ i θ i n 1 n 1 λ ! Γ ( λ + 1 θ i ) ϕ λ K i , λ ( t ) t 1 + λ θ i κ i , t [ 0 , b ] .
Remark 1.
If K 0 , , K q C m ( Δ ) , m N 0 , then it follows from (10), (23) and (24) that L 0 , , L q C m ( Δ ) and K 0 , λ , , K q , λ C m [ 0 , b ] , λ 0 .
Remark 2.
A special case of problem (8)–(10) is the initial value problem
( D C a p α p y ) ( t ) + i = 0 p 1 d i ( t ) ( D C a p α i y ) ( t ) + i = 0 q 0 t ( t s ) κ i K i ( t , s ) ( D C a p θ i y ) ( s ) d s = f ( t ) , y ( i ) ( 0 ) = γ i , i = 0 , , n 1 , n = α p ,
where t [ 0 , b ] . The solution of (27) can be expressed by the formula (see (17))
y = G z + Q ,
where
z = D C a p α p y , G = J α p , Q ( t ) = i = 0 n 1 γ i i ! t i .
In the integral equation z = T z + g (see (20)) corresponding to the initial value problem (27) the expressions for T z and g are for t [ 0 , b ] given by
( T z ) ( t ) = i = 0 p 1 d i ( t ) ( J α p α i z ) ( t ) i = 0 q 1 Γ ( α p θ i ) 0 t ( t s ) α p θ i κ i L i ( t , s ) z ( s ) d s
and
g ( t ) = f ( t ) i = 0 p 1 d i ( t ) λ = α i α i n 1 n 1 λ ! Γ ( λ + 1 α i ) ϕ λ t λ α i i = 0 q λ = θ i θ i n 1 n 1 λ ! Γ ( λ + 1 θ i ) ϕ λ K i , λ ( t ) t 1 + λ θ i κ i ,
with L i and K i , λ ( λ = 0 , , n 1 ) defined by (23) and (24), respectively.

5. Existence, Uniqueness and Smoothness of the Solution

In order to characterize the possible singular behaviour of a solution of a fractional differential equation, we introduce a weighted space C m , ν ( 0 , b ] of smooth functions on ( 0 , b ] (cf. [57,59]).
For given b R , b > 0 , m N and ν R , ν < 1 , by C m , ν ( 0 , b ] we denote the set of continuous functions u : [ 0 , b ] R which are m times continuously differentiable in ( 0 , b ] such that
| u ( i ) ( t ) | c 1 if i < 1 ν 1 + | log t | if i = 1 ν t 1 ν i if i > 1 ν , t ( 0 , b ] , i = 1 , , m ,
where c is a positive constant. In other words, u C m , ν ( 0 , b ] if u C [ 0 , b ] C m ( 0 , b ] and
| u | m , ν : = i = 1 m sup 0 < t b ω i 1 + ν ( t ) u ( i ) ( t ) < ,
where, for t > 0 ,
ω ρ ( t ) : = 1 if ρ < 0 , 1 1 + | log t | if ρ = 0 , t ρ if ρ > 0 .
Equipped with the norm
u C m , ν ( 0 , b ] : = u + | u | m , ν , u C m , ν ( 0 , b ] ,
the set C m , ν ( 0 , b ] becomes a Banach space.
Note that C m [ 0 , b ] ( m N ) belongs to C m , ν ( 0 , b ] for arbitrary ν < 1 . Some other examples are given by y 1 ( t ) = t 7 2 , y 2 ( t ) = t 3 4 and y 3 ( t ) = t log t with y 3 ( 0 ) = 0 . Clearly, y 1 C m , 5 2 ( 0 , b ] , y 2 C m , 1 4 ( 0 , b ] and y 3 C m , 0 ( 0 , b ] . Moreover, a function of the form
y ( t ) = g 1 ( t ) t δ + g 2 ( t ) ( δ > 0 )
belongs to C m , ν ( 0 , b ] for all ν [ 1 δ , 1 ) and g 1 , g 2 C m [ 0 , b ] , m N . Note also that
C q [ 0 , b ] C q , ν ( 0 , b ] C m , μ ( 0 , b ] C [ 0 , b ] , q m 1 , ν μ < 1 .
Observe that as ν increases so do the possible singularities of the derivatives of the functions in C q , ν ( 0 , b ] . Next we introduce some auxiliary results. Their proofs can be found in [57].
Lemma 1.
If y 1 , y 2 C m , ν ( 0 , b ] , m N , ν < 1 , then y 1 y 2 C m , ν ( 0 , b ] , and
y 1 y 2 C m , ν ( 0 , b ] c y 1 C m , ν ( 0 , b ] y 2 C m , ν ( 0 , b ] ,
with a constant c which is independent of y 1 and y 2 .
Lemma 2.
Let η R , η < 1 and let K C ( Δ ) . Then operator S defined by
( S y ) ( t ) : = 0 t ( t s ) η K ( t , s ) y ( s ) d s , t [ 0 , b ] ,
is compact as an operator from L ( 0 , b ) into C [ 0 , b ] . If, in addition, K C m ( Δ ) , m N , then S is compact as an operator from C m , ν ( 0 , b ] into C m , ν ( 0 , b ] , where η ν < 1 .
The following theorem characterizes the existence, uniqueness and regularity properties of the solution of (8) and (9).
Theorem 1. (i) Suppose that assumptions (10) hold. Moreover, assume that problem (8) and (9) with f = 0 and γ i = 0 ( i = 0 , , n 1 ) has in C [ 0 , b ] only the trivial solution y = 0 , and from all polynomials y of degree n 1 only y = 0 satisfies the conditions (14).
Then, problem (8) and (9) has a unique solution y C n 1 [ 0 , b ] with D C a p α p y C [ 0 , b ] .
(ii) Assume that(i) holds and let d i C m , μ ( 0 , b ] ( i = 0 , , p 1 ) , f C m , μ ( 0 , b ] , K j C m ( Δ ) ( j = 0 , , q ) , where m N , μ R , μ < 1 .
Then, problem (8) and (9) possesses a unique solution y C n 1 [ 0 , b ] such that y C m , ν ( 0 , b ] and D C a p α p y C m , ν ( 0 , b ] , where
ν : = max { μ , ν 1 , ν 2 , ν 3 , ν 4 } ,
with
ν 1 : = max { 1 ( α p α i ) : α p α i N , i = 0 , , p 1 } , ν 2 : = max { 1 ( α i α i ) : α i < n 1 , α i N 0 , i = 0 , , p 1 } , ν 3 : = max { κ i ( θ i θ i ) : θ i n 1 , i = 0 , , q } , ν 4 : = max { κ i ( α p θ i ) : i = 0 , , q } .
If for all indices i = 0 , , p 1 we have α p α i N , then we may set ν = max { μ , ν 2 , ν 3 , ν 4 } . Analogously, if we have α i N 0 for all indices i = 0 , , p 1 such that α i < n 1 , then we may set ν = max { μ , ν 1 , ν 3 , ν 4 } . Note also that in the case K i = 0 , i = 0 , , q we may set ν = max { μ , ν 1 , ν 2 } .
Proof. (i) First, we observe that the forcing function g of equation z = T z + g (see (20) and (26)) belongs to C [ 0 , b ] . This follows from f C [ 0 , b ] , d i C [ 0 , b ] ( i = 0 , , p 1 ) and from Remark 1 with m = 0 .
Next, due to (25), operator T can be rewritten in the form
T = i = 0 p 1 D i J α p α i λ = α i α i n 1 n 1 λ ! Γ ( λ + 1 α i ) A λ α i M λ i = 0 q B i , L λ = θ i θ i n 1 n 1 A 1 + λ θ i κ i M λ K ¯ i , λ ,
with D i , A σ , M λ , B i , L and K ¯ i , λ defined by
( D i x ) ( t ) : = d i ( t ) x ( t ) , i = 0 , , p 1 , ( A σ x ) ( t ) : = t σ x ( t ) , σ R , σ 0 , ( M λ x ) ( t ) : = k = 1 l j = 0 n 1 ψ λ j k ( J α p j x ) ( b k ) + ω λ ( J α p + 1 x ) ( b ¯ λ ) , λ = 0 , , n 1 , ( B i , L x ) ( t ) : = 1 Γ ( α p θ i ) 0 t ( t s ) α p θ i κ i L i ( t , s ) x ( s ) d s , i = 0 , , q , ( K ¯ i , λ x ) ( t ) : = K i , λ ( t ) x ( t ) , λ = 0 , , n 1 , i = 0 , , q ,
where t [ 0 , b ] and x C [ 0 , b ] . Here (see Remark 1), L i C ( Δ ) and K i , λ C [ 0 , b ] are given by (23) and (24), respectively. Using Lemma 2 we obtain that J δ ( δ > 0 ) , M λ ( λ = 0 , , n 1 ) and B i , L ( i = 0 , , q ) are compact as operators from C [ 0 , b ] into C [ 0 , b ] . Clearly D i ( i = 0 , , p 1 ) , K ¯ i , λ ( λ = 0 , , n 1 , i = 0 , , q ) and A σ ( σ R , σ 0 ) are bounded as operators from C [ 0 , b ] into C [ 0 , b ] . This yields that T, given by (31), is compact as an operator from C [ 0 , b ] into C [ 0 , b ] .
Note that if f = 0 and γ i = 0 ( i = 0 , , n 1 ) , then ϕ λ = 0 ( λ = 0 , , n 1 ) (see (15)) and thus g = 0 (see (26)). From this, we obtain that if the homogeneous equation corresponding to problem (8) and (9) has only the trivial solution y = 0 , then z = T z has in C [ 0 , b ] only the trivial solution z = 0 . Since g C [ 0 , b ] , we obtain by Fredholm alternative theorem that equation z = T z + g possesses a unique solution z C [ 0 , b ] . This together with (17) yields that problem (8) and (9) has a unique solution y C n 1 [ 0 , b ] such that D C a p α p y = z C [ 0 , b ] .
(ii) Let us prove that z = D C a p α p y belongs to C m , ν ( 0 , b ] (with m N and ν given by (30)) for K i C m ( Δ ) ( i = 0 , , q ) , d i C m , μ ( 0 , b ] ( i = 0 , , p 1 ) , f C m , μ ( 0 , b ] , μ R , μ < 1 . To this end we first establish that g, the forcing function of equation z = T z + g , belongs to C m , ν ( 0 , b ] . Indeed, it follows from (26) that g = g 1 + g 2 + g 3 ,
g 1 ( t ) : = f ( t ) , g 2 ( t ) : = i = 0 p 1 d i ( t ) λ = α i α i n 1 n 1 λ ! Γ ( λ + 1 α i ) ϕ λ t λ α i , g 3 ( t ) : = i = 0 q λ = θ i θ i n 1 n 1 λ ! Γ ( λ + 1 θ i ) ϕ λ K i , λ ( t ) t 1 + λ θ i κ i ,
where t [ 0 , b ] . Clearly g 1 = f C m , μ ( 0 , b ] C m , ν ( 0 , b ] . Note that, if δ N 0 , then for all λ δ , λ N 0 we have t λ δ C m [ 0 , b ] C m , ν ( 0 , b ] for arbitrary m N and ν < 1 . If δ N 0 , then for all λ δ , λ N 0 we have t λ δ C m , 1 δ + δ ( 0 , b ] . Thus, since d i C m , μ ( 0 , b ] ( i = 0 , , p 1 ) , by using Lemma 1 we can write g 2 C m , ν ( 0 , b ] with ν defined by (30). Finally, since for all λ θ i ( i = 0 , , q ) it holds that t 1 + λ θ i κ i C m , θ i θ i + κ i ( 0 , b ] C m , ν ( 0 , b ] and K i , λ C m [ 0 , b ] (see (24)), we have g 3 C m , ν ( 0 , b ] and hence g = g 1 + g 2 + g 3 C m , ν ( 0 , b ] .
If there exists i { 0 , , p 1 } such that α i N 0 , then it follows from the definition of ν that 1 ( α p α i ) ν and therefore from Lemma 2 we have that J α p α i is compact as an operator from C m , ν ( 0 , b ] into C m , ν ( 0 , b ] . If α p N , α i N 0 , then J α p α i is compact as an operator from C m , ν ( 0 , b ] into C m , ν ( 0 , b ] . Clearly D i ( i = 0 , , p 1 ) and A λ α i ( λ = α i , , n 1 , α i n 1 , i = 0 , , p 1 ) are linear and bounded as operators from C m , ν ( 0 , b ] into C m , ν ( 0 , b ] . Linear operators (functionals) M λ : C m , ν ( 0 , b ] R ( λ = 0 , , n 1 ) are bounded and consequently compact in C m , ν ( 0 , b ] . Thus, as the composition of a compact and bounded operator is compact, we see that D i J α p α i ( i = 0 , , p 1 ) and D i A λ α i M λ ( λ = α i , , n 1 , α i n 1 , i = 0 , , p 1 ) are linear and compact as operators from C m , ν ( 0 , b ] into C m , ν ( 0 , b ] .
Similarly, we see that operators K ¯ i , λ , A 1 + λ θ i κ i ( λ = 0 , , n 1 , i = 0 , , q ) are linear and bounded as operators from C m , ν ( 0 , b ] into C m , ν ( 0 , b ] , thus the operators A 1 + λ θ i κ i M λ K ¯ i , λ ( λ = 0 , , n 1 , i = 0 , , q ) are linear and compact as operators from C m , ν ( 0 , b ] into C m , ν ( 0 , b ] . Finally, since κ i + θ i α p ν ( i = 0 , , q ) , it follows from Lemma 2 that B i , L is compact as an operator from C m , ν ( 0 , b ] into C m , ν ( 0 , b ] . Thus, T defined by (31) is linear and compact as an operator from C m , ν ( 0 , b ] into C m , ν ( 0 , b ] . Since the homogeneous equation z = T z has in C m , ν ( 0 , b ] C [ 0 , b ] only the trivial solution z = 0 , it follows from Fredholm alternative theorem that equation z = T z + g has a unique solution z C m , ν ( 0 , b ] .
Note that the inclusion z C m , ν ( 0 , b ] together with (17) and Lemma 2 yields that problem (8) and (9) possesses a unique solution y C m , ν ( 0 , b ] such that D C a p α p y = z C m , ν ( 0 , b ] . □
Theorem 1 states that the regularity properties of y, the solution of problem (8) and (9), depend on the smoothness of functions f, d i ( i = 0 , , p 1 ) and K i ( i = 0 , , q ) . However, even when we have f , d i C m [ 0 , b ] ( i = 0 , , p 1 ) and K i C m ( Δ ) ( i = 0 , , q ) for some m N , we cannot claim that y C m [ 0 , b ] —we may only say that y C m , max { ν 1 , ν 2 , ν 3 , ν 4 } ( 0 , b ] . That is, the solution of the problem (8) and (9) can, in general, exhibit singular behaviour even when the data of the problem is smooth. This complicates the construction of high order methods for solving such equations numerically.

6. Numerical Method

In order to take into account the potential non-smoothness of the exact solution y = y ( t ) of (8) and (9) at the origin t = 0 , we introduce on the interval [ 0 , b ] a graded grid Π N ( N N ) . More precisely, let N N , then Π N : = { t 0 , , t N } is a partition (a graded grid) of the interval [ 0 , b ] with the grid points
t j : = b j N r , j = 0 , 1 , , N ,
where the grading exponent r R , r 1 . If r = 1 , then the grid points (32) are distributed uniformly; for r > 1 the points (32) are more densely clustered near the left endpoint of the interval [ 0 , b ] .
Next, for a given integer k 0 , by S k ( 1 ) ( Π N ) we denote the standard space of piecewise polynomial functions:
S k ( 1 ) ( Π N ) : = v : v | [ t j 1 , t j ] π k , j = 1 , , N .
Here, v | [ t j 1 , t j ] is the restriction of v : [ 0 , b ] R onto the subinterval [ t j 1 , t j ] [ 0 , b ] and π k denotes the set of polynomials of degree not exceeding k. Note that the elements of S k ( 1 ) ( Π N ) may have jump discontinuities at the interior points t 1 , , t N 1 of the grid Π N .
Let m N . In every subinterval [ t j 1 , t j ] ( j = 1 , , N ) we define m collocation points t j 1 , , t j m by
t j k : = t j 1 + η k ( t j t j 1 ) , k = 1 , , m , j = 1 , , N ,
where η 1 , η m are some fixed parameters which do not depend on j and N and satisfy
0 η 1 < η 2 < < η m 1 .
Approximations z N S m 1 ( 1 ) ( Π N ) ( m , N N ) to the solution z of (20) we find by collocation conditions
z N ( t j k ) = ( T z N ) ( t j k ) + g ( t j k ) , k = 1 , , m , j = 1 , , N ,
where T, g and { t j k } are defined by (25), (26) and (33), respectively. Note that conditions (35) for finding z N S m 1 ( 1 ) ( Π N ) have an operator equation representation
z N = P N T z N + P N g ,
where P N = P N , m : C [ 0 , b ] S m 1 ( 1 ) ( Π N ) is defined by
( P N v ) ( t j k ) = v ( t j k ) , k = 1 , , m , j = 1 , , N , v C [ 0 , b ] .
If η 1 = 0 , then by ( P N v ) ( t j 1 ) we denote the right limit lim t t j 1 , t > t j 1 ( P N v ) ( t ) . If η m = 1 , then by ( P N v ) ( t j m ) we denote the left limit lim t t j , t < t j ( P N v ) ( t ) . The collocation conditions (35) form a system of equations whose exact form is determined by the choice of a basis in the space S m 1 ( 1 ) ( Π N ) . If η 1 > 0 or η m < 1 then we can use the Lagrange fundamental polynomial representation:
z N ( t ) = λ = 1 N μ = 1 m c λ μ Φ λ μ ( t ) , t [ 0 , b ] ,
where, for μ = 1 , , m , λ = 1 , , N ,
Φ λ μ ( t ) : = 0 for t [ t λ 1 , t λ ] , i = 1 , i μ m t t λ i t λ μ t λ i for t [ t λ 1 , t λ ] .
Then, z N S m 1 ( 1 ) ( Π N ) and z N ( t j k ) = c j k , k = 1 , , m , j = 1 , , N . Substituting z N in the form (38) to (35), we obtain a system of linear algebraic equations with respect to the coefficients { c j k } :
c j k = λ = 1 N μ = 1 m ( T Φ λ μ ) ( t j k ) c λ μ + g ( t j k ) , k = 1 , , m , j = 1 , , N .
Solving this system of equations, we obtain the coefficients { c j k } and thus have found the approximation z N in the form (38). Note that for the computation of ( T Φ λ μ ) ( t j k ) we need to find the weakly singular integrals J δ Φ λ μ ( t j k ) ( δ > 0 ) , which can be found exactly.
Approximation y N to y we find by the formula (cf. (17))
y N = G z N + Q ,
where G and Q are defined by (18) and (19), respectively. By substituting z N in the form (38) into (41), we obtain the following expression for the approximate solution y N :
y N ( t ) = λ = 1 N μ = 1 m c λ μ ( G Φ λ μ ) ( t ) + Q ( t ) .

7. Convergence Analysis

In this section, we study the convergence and convergence order of the proposed algorithms. For this we need Lemmas 3–6 below. The proofs of Lemmas 3–5 follow from the results of [57,59]. The proof of Lemma 6 can be found in [60]. In what follows, for Banach spaces E and F, by L ( E , F ) is denoted the Banach space of linear bounded operators A : E F with the norm A L ( E , F ) = sup { A u F : u E , u E 1 } .
Lemma 3.
Let P N : C [ 0 , b ] S m 1 ( 1 ) ( Π N ) ( N N ) be defined by (37). Then P N L ( C [ 0 , b ] , L ( 0 , b ) ) and the norms of P N are uniformly bounded : P N L ( C [ 0 , b ] , L ( 0 , b ) ) c , with a positive constant c which is independent of N. Moreover, for every u C [ 0 , b ] we have
u P N u L ( 0 , b ) 0 as N .
Lemma 4.
Let S : L ( 0 , b ) C [ 0 , b ] be a linear compact operator. Let P N : C [ 0 , b ] S m 1 ( 1 ) ( Π N ) ( N N ) be defined by (37). Then
S P N S L ( L ( 0 , b ) , L ( 0 , b ) ) 0 as N .
Lemma 5.
Let u C m , ν ( 0 , b ] , m N , ν ( , 1 ) . Let P N : C [ 0 , b ] S m 1 ( 1 ) ( Π N ) ( N N ) be defined by (37). Then
u P N u c N m f o r m < 1 ν , r 1 , N m ( 1 + log N ) f o r m = 1 ν , r = 1 , N m f o r m = 1 ν , r > 1 , N r ( 1 ν ) f o r m > 1 ν , 1 r < m 1 ν , N m f o r m > 1 ν , r m 1 ν ,
where r [ 1 , ) is the grading exponent in (32) and c is a positive constant independent of N.
Lemma 6.
Let u C m + 1 , ν ( 0 , b ] , m N , ν ( , 1 ) . Let N N , α > 0 , r [ 1 , ) . Let J α and P N ( N N ) be defined by (1) and (37), respectively. Assume that the collocation points (33) with grid points (32) and parameters η 1 , , η m satisfying (34) are used. Moreover, assume that η 1 , , η m are such that a quadrature approximation
0 1 F ( x ) d x k = 1 m w k F ( η k ) , 0 η 1 < η 2 < < η m 1 ,
with appropriate weights { w k } is exact for all polynomials F of degree m.
Then, the following estimate holds:
J α ( P N z z ) c E N ( m , α , ν , r ) i f 0 < α < 1 E N * ( m , ν , r ) i f α = 1 .
Here, c is a constant independent of N,
E N ( m , α , ν , r ) : = N m α f o r m < 1 + α ν , r 1 , N m α ( 1 + log N ) f o r m = 1 + α ν , r = 1 , N m α f o r m = 1 + α ν , r > 1 , N r ( 1 + α ν ) f o r m > 1 + α ν , 1 r < m + α 1 + α ν , N m α f o r m > 1 + α ν , r m + α 1 + α ν ,
and
E N * ( m , ν , r ) : = N m 1 f o r m < 2 ν , r 1 , N m 1 ( 1 + log N ) 2 f o r m = 2 ν , r = 1 , N m 1 ( 1 + log N ) f o r m = 2 ν , r > 1 , N r ( 2 ν ) f o r m > 2 ν , 1 r < m + 1 2 ν , N m 1 f o r m > 2 ν , r m + 1 2 ν .
The following Theorems 2 and 3 characterize the convergence rate of the proposed method.
Theorem 2. (i) Let m , N N , r 1 and assume that the grid points (32) with collocation points (33) and arbitrary parameters η 1 , , η m satisfying (34) are used. Assume that conditions (10) are satisfied. Moreover, assume that problem (8) and (9) with f = 0 and γ i = 0 ( i = 0 , , n 1 ) has only the trivial solution y = 0 and from all polynomials y of degree n 1 only y = 0 satisfies the conditions (14).
Then, problem (8) and (9) has a unique solution y C n 1 [ 0 , b ] such that D C a p α p y C [ 0 , b ] . There exists an integer N 0 such that for all N N 0 Equation (36) possesses a unique solution z N S m 1 ( 1 ) ( Π N ) , determining by (41) a unique approximation y N to y, the solution of (8) and (9), and
y N y 0 as N .
(ii) If, in addition to (i), we assume that d i C m , μ ( 0 , b ] ( i = 0 , p 1 ) , f C m , μ ( 0 , b ] , K i C m ( Δ ) ( i = 0 , , q ) , where μ R , μ < 1 , then for all N N 0 the following error estimate holds:
y y N c N m f o r m < 1 ν , r 1 , N m ( 1 + log N ) f o r m = 1 ν , r = 1 , N m f o r m = 1 ν , r > 1 , N r ( 1 ν ) f o r m > 1 ν , 1 r < m 1 ν , N m f o r m > 1 ν , r m 1 ν ,
where ν is determined by the Formula (30), r 1 is the grading parameter in (32) and c is a constant independent of N.
Proof. (i) First, we prove the convergence (46). To this end, we need to show that equation z = T z + g (see (20)), with T and g given by (21) and (22), is uniquely solvable in L ( 0 , b ) . We observe that T is compact as an operator from L ( 0 , b ) to C [ 0 , b ] , thus also from L ( 0 , b ) to L ( 0 , b ) . Further, g C [ 0 , b ] L ( 0 , b ) and the homogeneous equation z = T z has in C [ 0 , b ] only the trivial solution z = 0 . This together with T L ( L ( 0 , b ) , C [ 0 , b ] ) yields that z = T z possesses also in L ( 0 , b ) only the trivial solution z = 0 . Consequently, by Fredholm alternative theorem, equation z = T z + g with g L ( 0 , b ) possesses a unique solution z L ( 0 , b ) . In other words, operator I T is invertible in L ( 0 , b ) and its inverse ( I T ) 1 is bounded: ( I T ) 1 L ( L ( 0 , b ) , L ( 0 , b ) ) . From Lemma 4 and from the boundedness of ( I T ) 1 in L ( 0 , b ) we obtain that I P N T is invertible in L ( 0 , b ) for all sufficiently large N, say N N 0 , and
( I P N T ) 1 L ( L ( 0 , b ) , L ( 0 , b ) ) c , N N 0 ,
where c is a constant independent of N. Thus, for N N 0 , Equation (36) provides a unique solution z N S m 1 1 ( Π N ) . Note that for z, the solution of equation z = T z + g , it holds P N z = P N T z + P N g . We have for z and z N that
( I P N T ) ( z z N ) = z z N P N T z + P N T z N = z P N z , N N 0 .
Therefore, by (48),
z z N c z P N z , N N 0 ,
where c is a positive constant independent of N. Using (41) we obtain that
y ( t ) y N ( t ) = G ( z z N ) ( t ) , N N 0 , t [ 0 , b ] .
From this and (49) it follows that
y y N c z z N c 1 z P N z , N N 0 ,
where c and c 1 are some positive constants independent of N. This together with z C [ 0 , b ] and Lemma 3 yields the convergence (46).
(ii) If K C m ( Δ ) , h , f C m , μ ( 0 , b ] , m N , μ R , μ < 1 , then it follows from the part (ii) of Theorem 1 that z C m , ν ( 0 , b ] , with ν given by (30). This together with (51) and Lemma 5 yields the estimate (47). □
It follows from Theorem 2 that in case of sufficiently smooth f, d i ( i = 0 , , p 1 ) and K i ( i = 0 , , q ) , by using sufficiently large values of r for every choice of collocation parameters 0 η 1 < < η m 1 a convergence of order O ( N m ) can be expected. From Theorem 3 below, we see that by a careful choice of parameters η 1 , , η m and by a slightly more restrictive smoothness requirement on f , d i ( i = 0 , , p 1 ) and K i ( i = 0 , , q ) it is possible to establish a faster convergence.
Theorem 3.
Let m N and let the following conditions be fulfilled:
(i) the assumption of Theorem 2 hold with d i C m + 1 , μ ( 0 , b ] ( i = 0 , p 1 ) , f C m + 1 , μ ( 0 , b ] , K i C m + 1 ( Δ ) ( i = 0 , , q ) , where μ R , μ < 1 ;
(ii) the quadrature approximation
0 1 F ( x ) d x k = 1 m w k F ( η k ) ,
with the knots { η k } satisfying (34) and appropriate weights { w k } is exact for all polynomials F of degree m.
Then, problem (8)–(9) has a unique solution y C m + 1 , ν ( 0 , b ] such that D C a p α p y C m + 1 , ν ( 0 , b ] . There exists an integer N 0 such that, for all integers N N 0 , Equation (36) possesses a unique solution z N S m 1 ( 1 ) ( Π N ) , determining by (41) a unique approximation y N to y, the solution of (8) and (9), and the following error estimates hold:
y y N c N m α * f o r m < 1 + α * ν , r 1 , N m α * ( 1 + log N ) f o r m = 1 + α * ν , r = 1 , N m α * f o r m = 1 + α * ν , r > 1 , N r ( 1 + α * ν ) f o r m > 1 + α * ν , 1 r < m + α * 1 + α * ν , N m α * f o r m > 1 + α * ν , r m + α * 1 + α * ν ,
for α * : = min { α p α p 1 , α p n 1 } < 1 , and
y y N c 1 N m 1 f o r m < 2 ν , r 1 , N m 1 ( 1 + log N ) 2 f o r m = 2 ν , r = 1 , N m 1 ( 1 + log N ) f o r m = 2 ν , r > 1 , N r ( 2 ν ) f o r m > 2 ν , 1 r < m + 1 2 ν , N m 1 f o r m > 2 ν , r m + 1 2 ν ,
for α * 1 . Here ν is determined by (30) (see Theorem 1), r is the grid parameter in (32) and c , c 1 are positive constants independent of N.
Proof. 
From Theorem 2, we know that problem (8) and (9) has a unique solution y C n 1 [ 0 , b ] such that z = D C a p α p y C [ 0 , b ] and there exists an integer N 0 such that for all N N 0 Equation (36) has a unique solution z N for which (49) is valid. Denote
z ^ N : = T z N + g , N N 0 ,
where T and g are defined by (21) and (22), respectively. From (36) we see that z N = P N z ^ N . Substituting this expression of z N into (55) we obtain that
z ^ N = T P N z ^ N + g , N N 0 .
From (20) and (56) follows the identity
( I T P N ) ( z ^ N z ) = T ( P N z z ) , N N 0 .
Since
( I T P N ) 1 = I + T ( I P N T ) 1 P N , N N 0 ,
we obtain, with the help of (48), that
z ^ N z c T ( P N z z ) , N N 0 .
This together with (25) yields
z ^ N z c i = 0 p 1 J α p α i ( P N z z ) + c 1 i = 0 q B ˜ i , L ( P N z z ) + c 2 k = 1 l j = 0 n 1 | J α p j ( P N z z ) ( b k ) | + c 3 i = 0 p 1 | J α p + 1 ( P N z z ) ( b ¯ i ) | , N N 0 ,
where
( B ˜ i , L x ) ( t ) : = 0 t ( t s ) α p θ i κ i L i ( t , s ) x ( s ) d s , x L ( 0 , b ) ,
with L i defined by (23). Here and below c , c 1 , c 2 and c 3 are generic positive constants which are independent of N. With the help of (3) and from the boundedness of the Riemann–Liouville integral operator we obtain for N N 0 the following estimates:
J α p α i ( P N z z ) c J α p α p 1 ( P N z z ) , i = 0 , p 1 ,
| J α p j ( P N z z ) ( b k ) | J α p j ( P N z z ) c J α p n 1 ( P N z z ) , j = 0 , , n 1 ,
| J α p + 1 ( P N z z ) ( b ¯ i ) | J α p + 1 ( P N z z ) c J α p n 1 ( P N z z ) , i = 0 , , n 1 ,
B ˜ i , L ( P N z z ) c 1 J 1 + α p θ i κ i ( P N z z ) c 2 J α p α p 1 ( P N z z ) , i = 0 , , q .
It follows from (57)–(61) that
z ^ N z c J α * ( P N z z ) , N N 0 ,
where α * = min { α p α p 1 , α p n 1 } . Since z N = P N z ^ N , we obtain with the help of (17) and (41) that
y N y = G ( z N z ) G P N ( z ^ N z ) + G ( P N z z ) , N N 0 .
Using (18), (59) and (60) we obtain
G ( P N z z ) J α p ( P N z z ) + c J α p n 1 ( P N z z ) c 1 J α * ( P N z z ) , N N 0 .
This together with (62) and (63) yields
y N y c J α * ( P N z z ) , N N 0 .
Because of Theorem 1 we have z C m + 1 , ν ( 0 , b ] and due to (3)
J α * ( P N z z ) c J 1 ( P N z z ) , N N 0 ,
for α * 1 . Therefore, it follows from (64) and Lemma 6 that the estimates (53) and (54) are true. □

8. Numerical Examples

Example 1.
Consider the following boundary value problem:
( D C a p 1 2 y ) ( t ) + d 0 ( t ) y ( t ) + 0 t ( t s ) 3 4 y ( s ) d s + 0 t ( t s ) 1 2 ( D C a p 1 4 y ) ( s ) d s = f ( t ) ,
y ( 0 ) + y ( 1 ) + 0 1 y ( s ) d s = 1 + 4 7 ,
with
d 0 ( t ) = t 1 2 , f ( t ) = 3 Γ ( 3 4 ) Γ ( 1 4 ) t 1 4 + t 5 4 + 3 2 Γ 3 4 Γ 1 4 t ,
where 0 t 1 . We see that (65) and (66) is a special problem of (8) and (9) with
α 0 = 0 , α 1 = 1 2 , p = 1 , n = 1 , θ 0 = 0 , θ 1 = 1 4 , κ 0 = 3 4 , κ 1 = 1 2 , q = 1 , b 1 = b = 1 , l = 1 , b ¯ 0 = 1 , n 0 = n 1 = 0 , β 000 = β 001 = β 0 = 1 , γ 0 = 1 + 4 7 , d 0 C m , 1 2 ( 0 , 1 ] , f C m , 3 4 ( 0 , 1 ] for all m N , K 0 = K 1 = 1 .
Clearly, d 0 , f C m , μ ( 0 , 1 ] with μ = 3 4 and arbitrary m N . Therefore, by (30),
ν = max { μ , ν 1 , ν 3 , ν 4 } = max { μ , 1 α 1 , κ 0 , max { κ 0 α 1 , κ 1 ( α 1 θ 1 ) } } = 3 4 .
To solve (65) and (66) by method {(36), (41)} we set z : = D C a p 1 2 y . We have for z Equation (20) with T and g given by (25) and (26), respectively. Approximations z N S m 1 ( 1 ) ( Π N ) , N N , to the solution z of Equation (20) on the interval [ 0 , 1 ] are found by (35) using (33) with
η 1 = 3 3 6 , η 2 = 1 η 1 ( m = 2 )
and
η 1 = 5 15 10 , η 2 = 1 2 , η 3 = 1 η 1 ( m = 3 ) ,
the knots of the Gaussian quadrature approximation (52) for m = 2 and m = 3 , respectively. The coefficients c j k = z N ( t j k ) ( k = 1 , , m , j = 1 , , N ) and the function z N ( t ) ( t [ 0 , b ] ) are determined by (40) and (38), respectively. After that, by using Formula (42) we can find the the approximate solution y N for (65) and (66).
In Table 1 and Table 2, some results of numerical experiments for different values of the parameters m , N and r are presented. The errors ε N in Table 1 and Table 2 are calculated as follows:
ε N : = max j = 1 , , N max k = 0 , , 10 | y ( τ j k ) y N ( τ j k ) | ,
where
y ( t ) = t 3 4 ( t [ 0 , 1 ] )
is the exact solution to (65) and (66) and
τ j k : = t j 1 + k ( t j t j 1 ) / 10 , k = 0 , , 10 , j = 1 , , N ,
with t j defined by (32). The ratios
Θ N : = ε N / 2 ε N ,
characterizing the observed convergence rate, are also presented.
In the case m = 2 , it follows from (53) with α 1 = 1 2 and ν = 3 4 that, for sufficiently large N,
ε N c 0 N 0.75 r if 1 r < 10 3 = 3.33 ( 3 ) , N 2.5 if r 10 3 ,
where c 0 is a positive constant independent of N. Due to (69), the ratios Θ N for r = 1 , r = 2 , r = 3 and r 10 3 ought to be approximately 2 0.75 1.68 , 2 1.5 2.83 , 2 2.25 4.76 and 2 2.5 5.66 , respectively. These values are given in the last row of Table 1.
In the case m = 3 , it follows from (53) with α 1 = 1 2 and ν = 3 4 that, for sufficiently large N,
ε N c 1 N 0.75 r if 1 r < 14 3 = 4.66 ( 6 ) , N 3.5 if r 14 3 ,
where c 1 is a positive constant independent of N. Due to (70), the ratios Θ N for r = 3 , r = 4 and r 14 3 ought to be approximately 2 2.25 4.76 , 2 3 = 8.00 and 2 3.5 11.31 , respectively. These values are given in the last row of Table 2.
As we can see from Table 1 and Table 2, the numerical results are in good accord with the theoretical estimates given by Theorem 3 (by estimates (69) and (70)).
Note that the conditions imposed by Theorem 2 are, in general, not sufficient for obtaining a global superconvergence rate. To show this, we have solved (65) and (66) by method {(36), (41)} with collocation parameters
η 1 = 0.1 , η 2 = 0.9 ( m = 2 )
for which the condition (ii) in Theorem 3 is not satisfied. The results of the numerical experiments are presented in Table 3, with the ratios (68) corresponding to the estimate (69) given in the last row of the table. As we can see, although the numerical convergence rate for r = 1 and r = 2 is still in accord with Theorem 3, for r = 3 and r = 10 3 the numerical results do not attain the predicted superconvergence rate. Instead, the highest attained numerical convergence rate is close to 2 2 = 4 , which is the maximal convergence rate predicted by Theorem 2.
Example 2.
Consider the following boundary value problem:
( D C a p 11 10 y ) ( t ) + d 0 ( t ) y ( t ) + 0 t ( t s ) 1 2 ( D C a p 1 10 y ) ( s ) d s = f ( t ) ,
y ( 0 ) = 0 , y ( 0 ) = 0 ,
with
d 0 ( t ) = t 1 5 , f ( t ) = Γ ( 11 5 ) Γ ( 11 10 ) t 1 10 + t 7 5 + Γ 11 5 Γ ( 1 2 ) Γ ( 8 5 ) t 3 5 ,
where 0 t 1 . We see that (71) and (72) is an initial value problem (27) with
α 0 = 0 , α 1 = 11 10 , p = 1 , n = 2 , b = 1 , θ 0 = 1 10 , κ 0 = 1 2 , q = 0 , γ 0 = 0 , γ 1 = 0 , d 0 C m , 4 5 ( 0 , 1 ] , f C m , 9 10 ( 0 , 1 ] for all m N , K 0 = 1 .
Clearly, d 0 , f C m , μ ( 0 , 1 ] with μ = 9 10 and arbitrary m N . Therefore, by (30),
ν = max { μ , ν 1 , ν 3 , ν 4 } = max { μ , 1 α 1 , κ 0 ( 1 θ 0 ) , κ 0 ( α 1 θ 0 ) } = 9 10 .
We solve (71) and (72) by method {(36), (41)} in a similar way as in Example 1. In Table 4 and Table 5 some results of numerical experiments for different values of the parameters m , N and r are presented. The errors ε N in Table 4 and Table 5 are calculated by the Formula (67), where
y ( t ) = t 6 5 ( t [ 0 , 1 ] )
is the exact solution to (71) and (72).
In the case m = 2 it follows from (54) with α 1 = 11 10 and ν = 9 10 that, for sufficiently large N,
ε N c 0 N 1.1 r if 1 r < 30 11 = 2.72 ( 72 ) , N 3 if r 30 11 ,
where c 0 is a positive constant independent of N. Due to (73), the ratios Θ N for r = 1 , r = 2 and r 30 11 ought to be approximately 2 1.1 2.14 , 2 2.2 4.60 and 2 3 = 8 , respectively. These values are given in the last row of Table 4.
In the case m = 3 , it follows from (54) with α 1 = 11 10 and ν = 9 10 that, for sufficiently large N,
ε N c 1 N 1.1 r if 1 r < 40 11 = 3.63 ( 63 ) , N 4 if r 40 11 ,
where c 1 is a positive constant independent of N. Due to (74), the ratios Θ N for r = 1 , r = 2 , r = 3 and r 40 11 ought to be approximately 2 1.1 2.14 , 2 2.2 4.60 , 2 3.3 9.85 and 2 4 = 16 , respectively. These values are given in the last row of Table 5.
As we can see from Table 4 and Table 5, the numerical results are in accord with the theoretical estimates given by Theorem 3 (by estimates (73) and (74)).

9. Concluding Remarks

In this work, we have introduced and analyzed a high order numerical method for solving a wide class of linear multi-term fractional weakly singular integro-differential equations with Caputo fractional derivatives for local or non-local boundary conditions. For certain values of coefficients, the considered problem is an initial value problem or a multi-point boundary value problem. We have reformulated the proposed problem as an integral equation with respect to the highest order Caputo derivative in the fractional integro-differential equation. Using this reformulation, we have first studied the existence, uniqueness and regularity of the problem. We have shown that, in general, the exact solution of the problem is non-smooth, even if the initial data is smooth. On the basis of the results obtained regarding the smoothness of the exact solution, with the help of special graded grids and spline collocation techniques we have constructed an effective numerical method that recovers its optimal convergence order. Moreover, we have shown that, by a careful choice of grid and collocation parameters, the method will obtain a global superconvergence rate. Note that (see [45,56]) the superconvergence advantage might not hold if the reformulated integral equation is obtained with respect to the exact solution of the original problem. The main conclusions of the paper extend known ones and are formulated in Theorems 1–3. From these results, an optimal choice of grid and collocation parameters can be made for finding a numerical solution to any problem given in the form (8) and (9) that satisfies the conditions of Theorems 1–3. More precisely, in order to apply Theorems 2 or 3, we first of all have to calculate the smoothness parameter ν , characterizing the regularity of the exact solution of the underlying problem. After finding the value of ν and choosing an order m 1 for the polynomials used in the piecewise polynomial method, one can select a grid parameter r large enough so that the corresponding conditions set for the convergence rates in Theorems 2 or 3 are fulfilled. Note that while the conditions given by Theorems 2 and 3 do not set an upper bound for the parameter r, for the optimal convergence rate the smallest possible value of r satisfying the corresponding inequality tends to give a more precise result.

Author Contributions

The authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially supported by Estonian Research Council grant PRG864.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors thank the reviewers for their remarks and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Diethelm, K. The Analysis of Fractional Differential Equations; Springer: Berlin, Germany, 2010. [Google Scholar]
  2. Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier: Amsterdam, The Netherlands, 2006. [Google Scholar]
  3. Podlubny, I. Fractional Differential Equations; Academic Press: San Diego, CA, USA, 1999. [Google Scholar]
  4. Samko, S.; Kilbas, A.; Marichev, O. Fractional Integrals and Derivatives: Theory and Applications; Gordon and Breach: Yverdon, Switzerland, 1993. [Google Scholar]
  5. Machado, J.T.; Kiryakova, V.; Mainardi, F. Recent history of fractional calculus. Commun. Nonlinear Sci. Numer. Simul. 2011, 16, 1140–1153. [Google Scholar] [CrossRef] [Green Version]
  6. Rossikhin, Y.A.; Shitikova, M.V. Applications of fractional calculus to dynamical problems of linear and nonlinear hereditary mechanics of solids. Appl. Mech. Rev. 1997, 50, 15–67. [Google Scholar] [CrossRef]
  7. Sun, H.; Zhang, Y.; Baleanu, D.; Chen, W.; Chen, Y. A new collection of real world applications of fractional calculus in science and engineering. Commun. Nonlinear Sci. Numer. Simul. 2018, 64, 213–231. [Google Scholar] [CrossRef]
  8. Freed, A.D.; Diethelm, K.; Luchko, Y. Fractional-Order Viscoelasticity (FOV): Constitutive Development Using the Fractional Calculus; Technical Report 2002-211914, NASA Glenn Research Center: Cleveland, OH, USA, 2002. [Google Scholar]
  9. Glöckle, W.G.; Nonnenmacher, T.F. A fractional calculus approach to self-similar protein dynamics. Biophys. J. 1995, 68, 46–53. [Google Scholar] [CrossRef] [Green Version]
  10. Metzler, R.; Schick, W.; Kilian, H.G.; Nonnenmacher, T. Relaxation in filled polymers: A fractional calculus approach. J. Chem. Phys. 1995, 103, 7180–7186. [Google Scholar] [CrossRef]
  11. Ahmad, W.; El-Khazali, R. Fractional-order dynamical models of love. Chaos Solitons Fractals 2007, 33, 1367–1375. [Google Scholar] [CrossRef]
  12. Song, L.; Xu, S.; Yang, J. Dynamical models of happiness with fractional order. Commun. Nonlinear Sci. Numer. Simul. 2010, 15, 616–628. [Google Scholar] [CrossRef]
  13. Fallahgoul, H.; Focardi, S.; Fabozzi, F. Fractional Calculus and Fractional Processes with Applications to Financial Economics: Theory and Application; Academic Press: Cambridge, MA, USA, 2016. [Google Scholar]
  14. Tang, S.; Ying, Y. Homogenizing atomic dynamics by fractional differential equations. J. Comput. Phys. 2017, 346, 539–551. [Google Scholar] [CrossRef]
  15. Yu, Y.; Perdikaris, P.; Karniadakis, G.E. Fractional modeling of viscoelasticity in 3D cerebral arteries and aneurysms. J. Comput. Phys. 2016, 323, 219–242. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  16. Kopka, R. Estimation of supercapacitor energy storage based on fractional differential equations. Nanoscale Res. Lett. 2017, 12, 636. [Google Scholar] [CrossRef] [Green Version]
  17. Goufo, E.F.D.; Nieto, J.J. Attractors for fractional differential problems of transition to turbulent flows. J. Comput. Appl. Math. 2018, 339, 329–342. [Google Scholar] [CrossRef]
  18. Metzler, R.; Klafter, J. The random walk’s guide to anomalous diffusion: A fractional dynamics approach. Phys. Rep. 2000, 339, 1–77. [Google Scholar] [CrossRef]
  19. Sandev, T.; Metzler, R.; Chechkin, A. From continuous time random walks to the generalized diffusion equation. Fract. Calc. Appl. Anal. 2018, 21, 10–28. [Google Scholar] [CrossRef] [Green Version]
  20. Klafter, J.; Lim, S.; Metzler, R. Fractional Dynamics: Recent Advances; World Scientific Publishing Co. Pte. Ltd.: Singapore, 2012. [Google Scholar]
  21. Diethelm, K.; Ford, N.J.; Freed, A.D. Detailed error analysis for a fractional Adams method. Numer. Algorithms 2004, 36, 31–52. [Google Scholar] [CrossRef] [Green Version]
  22. Yan, Y.; Pal, K.; Ford, N.J. Higher order numerical methods for solving fractional differential equations. BIT Numer. Math. 2014, 54, 555–584. [Google Scholar] [CrossRef] [Green Version]
  23. Garrappa, R. Trapezoidal methods for fractional differential equations: Theoretical and computational aspects. Math. Comput. Simul. 2015, 110, 96–112. [Google Scholar] [CrossRef] [Green Version]
  24. Liu, Y.; Roberts, J.; Yan, Y. Detailed error analysis for a fractional Adams method with graded meshes. Numer. Algorithms 2018, 78, 1195–1216. [Google Scholar] [CrossRef] [Green Version]
  25. Pedas, A.; Tamme, E. Numerical solution of nonlinear fractional differential equations by spline collocation methods. J. Comput. Appl. Math. 2014, 255, 216–230. [Google Scholar] [CrossRef]
  26. Ford, N.J.; Morgado, M.L.; Rebelo, M. A nonpolynomial collocation method for fractional terminal value problems. Comput. Appl. Math. 2015, 275, 392–402. [Google Scholar] [CrossRef] [Green Version]
  27. Cen, Z.; Huang, J.; Xu, A. An efficient numerical method for a two-point boundary value problem with a Caputo fractional derivative. J. Comput Appl. Math. 2018, 336, 1–7. [Google Scholar] [CrossRef]
  28. Kopteva, N.; Stynes, M. An efficient collocation method for a Caputo two-point boundary value problem. BIT Numer. Math. 2015, 55, 1105–1123. [Google Scholar] [CrossRef] [Green Version]
  29. Stynes, M.; Gracia, J.L. A finite difference method for a two-point boundary value problem with a Caputo fractional derivative. IMA J. Numer. Anal. 2015, 35, 698–721. [Google Scholar] [CrossRef] [Green Version]
  30. Pedas, A.; Tamme, E. Spline collocation for nonlinear fractional boundary value problems. Appl. Math. Comput. 2014, 244, 502–513. [Google Scholar] [CrossRef]
  31. Pedas, A.; Tamme, E.; Vikerpuur, M. Smoothing transformation and spline collocation for nonlinear fractional initial and boundary value problems. J. Comput. Appl. Math. 2017, 317, 1–16. [Google Scholar] [CrossRef]
  32. Baleanu, D.; Diethelm, K.; Scalas, E.; Trujillo, J.J. Fractional Calculus. Models and Numerical Methods; World Scientific Publishing Co. Pte. Ltd.: Singapore, 2016. [Google Scholar]
  33. Ma, X.; Huang, C. Spectral collocation method for linear fractional integro-differential equations. Appl. Math. Model. 2014, 38, 1434–1448. [Google Scholar] [CrossRef]
  34. Diethelm, K.; Luchko, Y. Numerical solution of linear multi-term initial value problems of fractional order. J. Comput. Anal. Appl. 2004, 6, 243–263. [Google Scholar]
  35. Diethelm, K.; Ford, N.J. Multi-order fractional differential equations and their numerical solution. Appl. Math. Comput. 2004, 154, 621–640. [Google Scholar] [CrossRef]
  36. Liang, H.; Stynes, M. Collocation methods for general Caputo two-point boundary value problems. J. Sci. Comput. 2018, 76, 390–425. [Google Scholar] [CrossRef]
  37. Kolk, M.; Pedas, A.; Tamme, E. Smoothing transformation and spline collocation for linear fractional boundary value problems. Appl. Math. Comput. 2016, 283, 234–250. [Google Scholar] [CrossRef]
  38. Pedas, A.; Tamme, E. On the convergence of spline collocation methods for solving fractional differential equations. J. Comput. Appl. Math. 2011, 235, 3502–3514. [Google Scholar] [CrossRef] [Green Version]
  39. Pedas, A.; Tamme, E. Piecewise polynomial collocation for linear boundary value problems of fractional differential equations. J. Comput. Appl. Math. 2012, 236, 3349–3359. [Google Scholar] [CrossRef] [Green Version]
  40. Kolk, M.; Pedas, A.; Tamme, E. Modified spline collocation for linear fractional differential equations. J. Comput. Appl. Math. 2015, 283, 28–40. [Google Scholar] [CrossRef]
  41. Faghih, A.; Mokhtary, P. A new fractional collocation method for a system of multi-order fractional differential equations with variable coefficients. J. Comput. Appl. Math. 2021, 383, 113139. [Google Scholar] [CrossRef]
  42. Ahmad, B.; Nieto, J.J. Existence Results for Nonlinear Boundary Value Problems of Fractional Integrodifferential Equations with Integral Boundary Conditions. Bound. Value Probl. 2009, 2009, 1–11. [Google Scholar] [CrossRef] [Green Version]
  43. Alsaedi, A.; Ntouyas, S.K.; Agarwal, R.P.; Ahmad, B. On Caputo type sequential fractional differential equations with nonlocal integral boundary conditions. Adv. Differ. Equ. 2015, 33, 1238–1250. [Google Scholar] [CrossRef] [Green Version]
  44. Yan, R.; Sun, S.; Lu, H.; Zhao, Y. Existence of solutions for fractional differential equations with integral boundary conditions. Adv. Differ. Equ. 2014, 2014, 25. [Google Scholar] [CrossRef] [Green Version]
  45. Vikerpuur, M. Two collocation type methods for fractional differential equations with non-local boundary conditions. Math. Model. Anal. 2017, 22, 654–670. [Google Scholar] [CrossRef]
  46. Wang, X.; Wang, L.; Zeng, Q. Fractional differential equations with integral boundary conditions. J. Nonlinear Sci. Appl. 2015, 8, 309–314. [Google Scholar] [CrossRef] [Green Version]
  47. Zhao, J.; Xiao, J.; Ford, N.J. Collocation methods for fractional integro-differential equations with weakly singular kernels. Numer. Algorithms 2014, 65, 723–743. [Google Scholar] [CrossRef]
  48. Pedas, A.; Tamme, E.; Vikerpuur, M. Spline collocation for fractional weakly singular integro-differential equations. Appl. Numer. Math. 2016, 110, 204–214. [Google Scholar] [CrossRef]
  49. Pedas, A.; Tamme, E.; Vikerpuur, M. Numerical solution of linear fractional weakly singular integro-differential equations with integral boundary conditions. Appl. Numer. Math. 2020, 149, 124–140. [Google Scholar] [CrossRef]
  50. Stynes, M. Too much regularity may force too much uniqueness. Frac. Calc. Appl. Anal. 2016, 19, 1554–1562. [Google Scholar] [CrossRef] [Green Version]
  51. Stynes, M. Fractional-order derivatives defined by continuous kernels are too restrictive. Appl. Math. Lett. 2018, 85, 22–26. [Google Scholar] [CrossRef]
  52. Brunner, H. Collocation Methods for Volterra Integral and Related Functional Equations; Cambridge University Press: Cambridge, UK, 2004. [Google Scholar]
  53. Parts, I.; Pedas, A.; Tamme, E. Piecewise polynomial collocation for Fredholm integro-differential equations with weakly singular kernels. SIAM J. Numer. Anal. 2005, 43, 1897–1911. [Google Scholar] [CrossRef]
  54. Kolk, M.; Pedas, A. Numerical solution of Volterra integral equations with weakly singular kernels which may have a boundary singularity. Math. Model. Anal. 2009, 14, 79–89. [Google Scholar] [CrossRef]
  55. Kolk, M.; Pedas, A.; Vainikko, G. High-Order Methods for Volterra Integral Equations with General Weak Singularities. Numer. Funct. Anal. Optim. 2009, 30, 1002–1024. [Google Scholar] [CrossRef]
  56. Vikerpuur, M. Numerical Solution of Fractional Differential Equations. Ph.D. Thesis, University of Tartu, Tartu, Estonia, 2020. [Google Scholar]
  57. Brunner, H.; Pedas, A.; Vainikko, G. Piecewise polynomial collocation methods for linear Volterra integro-differential equations with weakly singular kernels. SIAM J. Numer. Anal. 2001, 39, 957–982. [Google Scholar] [CrossRef]
  58. Vainikko, G. Which Functions are Fractionally Differentiable? Z. Anal. Anwend. 2016, 35, 465–487. [Google Scholar] [CrossRef]
  59. Vainikko, G. Multidimensional Weakly Singular Integral Equations; Lecture Notes in Mathematics 1549; Springer: Berlin/Heidelberg, Germany, 1993. [Google Scholar]
  60. Pedas, A.; Tamme, E. Spline collocation methods for linear multi-term fractional differential equations. J. Comput. Appl. Math. 2011, 236, 167–176. [Google Scholar] [CrossRef] [Green Version]
Table 1. Numerical results for problem (65) and (66) with m = 2 .
Table 1. Numerical results for problem (65) and (66) with m = 2 .
r = 1 r = 2 r = 3 r = 10 3
N ε N Θ N ε N Θ N ε N Θ N ε N Θ N
4 1.05 × 10 2 3.89 × 10 3 2.92 × 10 3 3.62 × 10 3
8 7.11 × 10 3 1.48 1.69 × 10 3 2.30 5.80 × 10 4 5.03 6.46 × 10 4 5.61
16 4.63 × 10 3 1.54 6.47 × 10 4 2.62 1.10 × 10 4 5.29 1.18 × 10 4 5.46
32 2.93 × 10 3 1.58 2.36 × 10 4 2.74 2.12 × 10 5 5.17 2.08 × 10 5 5.69
64 1.81 × 10 3 1.62 8.43 × 10 5 2.80 4.90 × 10 6 4.33 3.62 × 10 6 5.76
128 1.10 × 10 3 1.64 2.99 × 10 5 2.82 1.09 × 10 6 4.48 6.29 × 10 7 5.75
256 6.65 × 10 4 1.66 1.06 × 10 5 2.82 2.40 × 10 7 4.57 1.09 × 10 7 5.74
512 3.99 × 10 4 1.67 3.75 × 10 6 2.83 5.18 × 10 8 4.62 1.91 × 10 8 5.72
1.68 2.83 4.76 5.66
Table 2. Numerical results for problem (65) and (66) with m = 3 .
Table 2. Numerical results for problem (65) and (66) with m = 3 .
r = 3 r = 4 r = 14 3 r = 5
N ε N Θ N ε N Θ N ε N Θ N ε N Θ N
4 9.01 × 10 4 1.05 × 10 3 1.31 × 10 3 1.44 × 10 3
8 1.73 × 10 4 5.20 1.35 × 10 4 7.78 1.39 × 10 4 9.41 1.54 × 10 4 9.34
16 3.48 × 10 5 4.98 1.53 × 10 5 8.81 1.25 × 10 5 11.1 1.29 × 10 5 12.0
32 7.17 × 10 6 4.85 1.76 × 10 6 8.69 1.05 × 10 6 11.9 1.01 × 10 6 12.8
64 1.50 × 10 6 4.79 2.08 × 10 7 8.45 8.89 × 10 8 11.8 8.60 × 10 8 11.7
128 3.14 × 10 7 4.77 2.51 × 10 8 8.29 7.60 × 10 9 11.7 7.38 × 10 9 11.6
256 6.58 × 10 8 4.76 3.07 × 10 9 8.18 6.57 × 10 10 11.6 6.38 × 10 10 11.6
512 1.38 × 10 8 4.76 3.78 × 10 10 8.13 5.77 × 10 11 11.4 6.04 × 10 11 10.6
4.76 8.00 11.3 11.3
Table 3. Numerical results for problem (65) and (66) with m = 2 and η 1 = 0.1 , η 2 = 0.9 .
Table 3. Numerical results for problem (65) and (66) with m = 2 and η 1 = 0.1 , η 2 = 0.9 .
r = 1 r = 2 r = 3 r = 10 3
N ε N Θ N ε N Θ N ε N Θ N ε N Θ N
4 2.18 × 10 2 8.70 × 10 3 6.41 × 10 3 6.54 × 10 3
8 1.43 × 10 2 1.53 3.46 × 10 3 2.51 1.98 × 10 3 3.23 1.88 × 10 3 3.48
16 9.23 × 10 3 1.55 1.29 × 10 3 2.67 5.53 × 10 4 3.58 5.06 × 10 4 3.71
32 5.85 × 10 3 1.58 4.99 × 10 4 2.59 1.44 × 10 4 3.83 1.26 × 10 4 4.02
64 3.64 × 10 3 1.61 1.83 × 10 4 2.73 3.60 × 10 5 4.01 3.04 × 10 5 4.14
128 2.23 × 10 3 1.63 6.57 × 10 5 2.78 8.79 × 10 6 4.10 7.25 × 10 6 4.19
256 1.35 × 10 3 1.65 2.34 × 10 5 2.80 2.13 × 10 6 4.12 1.73 × 10 6 4.19
512 8.12 × 10 4 1.66 8.33 × 10 6 2.81 5.19 × 10 7 4.11 4.17 × 10 7 4.16
1.68 2.83 4.76 5.66
Table 4. Numerical results for problem (71) and (72) with m = 2 .
Table 4. Numerical results for problem (71) and (72) with m = 2 .
r = 1 r = 2 r = 30 11 r = 3
N ε N Θ N ε N Θ N ε N Θ N ε N Θ N
4 2.15 × 10 3 5.21 × 10 4 4.04 × 10 4 4.27 × 10 4
8 9.65 × 10 4 2.23 1.04 × 10 4 5.00 5.38 × 10 5 7.51 5.22 × 10 5 8.19
16 4.26 × 10 4 2.27 2.03 × 10 5 5.13 6.81 × 10 6 7.90 6.03 × 10 6 8.65
32 1.86 × 10 4 2.29 4.15 × 10 6 4.89 8.45 × 10 7 8.06 6.73 × 10 7 8.97
64 8.13 × 10 5 2.29 8.74 × 10 7 4.75 1.04 × 10 7 8.12 7.43 × 10 8 9.05
128 3.54 × 10 5 2.30 1.87 × 10 7 4.68 1.28 × 10 8 8.14 8.19 × 10 9 9.07
256 1.54 × 10 5 2.30 4.03 × 10 8 4.64 1.57 × 10 9 8.15 9.04 × 10 10 9.06
512 6.80 × 10 6 2.27 8.72 × 10 9 4.62 1.93 × 10 10 8.15 1.00 × 10 10 9.03
2.14 4.16 8.00 8.00
Table 5. Numerical results for problem (71) and (72) with m = 3 .
Table 5. Numerical results for problem (71) and (72) with m = 3 .
r = 1 r = 2 r = 3 r = 40 11
N ε N Θ N ε N Θ N ε N Θ N ε N Θ N
4 9.34 × 10 4 1.79 × 10 4 7.89 × 10 5 8.54 × 10 5
8 4.11 × 10 4 2.28 3.41 × 10 5 5.26 6.99 × 10 6 11.3 5.34 × 10 6 16.0
16 1.79 × 10 4 2.29 7.05 × 10 6 4.84 6.17 × 10 7 11.3 3.21 × 10 7 16.6
32 7.82 × 10 5 2.29 1.52 × 10 6 4.64 5.75 × 10 8 10.7 1.92 × 10 8 16.8
64 3.40 × 10 5 2.30 3.30 × 10 7 4.61 5.55 × 10 9 10.4 1.15 × 10 9 16.6
128 1.48 × 10 5 2.30 7.18 × 10 8 4.60 5.48 × 10 10 10.1 6.97 × 10 11 16.5
256 6.79 × 10 6 2.18 1.56 × 10 8 4.60 5.47 × 10 11 10.0 4.23 × 10 12 16.5
512 3.17 × 10 6 2.14 3.40 × 10 9 4.60 5.50 × 10 12 9.94 2.58 × 10 13 16.4
2.14 4.16 9.85 16.0
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Pedas, A.; Vikerpuur, M. Spline Collocation for Multi-Term Fractional Integro-Differential Equations with Weakly Singular Kernels. Fractal Fract. 2021, 5, 90. https://doi.org/10.3390/fractalfract5030090

AMA Style

Pedas A, Vikerpuur M. Spline Collocation for Multi-Term Fractional Integro-Differential Equations with Weakly Singular Kernels. Fractal and Fractional. 2021; 5(3):90. https://doi.org/10.3390/fractalfract5030090

Chicago/Turabian Style

Pedas, Arvet, and Mikk Vikerpuur. 2021. "Spline Collocation for Multi-Term Fractional Integro-Differential Equations with Weakly Singular Kernels" Fractal and Fractional 5, no. 3: 90. https://doi.org/10.3390/fractalfract5030090

APA Style

Pedas, A., & Vikerpuur, M. (2021). Spline Collocation for Multi-Term Fractional Integro-Differential Equations with Weakly Singular Kernels. Fractal and Fractional, 5(3), 90. https://doi.org/10.3390/fractalfract5030090

Article Metrics

Back to TopTop