
In this paper, we introduce a mixed numerical technique for solving fractional differential equations (FDEs) by combining Chebyshev collocation methods and a piecewise quadratic quadrature rule. For getting solutions at each integration step, the fractional integration is calculated in two intervals-all previous time intervals and the current time integration step. The solution at the current integration step is calculated by using Chebyshev interpolating polynomials. To remove a singularity which belongs originally to the FDEs, Lagrangian interpolating technique is considered since the Chebyshev interpolating polynomial can be rewritten as a Lagrangian interpolating form. Moreover, for calculating the fractional integral on the whole previous time intervals, a piecewise quadratic quadrature technique is applied to get higher accuracy. Several numerical experiments demonstrate the efficiency of the proposed method and show numerically convergence orders for both linear and nonlinear cases.
Citation: Sunyoung Bu. A collocation methods based on the quadratic quadrature technique for fractional differential equations[J]. AIMS Mathematics, 2022, 7(1): 804-820. doi: 10.3934/math.2022048
[1] | Abdul Qadeer Khan, Ayesha Yaqoob, Ateq Alsaadi . Neimark-Sacker bifurcation, chaos, and local stability of a discrete Hepatitis C virus model. AIMS Mathematics, 2024, 9(11): 31985-32013. doi: 10.3934/math.20241537 |
[2] | Yao Shi, Zhenyu Wang . Bifurcation analysis and chaos control of a discrete fractional-order Leslie-Gower model with fear factor. AIMS Mathematics, 2024, 9(11): 30298-30319. doi: 10.3934/math.20241462 |
[3] | Ibraheem M. Alsulami . On the stability, chaos and bifurcation analysis of a discrete-time chemostat model using the piecewise constant argument method. AIMS Mathematics, 2024, 9(12): 33861-33878. doi: 10.3934/math.20241615 |
[4] | Abdul Qadeer Khan, Ayesha Yaqoob, Ateq Alsaadi . Discrete Hepatitis C virus model with local dynamics, chaos and bifurcations. AIMS Mathematics, 2024, 9(10): 28643-28670. doi: 10.3934/math.20241390 |
[5] | A. Q. Khan, Ibraheem M. Alsulami, S. K. A. Hamdani . Controlling the chaos and bifurcations of a discrete prey-predator model. AIMS Mathematics, 2024, 9(1): 1783-1818. doi: 10.3934/math.2024087 |
[6] | Kamel Guedri, Rahat Zarin, Ashfaq Khan, Amir Khan, Basim M. Makhdoum, Hatoon A. Niyazi . Modeling hepatitis B transmission dynamics with spatial diffusion and disability potential in the chronic stage. AIMS Mathematics, 2025, 10(1): 1322-1349. doi: 10.3934/math.2025061 |
[7] | Yulong Li, Long Zhou, Fengjie Geng . Dynamics on semi-discrete Mackey-Glass model. AIMS Mathematics, 2025, 10(2): 2771-2807. doi: 10.3934/math.2025130 |
[8] | Xiongxiong Du, Xiaoling Han, Ceyu Lei . Dynamics of a nonlinear discrete predator-prey system with fear effect. AIMS Mathematics, 2023, 8(10): 23953-23973. doi: 10.3934/math.20231221 |
[9] | Muhammad Farman, Ali Akgül, J. Alberto Conejero, Aamir Shehzad, Kottakkaran Sooppy Nisar, Dumitru Baleanu . Analytical study of a Hepatitis B epidemic model using a discrete generalized nonsingular kernel. AIMS Mathematics, 2024, 9(7): 16966-16997. doi: 10.3934/math.2024824 |
[10] | Ali Al Khabyah, Rizwan Ahmed, Muhammad Saeed Akram, Shehraz Akhtar . Stability, bifurcation, and chaos control in a discrete predator-prey model with strong Allee effect. AIMS Mathematics, 2023, 8(4): 8060-8081. doi: 10.3934/math.2023408 |
In this paper, we introduce a mixed numerical technique for solving fractional differential equations (FDEs) by combining Chebyshev collocation methods and a piecewise quadratic quadrature rule. For getting solutions at each integration step, the fractional integration is calculated in two intervals-all previous time intervals and the current time integration step. The solution at the current integration step is calculated by using Chebyshev interpolating polynomials. To remove a singularity which belongs originally to the FDEs, Lagrangian interpolating technique is considered since the Chebyshev interpolating polynomial can be rewritten as a Lagrangian interpolating form. Moreover, for calculating the fractional integral on the whole previous time intervals, a piecewise quadratic quadrature technique is applied to get higher accuracy. Several numerical experiments demonstrate the efficiency of the proposed method and show numerically convergence orders for both linear and nonlinear cases.
Schoenberg introduced the trigonometric spline functions defined by divided differences in [18]. And the trigonometric spline functions have been shown to possess many B-spline-like properties. In view of this, many scholars call the trigonometric splines the trigonometric B-splines, in [4,8]. It is well-known that the trigonometric B-splines are piecewise functions corresponding to the spaces
T2n+1:=span{1,cost,sint,cos2t,sin2t,⋯,cosnt,sinnt}, |
for odd-order, and
H2n:=span{cost2,sint2,cos3t2,sin3t2,⋯,cos(2n−1)t2,sin(2n−1)t2}, |
for even-order. Odd-order trigonometric B-splines in T2n+1 form a partition of unity, a desirable property for curve design. However, even-order B-splines in H2n lack this partition of unity, creating challenges in certain applications where this property is critical. As a result, extensive research has focused on the odd-order basis, particularly on its normalization. The author of [8] established the recurrence relation for the trigonometric B-splines of arbitrary order and derived trigonometric Marsden identity. The author of [20] utilized the trigonometric Marsden identity to derive the normalized odd-order trigonometric B-splines over uniform knots. Building on the trigonometric Marsden identity expansion introduced by [7], [11] explicitly derived the normalization coefficients required to ensure that the trigonometric B-spline basis functions are properly normalized. [15] provided the p-Bézier basis functions in the space T2n+1, which is defined over any interval of length <π. Those basis functions are a subcase of the normalized trigonometric B-splines. [2] presented the normalized Bernstein-like basis functions in the space T2n+1, which is defined over the interval [0,π/2]. [21] established the C-B spline basis. In this work, the C-B spline basis of order 3 is just the normalized trigonometric B-spline basis corresponding to the space T3. In a more general context, the normalized trigonometric B-splines are also considered in [16] as a special case.
Curve and surface design is an important area in Computer Aided Geometric Design (CAGD), where trigonometric B-splines are a foundational tool. Normalized trigonometric B-splines enable enhanced construction and control of curves and surfaces, suggesting their potential applications in aircraft design [9]. Additionally, trigonometric B-splines show promising applications in other fields, such as physical simulations (see [5,12,19]).
The purpose of this paper is to introduce the integral formula for odd-order trigonometric B-splines. Given the significant applications and theoretical importance of integral formulas in Chebyshev systems for fields such as numerical analysis, signal processing, and function approximation, it is notable that the integral properties of sin and cos in trigonometric B-spline bases render them incapable of being directly derived like other bases in Chebyshev systems. The aim of this study is to provide a similar integral formula for trigonometric B-spline bases. To achieve this, this paper first constructs a novel set of even-order trigonometric B-spline curve basis functions and, through integration of these functions, successfully derives the traditional odd-order trigonometric B-spline basis functions, thereby establishing the integral formula for odd-order trigonometric B-spline bases. During this derivation process, a determinant of even order with structural symmetry is obtained. Furthermore, this study refines the conditions for knot sequences to ensure that the corresponding normalized trigonometric B-spline bases possess nonnegativity.
Our main contributions are
● A set of trigonometric spline bases corresponding to the DC component-free space is provided, along with the integral representation of normalized trigonometric B-spline bases corresponding to space T2n+1.
● Adjusting the conditions imposed on the knot sequence to guarantee the nonnegativity of the normalized trigonometric B-spline basis functions.
● A structurally symmetric even-order determinant is presented.
The remainder of this article is organized as follows: Section 2 reviews the related concepts and properties. The improvements to knot sequences are discussed in Section 3. In Section 4, the trigonometric spline basis corresponding to the DC component-free space and the integral formula for the normalized trigonometric B-spline basis are presented. The final conclusions are drawn in the last section.
In this section, we will recall some established concepts and conclusions.
[1] has demonstrated that the knot sequences for B-spline basis functions can be finite, infinite, or bi-infinite. Analogous to the case of traditional B-spline basis functions, this paper focuses on the study of trigonometric B-spline basis functions corresponding to bi-infinite knot sequences.
The normalized trigonometric B-spline basis functions are defined in a manner analogous to the de Boor-Cox formula [4,7,8,11].
Definition 2.1. (Normalized trigonometric B-spline basis functions) Given a knot sequence T={ti}+∞i=−∞, such that
ti≤ti+1,0<ti+2n+1−ti<2π,i∈Z,n∈Z+, | (2.1) |
the normalized trigonometric B-spline basis functions of order 2n+1 are defined as follows:
Ki,2n+1(t)=ζi,2n+1Ni,2n+1(t), | (2.2) |
where
Ni,1(t)={1, if ti≤t<ti+1,0,otherwise. | (2.3) |
Ni,2n(t)=sin(t−ti2)sin(ti+2n−1−ti2)Ni,2n−1(t)+sin(ti+2n−t2)sin(ti+2n−ti+12)Ni+1,2n−1(t), | (2.4) |
Ni,2n+1(t)=sin(t−ti2)sin(ti+2n−ti2)Ni,2n(t)+sin(ti+2n+1−t2)sin(ti+2n+1−ti+12)Ni+1,2n(t), | (2.5) |
ζi,2n+1=1(2n)!∑μn∏j=1costi+μ(2j)−ti+μ(2j−1)2, | (2.6) |
and the sum is taken over all permutations μ:{1,2,⋯,2n}→{1,2,⋯,2n}.
Remark 2.1 In [4,8,11], the knot sequence satisfies the condition 0<ti+2n+1−ti<2π. However, the knot sequence described in [7] satisfies a slightly different condition, 0<ti+2n−ti<2π. In the subsequent section, the conditions of the knot sequence are reiterated.
If ti−1<ti=ti+1=⋯=ti+mi−1<ti+mi, where 1≤mi≤2n, the knots tj, where j=i,i+1,⋯,i+mi−1, are referred to as knots of multiplicity mi. Especially, we set 00=0. The space of trigonometric spline basis is defined by
Γ2n+1[T]:={Ni,2n+1(t)|Ni,2n+1(t)|t∈[ti,ti+1)∈T2n+1, and N(l)i,2n+1(ti−)=N(l)i,2n+1(ti+),0≤l≤2n−mi,i∈Z}. |
The trigonometric B-spline basis functions possess many B-spline-like properties [3,6,8,14].
Property 2.1. (Properties of the trigonometric B-spline basis functions) The trigonometric B-spline basis functions Ni,2n+1(t) defined in Eq (2.5) possess the following properties:
(1) (Local support) For any i∈Z and n∈Z+, there exists
Ni,2n+1(t)={>0,t∈(ti,ti+2n+1),=0,t∉[ti,ti+2n+1]. | (2.7) |
(2) (Continuity) The continuous order of Ni,2n+1(t) at tj (where i≤j≤i+2n+1), denoted as kji,2n+1, can be described as
kji,2n+1={2n−ξ,i≤j≤i+ξ−1,2n−mj, i+ξ≤j≤i+2n+1−η,2n−η, i+2n+2−η≤j≤i+2n+1, | (2.8) |
if ti=ti+1=⋯=ti+ξ−1<ti+ξ≤ti+ξ+1≤⋯≤ti+2n+1−η<ti+2n+2−η=⋯=ti+2n+1.
In this section, we will adjust the conditions of the knot sequence to ensure the nonnegativity of the normalized trigonometric B-spline basis functions Ki,2n+1(t) for i∈Z and n∈Z+.
First, the condition (2.1) can be relaxed.
The nonnegativity of the basis function Ni,2n+1(t) is ensured by the condition 0<ti+2n+1−ti<2π as stated in (2.1). Since the length of the support intervals for Ni,2n(t) and Ni+1,2n(t) in Eq (2.4) is 2n, replacing 0<ti+2n+1−ti<2π with the condition 0<ti+2n−ti<2π still guarantees the nonnegativity of Ni,2n+1(t). Therefore, the condition (2.1) can be relaxed to
ti≤ti+1,0<ti+2n−ti<2π,i∈Z,n∈Z+. | (3.1) |
Second, the condition to ensure the positivity of the normalized coefficients ζi,2n+1 in Eq (2.6) is presented. According to the representation in Eq (2.6), we obtain the condition to ensure the positivity of the normalized coefficient ζi,2n+1, that is
0≤ti+2n−1−ti<π, i∈Z,n∈Z+. | (3.2) |
The Bézier-like basis defined in the space T2n+1 is a subcase of the trigonometric B-spline basis. In [13], it was noted that the space T2n+1 does not have an NTP basis when the domain of T2n+1 is [0,π]. This implies the non-existence of normalized coefficients. Consequently, we conclude that ti+2n−1−ti≠π. In [15], it proved that there exist NTP bases provided that the domain of T2n+1 is any interval of length <π, specifically referred to as p-Bézier bases. This implies that the normalized coefficient satisfies the condition ti+2n−1−ti<π, in the special cases of Bézier.
Figure 1a presents an example of the basis functions Ni,2n+1(t) for i∈Z, whose corresponding knot sequence T satisfies condition (3.1) but fails to satisfy condition (2.1). Here n=2 and the knot sequence T={ti}16i=1={1,1,1,1,1,3,4,5.3,6.5,7.5,8.8,10,10,10,10,10}. Figure 1b shows the trigonometric B-spline basis functions Ni,3(t) and Ki,3(t) corresponding to the knot sequence that satisfies condition (3.1) but does not satisfy condition (3.2), while Figure 1c presents the functions Ni,3(t) and Ki,3(t) corresponding to the knot sequence that satisfies both conditions (3.1) and (3.2).
Although the coefficients of the normalized trigonometric B-spline basis have already been defined in Eq (2.6), for the convenience of deriving and proving the integral formula of the normalized trigonometric B-spline basis, this paper introduces a simplified normalized coefficient expression that is equivalent to Eq (2.6).
Lemma 3.1. Let
Ci,2n+1=1(2n−1)!!∑γ(1,2,…,2n)n∏r=1costi+m2r−ti+m2r−12,i∈Z,n∈Z+, | (3.3) |
where the sum is taken over all permutations γ(1,2,…,2n):{m1,m2,…,m2n}→{1,2,…,2n}, with m1,m2,…,m2n being a permutation of 1,2,…,2n that satisfies m1<m3<…<m2n−1 and m2r−1<m2r for each r=1,…,n. Then there exists
Ci,2n+1=ζi,2n+1, |
where ζi,2n+1 defined in Eq (2.6).
Third, a new definition for the normalized trigonometric B-spline basis that guarantees nonnegativity is presented.
Definition 3.1. (Nonnegative normalized trigonometric B-spline basis functions) Given a knot sequence T={ti}+∞i=−∞, such that
ti≤ti+1, 0<ti+2n−ti<2π and 0≤ti+2n−1−ti<π, i∈Z,n∈Z+, | (3.4) |
the nonnegative normalized trigonometric B-spline basis functions of order 2n+1 are defined as follows:
Ki,1(t)={1, if ti≤t<ti+1,0,otherwise. | (3.5) |
Ki,2n+1(t)=Ci,2n+1Ni,2n+1(t), | (3.6) |
where Ni,2n+1(t), Ci,2n+1 is defined in Eqs (2.5) and (3.3), respectively.
In this section, we generally set the knot sequence to be T={ti}+∞i=−∞ that satisfies condition (3.4), where the multiplicity of ti is mi with 1≤mi≤2n, and kji,2n+1 is defined in Eq (2.8) without further explanation. Let us define the DC component-free space as T2n:=span{cost,sint,⋯,cosnt,sinnt}. Its corresponding piecewise trigonometric polynomial space is
Γ2n[T]:={Fi,2n(t)|Fi,2n(t)|t∈[ti,ti+1)∈T2n, and F(l)i,2n(ti−)=F(l)i,2n(ti+),0≤l≤2n−mi−1, 1≤mi≤2n−1,i∈Z}. |
Clearly, Γ2n[T] is a linear space. We can derive the subspace of Γ2n[T] as follows:
Γ2n[ti,ti+2n]={Fi,2n(t)∈Γ2n[T]|Fi,2n(t)=0,t∉[ti,ti+2n] and Fi,2n(t)≠0,t∈(ti,ti+2n),F(l)i,2n(tj−)=F(l)i,2n(tj+),0≤l≤kji,2n, i≤j≤i+2n}. |
It can be shown that a function in the space \(\Gamma_{2n}[t_i, t_{i + 2n}]\) exhibits local support and a specific order of continuity.
The following determinant and its accompanying proof are presented to facilitate future derivations.
Lemma 4.1. For any n∈Z+, then the following identity holds.
D(t1,t2,⋯,t2n):=|cost1cost2…cost2nsint1sint2…sint2ncos2t1cos2t2…cos2t2nsin2t1sin2t2…sin2t2n⋮⋮⋮⋮cosnt1cosnt2…cosnt2nsinnt1sinnt2…sinnt2n|=22n2−nn!∏1≤l<j≤nsintj−tl2∑γ(1,2,…,2n)n∏r=1costm2r−tm2r−12, | (4.1) |
where γ(1,2,…,2n) defined in Lemma 3.1.
Proof. According to Euler's formula and the identity eitj−eits=2iei2(tj+ts)sintj−ts2, it follows that
D(t1,t2,⋯,t2n)=|eit1+e−it12eit2+e−it22…eit2n+e−it2n2eit1−e−it12ieit2−e−it22i…eit2n−e−it2n2i⋮⋮⋮⋮enit1+e−nit12enit2+e−nit22…enit2n+e−nit2n2enit1−e−nit12ienit2−e−nit22i…enit2n−e−nit2n2i|=(−1)n2+n(2i)ne−nit1…e−nit2n|11…1eit1eit2…eit2n⋮⋮⋮⋮e(n−1)it1e(n−1)it2…e(n−1)it2ne(n+1)it1e(n+1)it2…e(n+1)it2n⋮⋮⋮⋮e2nit1e2nit2…e2nit2n|=22n2−n2ne−nit1…e−nit2n∑1≤m1<m2<…<mn≤2neitm1…eitmn∏1≤s<j≤2nei2(tj+ts)sintj−ts2. |
For the sake of convenience, let
C(t1,t2,⋯,t2n)=∑γ(1,2,…,2n)n∏r=1costm2r−tm2r−12. | (4.2) |
Therefore, it suffices to prove that
C(t1,t2,⋯,t2n)=n!2ne−nit1…e−nit2n∑1≤m1<m2<…<mn≤2neitm1…eitmn∏1≤s<j≤2nei2(tj+ts)=n!2n∑1≤m1<m2<…<mn≤2nexp(i2mn∑q=m1tq−i2(2n∑h=1th−mn∑q=m1tq)). | (4.3) |
We establish the inductive hypothesis for n. For n=1, the result is straightforward. Assume that the conclusion holds for n≤p−1, where \(p\) is any positive integer. Specifically, we have
C(tn1,tn2,⋯,tn2p−2)=(p−1)!2(p−1)∑εexp(i2mp−1∑q=m1tq−i2(n2p−2∑h=n1th−mp−1∑q=m1tq)), |
where the sum is taken over all permutations ε:{m1,m2,⋯,mp−1}→{n1,n2,⋯,n2p−2}. Here, n1,n2,⋯,n2p−2 represent a permutation of 1,2,⋯,2n such that n1<n2<⋯<n2p−2, while m1,m2,⋯,mp−1 is a subset of n1,n2,⋯,n2p−2 satisfying m1<m2<⋯<mp−1.
Next, consider the case where n=p. Based on this assumption, we have
C(t1,t2,⋯,t2p)=cost2p−t2p−12∑γ(1,2,⋯,2p−2)p−1∏r=1costm2r−tm2r−12+cost2p−t2p−22∑γ(1,2,⋯,2p−3,2p−1)p−1∏r=1costm2r−tm2r−12+⋯+cost2p−t22∑γ(1,3,4,⋯,2p−1)p−1∏r=1costm2r−tm2r−12+cost2p−t12∑γ(2,3,⋯,2p−1)p−1∏r=1costm2r−tm2r−12=12(exp(i2(t2p−t2p−1))+exp(−i2(t2p−t2p−1)))C(t1,t2,⋯,t2p−2)+12(exp(i2(t2p−t2p−2))+exp(−i2(t2p−t2p−2)))C(t1,t2,⋯,t2p−3,t2p−1)+⋯+12(exp(i2(t2p−t2))+exp(−i2(t2p−t2)))C(t1,t3,t4,⋯,t2p−1)+12(exp(i2(t2p−t1))+exp(−i2(t2p−t1)))C(t2,t3,⋯,t2p−1)=p!2p∑1≤m1<m2<…<mp≤2pexp(i2mp∑q=m1tq−i2(2p∑h=1th−mp∑q=m1tq)), |
where the sum is taken over all permutations γ(n1,n2,⋯,n2p−2):{m1,m2,⋯,m2p−2}→{n1,n2,⋯,n2p−2}, with m1,m2,⋯,m2p−2 being a permutation of n1,n2,⋯,n2p−2 that satisfies m1<m3<⋯<m2p−3 and m2r−1<m2r for each r=1,⋯,p−1. Here, the sequence {n1,n2,⋯,n2p−2} represents, in order, the sequences {1,2,⋯,2p−2}, {1,2,⋯,2p−3,2p−1}, ⋯, {1,3,4,⋯,2p−1}, and \(\{2, 3, \cdots, 2p-1\}\). Eq (4.3) is valid for any positive integer n. Thus, the lemma is proved.
This subsection defines a set of truncated functions and demonstrates that any function in the space Γ2n[ti,ti+2n] can be expressed as a linear combination of these functions.
Let g2n(t):=sintsin2n−2(t2)(n∈Z+), the truncated functions Gi,2n(t), where i∈Z and n∈Z+, are defined as follows: If ti=ti+1=⋯=ti+ξ−1<ti+ξ, then
Gi,2n(t):={0,t<ti,g(ξ−1)2n(t−ti),t≥ti. | (4.4) |
Figure 2a–2c illustrate examples of the function g4(t) and the truncated functions Gi,4(t), where i∈Z, over single and multiple knots, respectively.
To prove that any function in the space Γ2n[ti,ti+2n] can be represented as a linear combination of {Gi,2n(t)}i∈Z, the following lemmas will be utilized.
Lemma 4.2. There exist n+1 real numbers d0,d1,⋯,dn such that
sin2n(t2)=d0+d1cost+d2cos2t+⋯+dncosnt, |
where d0=(2n−1)!!(2n)!!.
Proof. It is well known that
sin2n(t2)∈span{1,cost,cos2t,⋯,cosnt}, |
since
sin2n(t2)=(sin2(t2))n=(1−cost2)n. |
Thus, there are n+1 real numbers d0,d1,⋯,dn such that
sin2n(t2)=d0+d1cost+d2cos2t+⋯+dncosnt. |
We deduce that, based on Euler's formula,
(eit2−e−it22i)2n=d0+d1eit+e−it2+d2e2it+e−2it2+⋯+dnenit+e−nit2. | (4.5) |
Expanding the left side of Eq (4.5) using the binomial theorem results in d0=(2n−1)!!(2n)!!.
Lemma 4.3. The function Gi,2n(t) defined in Eq (4.4) lies in Γ2n[T] for any i∈Z,n∈Z+.
Proof. First, according to Lemma 4.2, we obtain
sin2n−2(t2)∈span{1,cost,cos2t,⋯,cos(n−1)t}, |
Thus, we have
sintsin2n−2(t2)∈span{sint,sin2t,⋯,sinnt}, |
and
g2n(t−ti)∈T2n for i∈Z. |
Second, the order of continuity of g2n(t−ti) at ti is 2n−2, because that
g(l)2n(t−ti)|t=ti=0,l=0,1,⋯,2n−2, and g(2n−1)2n(t−ti)|t=ti≠0. |
Third, it is easy to see that the order of continuity of Gi,2n(t) is 2n−ξ−1 at ti and is ∞ at the other knots.
In conclusion, Gi,2n(t)∈Γ2n[T], for i∈Z.
Lemma 4.4. The functions Gi,2n(t) for i∈Z in Eq (4.4) are linearly independent.
Proof. If ti−1<ti=ti+1=⋯=ti+mi−1<ti+mi, the mi functions Gj,2n(t) for i≤j≤i+mi−1 are linearly independent since they have different continuous orders at ti.
For the sake of simplicity, let r=i+mi and tr−1<tr=tr+1=⋯=tr+mr−1<tr+mr. We can then similarly conclude that the functions Gj,2n(t) for r≤j≤r+mr−1 are linearly independent. In addition, it is straightforward to derive that
span{Gi,2n(t),Gi+1,2n(t),⋯,Gi+mi−1,2n(t)}∩span{Gr,2n(t),Gr+1,2n(t),⋯,Gr+mr−1,2n(t)}={0}. |
Thus, Gi,2n(t),Gi+1,2n(t),⋯,Gi+mi−1,2n(t),Gr,2n(t),Gr+1,2n(t),⋯,Gr+mr−1,2n(t) are linearly independent. Consequently, the functions Gi,2n(t) for i∈Z are linearly independent.
From the above lemmas, we conclude that any function in the space Γ2n[ti,ti+2n] can be expressed as a linear combination of Gi,2n(t) for i∈Z.
Theorem 4.1. For any function Fi,2n(t)∈Γ2n[ti,ti+2n], there exist 2n−η+1 real numbers νi,νi+1,⋯,νi+2n−η such that
Fi,2n(t)=i+2n−η∑j=iνjGj,2n(t), t∈[ti,ti+2n), |
where η is the multiplicity of ti+2n in the interval [ti,ti+2n] and the functions Gj,2n(t), where i≤j≤i+2n−η, are defined in Eq (4.4).
Proof. Since Fi,2n(t) in space Γ2n[ti,ti+2n] is a piecewise function, it can first be linearly represented by the functions Gj,2n(t) for i≤j≤i+2n−η in Eq (4.4) over a non-zero interval within its support interval.
Suppose ti=ti+1=⋯=ti+ξ−1<ti+ξ≤⋯≤ti+2n−η<ti+2n−η+1=⋯=ti+2n. We consider that the function Fi,2n(t) can be linearly represented in the interval [ti,ti+ξ). Thus, we prove that there exist ξ real numbers κi,κi+1,⋯,κi+ξ−1 such that
Fi,2n(t)|[ti,ti+ξ)=i+ξ−1∑j=iκjGj,2n(t). |
For simplicity, assume that
f1(t)=Fi,2n(t)|[ti,ti+ξ), t∈[ti,ti+ξ). |
Based on the definition of the space Γ2n[ti,ti+2n], we know that f1(t)∈T2n, which means that there exist 2n real numbers x1,x2,⋯,x2n such that
f1(t)=x1cost+x2sint+⋯+x2n−1cosnt+x2nsinnt, |
and
f(s)1(ti−)=f(s)1(ti)=f(s)1(ti+), 0≤s≤2n−ξ−1, |
which implies that
f(s)1(ti)=0, 0≤s≤2n−ξ−1. |
Let ρ=2n−ξ−1, Ωρ:={f1(t)|f1(t)∈T2n,f(s)1(ti)=0,0≤s≤ρ}, and Ψρ:=span{g2n(t−ti),g′2n(t−ti+1),⋯,g(2n−ρ−2)2n(t−ti+ξ−1)}=span{g2n(t−ti),g′2n(t−ti),⋯,g(2n−ρ−2)2n(t−ti)}.
Since g2n(t−ti),g′2n(t−ti),⋯,g(2n−ρ−2)2n(t−ti) are linearly independent, we conclude that the dimension of Ψρ is 2n−ρ−1. According to the definition of the function g2n(t), we obtain that g(l)2n(t−ti)∈Ωρ, l=0,1,⋯,2n−ρ−2. Hence, it follows naturally that Ψρ is the subspace of Ωρ.
The dimension of the space Ωρ is equal to the dimension of the solution space corresponding to the following linear equations.
{f1(ti)=0,f′1(ti)=0,⋮f(ρ)1(ti)=0. | (4.6) |
Thus, the following linear equations holds:
{x1costi+x2sinti+x3cos2ti+x4sin2ti+⋯+x2n−1cosnti+x2nsinnti=0,−x1sinti+x2costi−x32sin2ti+x42cos2ti+⋯−x2n−1nsinnti+x2nncosnti=0,−x1costi−x2sinti−x322cos2ti−x422sin2ti+⋯−x2n−1n2cosnti−x2nn2sinnti=0,x1sinti−x2costi+x323sin2ti−x423cos2ti+⋯+x2n−1n3sinnti−x2nn3cosnti=0,⋮x1cos(π2ρ+ti)+x2sin(π2ρ+ti)+⋯+x2n−1nρcos(π2ρ+nti)+x2nnρsin(π2ρ+nti)=0, | (4.7) |
where the corresponding coefficient matrix is given as
(costisinticos2tisin2ti…cosntisinnti−sinticosti−2sin2ti2cos2ti…−nsinntincosnti−costi−sinti−22cos2ti−22sin2ti…−n2cosnti−n2sinntisinti−costi23sin2ti−23cos2ti…n3sinnti−n3cosnti⋮⋮⋮⋮⋮⋮cos(π2ρ+ti)sin(π2ρ+ti)2ρcos(π2ρ+2ti)2ρsin(π2ρ+2ti)…nρcos(π2ρ+nti)nρsin(π2ρ+nti)). | (4.8) |
By performing elementary row operations, it is demonstrated that the matrix (4.8) maintains full row rank, independent of the parity of ρ. This result establishes that the dimension of the solution space for the linear system (4.7) is
2n−(ρ+1)=2n−ρ−1. |
The dimension of Ωρ is determined to be 2n−ρ−1. Consequently, it follows that Ωρ=Ψρ. In other words, we know that there exist 2n−ρ−1=2n−(2n−ξ−1)−1=ξ real numbers κi,κi+1,⋯,κi+ξ−1 such that
f1(t)=i+ξ−1∑j=iκjg(j−i)2n(t−tj). |
According to the definition of Gi,2n(t), the function \(f_1(t)\) can be expressed as
f1(t)=i+ξ−1∑j=iκjGj,2n(t). |
Consider the non-zero interval [ti+ξ,ti+ξ+mi+ξ). We define
f2(t)=Fi,2n(t)|[ti+ξ,ti+ξ+mi+ξ),t∈[ti+ξ,ti+ξ+mi+ξ). |
According to the continuous order of Fi,2n(t) at ti+ξ, we deduce that
f(s)1(ti+ξ)=f(s)1(ti+ξ−)=f(s)2(ti+ξ+)=f(s)2(ti+ξ),0≤s≤2n−mi+ξ−1. |
This implies that
f(s)2(ti+ξ)−f(s)1(ti+ξ)=0,0≤s≤2n−mi+ξ−1. |
Thus, from the above analysis, it follows that there are mi+ξ real numbers κi+ξ,κi+ξ+1,⋯,κi+ξ+mi+ξ−1 such that
f2(t)−f1(t)=i+ξ+mi+ξ−1∑j=i+ξκjGj,2n(t). |
Consequently, we have
f2(t)=i+ξ+mi+ξ−1∑j=iκjGj,2n(t). |
For every non-zero subinterval of the support interval of Fi,2n(t), we consider it this way. It can be concluded that there exist 2n−η+1 real numbers νi,νi+1,⋯,νi+2n−η such that
Fi,2n(t)=i+2n−η∑j=iνjGj,2n(t), t∈[ti,ti+2n−η+1)=[ti,ti+2n), |
where νj for i≤j≤i+2n−η is expressed as a linear combination of κi,κi+1,⋯,κi+2n−η.
The subsection demonstrates that the dimension of Γ2n[ti,ti+2n] is 1. To support this, we first require the following lemma.
Lemma 4.5. Given an integer i and positive integers n,η such that η≤2n−1, then the determinant
|Gi,2n(ti+2n)Gi+1,2n(ti+2n)…Gi+2n−η−1,2n(ti+2n)G′i,2n(ti+2n)G′i+1,2n(ti+2n)…G′i+2n−η−1,2n(ti+2n)⋮⋮⋮⋮G(2n−η−1)i,2n(ti+2n)G(2n−η−1)i+1,2n(ti+2n)…G(2n−η−1)i+2n−η−1,2n(ti+2n)|≠0, |
where the functions Gj,2n(t) for i≤j≤i+2n−η−1 are defined in Eq (4.4).
Proof. Use reduction to absurdity. Assume that the determinant is equal to zero. Then, there are 2n−η real numbers zi,zi+1,⋯,zi+2n−η−1, which are not all equal to zero, satisfying
i+2n−η−1∑l=izl(Gl,2n(ti+2n)G′l,2n(ti+2n)⋮G(2n−η−1)l,2n(ti+2n))=0. |
Let Y(t)=i+2n−η−1∑l=izlGl,2n(t). Then, we find that the first 2n−η−1 derivatives of Y(t) at ti+2n are all zero. According to Theorem 4.1, there exist mi+2n real numbers, such that
Y(t)=i+2n+mi+2n−η−1∑u=i+2n−ηzuGu,2n(t). |
Therefore,
Y(t)=i+2n−η−1∑l=izlGl,2n(t)=i+2n+mi+2n−η−1∑u=i+2n−ηzuGu,2n(t), |
and
i+2n−η−1∑l=izlGl,2n(t)−i+2n+mi+2n−η−1∑u=i+2n−ηzuGu,2n(t)=0. |
According to Lemma 4.4, we obtain that zi=⋯=zi+2n−η−1=0. This conflicts with the assumption. So, the lemma is proved.
From Theorem 4.1 and Lemma 4.5, we obtain the dimension of Γ2n[ti,ti+2n].
Theorem 4.2. The dimension of the linear space Γ2n[ti,ti+2n] is 1.
Proof. Suppose that u(t) is an arbitrary function in Γ2n[ti,ti+2n]. Thus, according to Theorem 4.1, there are 2n−η+1 real numbers νi,νi+1,⋯,νi+2n−η such that
u(t)=i+2n−η∑j=iνjGj,2n(t),t∈[ti,ti+2n)=[ti,ti+2n−η+1), |
where η denotes the multiplicity of ti+2n in the interval [ti,ti+2n]. Consider the continuous order of function u(t) at ti+2n. We have
u(l)(ti+2n−)=u(l)(ti+2n)=u(l)(ti+2n+)=0,l=0,1,2,⋯,2n−η−1, |
which implies that
u(l)(ti+2n)=0,l=0,1,2,⋯,2n−η−1. |
Thus, the equation representing the continuous order of u(t)s at ti+2n is given by
{u(ti+2n)=0,u′(ti+2n)=0,⋮u(2n−η−1)(ti+2n)=0. | (4.9) |
which can be expressed in matrix form as follows:
(Gi,2n(ti+2n)Gi+1,2n(ti+2n)…Gi+2n−η,2n(ti+2n)G′i,2n(ti+2n)G′i+1,2n(ti+2n)…G′i+2n−η,2n(ti+2n)⋮⋮⋮⋮G(2n−η−1)i,2n(ti+2n)G(2n−η−1)i+1,2n(ti+2n)…G(2n−η−1)i+2n−η,2n(ti+2n))(νiνi+1⋮νi+2n−η)=0. | (4.10) |
This system consists of linear equations with \nu_i, \nu_{i+1}, {\cdots}, \nu_{i+2n-\eta} as variables. Based on Lemma 4.5, the coefficient matrix of these linear equations is full row rank, with a rank of 2n-\eta+1-(2n-\eta) = 1 . This indicates that the dimension of \Gamma_{2n}[t_i, t_{i+2n}] is 1 .
In this subsection, we consider single knots and assume that t_i < t_{i+1} for any i\in\mathbb Z . Then the even-order trigonometric spline basis functions corresponding to the DC component-free space \mathcal T_{2n} , and the integral expression for the trigonometric B-spline basis K_{i, 2n+1}(t) are presented.
According to Theorem 4.2 and the definition of \Gamma_{2n}[t_i, t_{i+2n}] , it is established that F_{i, 2n}(t)\in\Gamma_{2n}[t_i, t_{i+2n}] and the dimension of \Gamma_{2n}[t_i, t_{i+2n}] is 1. If we find a function H(t)\in\Gamma_{2n}[t_i, t_{i+2n}] , then it follows that F_{i, 2n}(t) = \alpha H(t), t\in[t_i, t_{i+2n}) for some real number \alpha . Thus, the following theorem is provided.
Theorem 4.3. (The function expression in the space \Gamma_{2n}[t_i, t_{i+2n}] over single knots) For any function F_{i, 2n}(t)\in\Gamma_{2n}[t_i, t_{i+2n}] , there exists a real number \alpha such that
\begin{equation*} \label{eq:exRe_F} F_{i, 2n}(t) = \alpha H(t), t\in[t_i, t_{i+2n}), \end{equation*} |
where
\begin{equation*} \label{eq:exRe_H} H(t) = \left| \begin{array}{*{20}c} G_{i, 2n}(t) & G_{i+1, 2n}(t) & \ldots & G_{i+2n-1, 2n}(t) & G_{i+2n, 2n}(t)\\ \cos t_i & \cos t_{i+1} & \ldots & \cos t_{i+2n-1} & \cos t_{i+2n}\\ \sin t_i & \sin t_{i+1} & \ldots & \sin t_{i+2n-1} & \sin t_{i+2n}\\ \cos2t_i & \cos2t_{i+1} & \ldots & \cos2t_{i+2n-1} & \cos 2t_{i+2n}\\ \sin2t_i & \sin2t_{i+1} & \ldots & \sin2t_{i+2n-1} & \sin 2t_{i+2n}\\ \vdots & \vdots & \vdots & \vdots & \vdots \\ \cos nt_i & \cos nt_{i+1} & \ldots & \cos nt_{i+2n-1} & \cos nt_{i+2n}\\ \sin nt_i & \sin nt_{i+1} & \ldots & \sin nt_{i+2n-1} & \sin nt_{i+2n}\\ \end{array} \right|, \end{equation*} |
and \alpha = -\frac{1}{D(t_i, t_{i+1}, \cdots, t_{i+2n-1})} . Here D(t_i, t_{i+1}, \cdots, t_{i+2n-1}) and the functions G_{j, 2n}(t) for i\le j\le i+2n are defined in Eqs (4.1) and (4.4), respectively.
Proof. According to Theorem 4.1, there exist 2{\mit n} real numbers \alpha_i, \alpha_{i+1}, {\cdots}, \alpha_{i+2n-1} such that
\begin{equation} F_{i, 2n}(t) = \sum\limits_{j = i}^{i+2n-1}\alpha_jG_{j, 2n}(t), t\in[t_i, t_{i+2n}), \end{equation} | (4.11) |
By the continuous order of F_{i, 2n}(t) at t_{i+2n} , it follows that
\begin{equation} F^{(d)}_{i, 2n}(t_{i+2n}) = \sum\limits_{j = i}^{i+2n-1}\alpha_jG^{(d)}_{j, 2n}(t_{i+2n}) = 0, t\in[t_i, t_{i+2n}), d = 0, 1, 2, {\cdots}, 2n-2. \end{equation} | (4.12) |
This can be expressed equivalently as a system of equations
\begin{equation} \left \{ \begin{array}{*{20}c} \sum\limits_{j = i}^{i+2n-1}\alpha_jG_{j, 2n}(t_{i+2n}) = 0, \hfill \\ \sum\limits_{j = i}^{i+2n-1}\alpha_jG'_{j, 2n}(t_{i+2n}) = 0, \hfill \\ \vdots \\ \sum\limits_{j = i}^{i+2n-1}\alpha_jG^{(2n-2)}_{j, 2n}(t_{i+2n}) = 0. \hfill \\ \end{array} \right. \end{equation} | (4.13) |
In addition, we have
\begin{equation} \sin{({\mit t}-{{\mit t}_{i+2n})}}\sin^{2n-2}\left(\frac{{\mit t}-t_{i+2n}}{2}\right) = \sum\limits_{j = i}^{i+2n-1}\beta_j\sin{({\mit t}-t_j)}\sin^{2n-2}\left(\frac{\mit t-t_j}{2}\right), \end{equation} | (4.14) |
where \beta_i, \beta_{i+1}, \cdots, \beta_{i+2n-1} are real numbers. Since Eq (4.14) when t = t_{i+2n} is equivalent to Eq (4.13). We obtain that \alpha_j = \beta_j, j = i, {\cdots}, i+2n-1 . Thus, we only focus on \beta_j, i\le j\le i+2n-1 . By proving Lemma 4.3, it can be concluded that there exist n numbers \eta_{1}, \eta_2, {\cdots}, \eta_n such that
\begin{equation} \sin{\mit (t-t_j)}\sin^{2n-2}\left(\frac{\mit t-t_j}{2}\right) = \sum\limits_{l = 1}^n\eta_l\sin l({\mit t-t_j}), j = i, i+1, {\cdots}, i+2n. \end{equation} | (4.15) |
So we can rewrite (4.14) as follows:
\begin{equation} \begin{split} & \left(\begin{array}{*{20}c} \cos t &\sin t & \ldots &\cos nt &\sin nt \\ \end{array} \right) \left(\begin{array}{*{20}c} -\eta_1\sin t_{i+2n} \\ \eta_1\cos t_{i+2n} \\ -\eta_2\sin 2t_{i+2n} \\ \eta_2\cos 2t_{i+2n} \\ \vdots \\ -\eta_n\sin nt_{i+2n} \\ \eta_n\cos nt_{i+2n} \\ \end{array} \right)\\ = &\left(\begin{array}{*{20}c} \cos t &\sin t & \ldots &\cos nt &\sin nt \\ \end{array} \right) \left(\begin{array}{*{20}c} -\eta_1\sin t_i & \ldots & -\eta_1\sin t_{i+2n-1} \\ \eta_1\cos t_i & \ldots & \eta_1\cos t_{i+2n-1} \\ -\eta_2\sin2t_i & \ldots & -\eta_2\sin2t_{i+2n-1} \\ \eta_2\cos2t_i & \ldots & \eta_2\cos2t_{i+2n-1} \\ \vdots & \vdots & \vdots \\ -\eta_n\sin nt_i & \ldots & -\eta_n\sin nt_{i+2n-1} \\ \eta_n\cos nt_i & \ldots & \eta_n\cos nt_{i+2n-1} \\ \end{array} \right) \left(\begin{array}{*{20}c} \beta_i \\ \beta_{i+1} \\ \vdots \\ \beta_{i+2n-2} \\ \beta_{i+2n-1} \\ \end{array} \right).\\ \end{split} \end{equation} | (4.16) |
Based on the properties of matrix operations, we deduce that
\begin{equation} \left(\begin{array}{*{20}c} -\eta_1\sin t_i & \ldots & -\eta_1\sin t_{i+2n-1} \\ \eta_1\cos t_i & \ldots & \eta_1\cos t_{i+2n-1} \\ -\eta_2\sin2t_i & \ldots & -\eta_2\sin2t_{i+2n-1} \\ \eta_2\cos2t_i & \ldots & \eta_2\cos2t_{i+2n-1} \\ \vdots & \vdots & \vdots \\ -\eta_n\sin nt_i & \ldots & -\eta_n\sin nt_{i+2n-1} \\ \eta_n\cos nt_i & \ldots & \eta_n\cos nt_{i+2n-1} \\ \end{array} \right) \left(\begin{array}{*{20}c} \beta_i \\ \beta_{i+1} \\ \vdots \\ \beta_{i+2n-2} \\ \beta_{i+2n-1} \\ \end{array} \right) = \left(\begin{array}{*{20}c} -\eta_1\sin t_{i+2n} \\ \eta_1\cos t_{i+2n} \\ -\eta_2\sin 2t_{i+2n} \\ \eta_2\cos 2t_{i+2n} \\ \vdots \\ -\eta_n\sin nt_{i+2n} \\ \eta_n\cos nt_{i+2n} \\ \end{array} \right). \end{equation} | (4.17) |
The coefficient matrix of (4.17) is non-zero due to the linear independence of the functions \cos t, \sin t, {\cdots}, \cos nt, \sin nt . According to Cramer's Rule, we have
\begin{aligned} \beta_{i+j-1} = \frac{D\left(t_i, \cdots, t_{i+j-2}, t_{i+2n}, t_{i+j}, \cdots, t_{i+2n-1}\right)}{D\left(t_i, t_{i+1}, \cdots, t_{i+2n-1}\right)}, \text{ for } j = 1, 2, {\cdots}, 2n. \end{aligned} |
We apply this result to Eq (4.11) to yield
\begin{equation*} \begin{aligned} F_{i, 2n}(t) & = \sum\limits_{j = 1}^{2n}\alpha_{i+j-1}G_{i+j-1, 2n}(t)\\ & = \sum\limits_{j = 1}^{2n}\frac{D\left(t_i, \cdots, t_{i+j-2}, t_{i+2n}, t_{i+j}, \cdots, t_{i+2n-1}\right)}{D\left(t_i, t_{i+1}, \cdots, t_{i+2n-1}\right)}G_{i+j-1, 2n}(t)\\ & = \frac{D\left(t_{i+2n}, t_{i+1}, \cdots, t_{i+2n-1}\right)}{D\left(t_i, t_{i+1}, \cdots, t_{i+2n-1}\right)}G_{i, 2n}(t)+\frac{D\left(t_{i}, t_{i+2n}, t_{i+2}, \cdots, t_{i+2n-1}\right)}{D\left(t_i, t_{i+1}, \cdots, t_{i+2n-1}\right)}G_{i+1, 2n}(t)\\ & +{\cdots}+\frac{D\left(t_{i}, {\cdots}, t_{i+2n-2}, t_{i+2n}\right)}{D\left(t_i, t_{i+1}, \cdots, t_{i+2n-1}\right)}G_{i+2n-1, 2n}(t)\\ & = (-1)^{2n-1}\frac{D\left(t_{i+1}, \cdots, t_{i+2n}\right)}{D\left(t_i, t_{i+1}, \cdots, t_{i+2n-1}\right)}G_{i, 2n}(t)+(-1)^{2n-2}\frac{D\left(t_{i}, t_{i+2}, \cdots, t_{i+2n}\right)}{D\left(t_i, t_{i+1}, \cdots, t_{i+2n-1}\right)}G_{i+1, 2n}(t)\\ & +{\cdots}+\frac{D\left(t_{i}, \cdots, t_{i+2n-2}, t_{i+2n}\right)}{D\left(t_i, t_{i+1}, \cdots, t_{i+2n-1}\right)}G_{i+2n-1, 2n}(t) +\frac{D\left(t_{i}, \cdots, t_{i+2n-2}, t_{i+2n-1}\right)}{D\left(t_i, t_{i+1}, \cdots, t_{i+2n-1}\right)}G_{i+2n, 2n}(t)\\ & = {-\frac{1}{D(t_i, t_{i+1}, \cdots, t_{i+2n-1})}}H(t), \ t\in[t_i, t_{i+2n}), \end{aligned} \end{equation*} |
where G_{i+2n, 2n}(t) = 0, t\in[t_i, t_{i+2n}) .
The linear space \Gamma_{2n}[t_i, t_{i+2n}] corresponds to space \mathcal T_{2n} . Similarly, the space \Gamma_{2n+1}[t_i, t_{i+2n+1}] , which corresponds to space \mathcal T_{2n+1} , can be defined as follows:
\begin{array}{l} \Gamma_{2n+1}[t_i, t_{i+2n+1}]: = \{M_{i, 2n+1}(t)\in \Gamma_{2n+1}[{\mathit{\boldsymbol{T}}}]|M_{i, 2n+1}(t) = 0, t\notin [t_i, t_{i+2n+1}]\text{ and }M_{i, 2n+1}(t)\ne0, \\ \quad \quad \quad \quad\quad \quad t\in (t_i, t_{i+2n+1}), \ M^{(l)}_{i, 2n+1}(t_j-) = M^{(l)}_{i, 2n+1}(t_j+), l = 0, 1, {\cdots}, k_{i, 2n+1}^j, \ i\le j\le i+2n+1.\} \end{array} |
We can derive the following theorem analogously.
Theorem 4.4. The dimension of the linear space \Gamma_{2n+1}[t_i, t_{i+2n+1}] is 1 .
The proof is similar to the proof of Theorem 4.2.
Inspired by the method for constructing normalized B-basis in extended Chebyshev space presented in [10], we use the functions F_{i, 2n}(t) , where i\in \mathbb{Z} , to construct the normalized function M_{i, 2n+1}(t) . Therefore, the following theorem holds.
Theorem 4.5. (The normalized function) Suppose that
\begin{equation} M_{i, 2n+1}(t) = \frac{\int_{-{\infty}}^tF_{i, 2n}(s)ds}{\int_{-{\infty}}^{+{\infty}}F_{i, 2n}(t)dt}-\frac{\int_{-{\infty}}^tF_{i+1, 2n}(s)ds}{\int_{-{\infty}}^{+{\infty}}F_{i+1, 2n}(t)dt}, \end{equation} | (4.18) |
where F_{i, 2n}(t)\in\Gamma_{2n}[t_i, t_{i+2n}] and F_{i+1, 2n}(t)\in\Gamma_{2n}[t_{i+1}, t_{i+2n+1}] are defined in Theorem 4.3, with i\in \mathbb{Z} and n\in \mathbb{Z}^{+} . Then we have
\begin{equation*} \sum\limits_{i = -{\infty}}^{+{\infty}}M_{i, 2n+1}(t)\equiv1, \ t \in [t_j, t_{j+1}). \end{equation*} |
Proof. For t \in [t_j, t_{j+1}) , there exists
\begin{equation*} \begin{array}{l} \sum\limits_{i = -{\infty}}^{+{\infty}}M_{i, 2n+1}(t) = \sum\limits_{i = -{\infty}}^{+{\infty}}\left(\frac{\int_{-{\infty}}^tF_{i, 2n}(s)ds}{\int_{-{\infty}}^{+{\infty}}F_{i, 2n}(t)dt}-\frac{\int_{-{\infty}}^tF_{i+1, 2n}(s)ds}{\int_{-{\infty}}^{+{\infty}}F_{i+1, 2n}(t)dt}\right)\\ \quad\quad\quad\quad\quad\; \; = \sum\limits_{i = j-2n}^j\left(\frac{\int_{-{\infty}}^tF_{i, 2n}(s)ds}{\int_{-{\infty}}^{+{\infty}}F_{i, 2n}(t)dt}-\frac{\int_{-{\infty}}^tF_{i+1, 2n}(s)ds}{\int_{-{\infty}}^{+{\infty}}F_{i+1, 2n}(t)dt}\right)\\ \quad\quad\quad\quad\quad\; \; = \sum\limits_{i = j-2n}^j\left(\frac{\int_{t_i}^tF_{i, 2n}(s)ds}{\int_{t_i}^{t_{i+2 n}}F_{i, 2n}(t)dt}-\frac{\int_{t_{i+1}}^t F_{i+1, 2n}(s)ds}{\int_{t_{i+1}}^{t_{i+2 n+1}}F_{i+1, 2n}(t)dt}\right)\\ \quad\quad\quad\quad\quad\; \; = \frac{\int_{t_{j-2n}}^t F_{j-2n, 2n}(s)ds}{\int_{t_{j-2n}}^{t_j}F_{j-2n, 2n(t)}dt}-\frac{\int_{t_{j+1}}^t F_{j+1, 2n}(s)ds}{\int_{t_{j+1}}^{t_{j+2n+1}}F_{j+1, 2n}(t)dt}\\ \quad\quad\quad\quad\quad\; \; = \frac{\int_{t_{j-2n}}^{t_j}F_{j-2n, 2n}(s)ds+\int_{t_j}^tF_{j-2n, 2n}(s)ds}{\int_{t_{j-2n}}^{t_j}F_{j-2n, 2n(t)}dt}-0\\ \quad\quad\quad\quad\quad\; \; = 1+\frac{\int_{t_j}^t F_{j-2n\cdot 2n}(s)ds}{\int_{t_{j-2n}}^{t_j}F_{j-2n\cdot 2n}(t)dt}-0 = 1. \end{array} \end{equation*} |
Lemma 4.6. The function M_{i, 2n+1}(t) in Eq (4.18) lies in the space \Gamma_{2n+1}[t_i, t_{i+2n+1}].
Proof. First, Eq (4.18) indicates that the support interval of the function M_{i, 2n+1}(t) is the union of the interval of F_{i, 2n}(t) and F_{i+1, 2n}(t) , denoted as [t_i, t_{i+2n+1}) .
Second, since the integral operator increases the continuous order by 1, the continuous order of M_{i, 2n+1}(t) at t_j is greater than or equal to
k_{i, 2n}^j+1 = k_{i, 2n+1}^j, i\le j\le i+2n+1. |
So, it is natural that
M_{i, 2n+1}(t)\in\Gamma_{2n+1}[t_i, t_{i+2n+1}]. |
According to Theorem 4.4 and Lemma 4.6, the normalized function M_{i, 2n+1}(t) in Eq (4.18) must be equal to the trigonometric B-spline function N_{i, 2n+1}(t) in Eq (2.5) multiplied by a constant. Therefore, the following theorem is established.
Theorem 4.6. (Integral representation of the normalized trigonometric B-spline basis) Given a knot sequence {\mathit{\boldsymbol{T}}} = \{t_i\}^{+\infty}_{i = -\infty} satisfying
t_i < t_{i+1}, \ 0 < t_{i+2n}-t_i < 2\pi\ and\ 0\le t_{i+2n-1}-t_{i} < \pi, \ i\in \mathbb{Z}, n\in \mathbb{Z}^{+}, |
then there holds
K_{i, 2n+1}(t) = M_{i, 2n+1}(t), \ t\in[t_i, t_{i+2n+1}), |
where K_{i, 2n+1}(t) and M_{i, 2n+1}(t) are separately defined in Definition 3.1 and Eq (4.18).
Proof. We will demonstrate that the expression of M_{i, 2n+1}(t) , as defined in Eq (4.18), is identical to that of K_{i, 2n+1}(t) defined in Definition 3.1. The notations C(t_{i+1}, t_{i+2}, {\cdots}, t_{i+2n}) in Lemma 4.1 and U(t_i, t_{i+1}, {\cdots}, t_{i+2n}) (see [17]) are used in the following proof, where
\begin{equation} \begin{split} U(t_i, t_{i+1}, {\cdots}, t_{i+2n})& = \left| {\begin{array}{*{20}c} 1 & 1 & \ldots & 1 & 1\\ \cos t_i & \cos t_{i+1} & \ldots & \cos t_{i+2n-1} & \cos t_{i+2n} \\ \sin t_i & \sin t_{i+1} & \ldots & \sin t_{i+2n-1} & \sin t_{i+2n}\\ \cos2t_i & \cos2t_{i+1} & \ldots & \cos2t_{i+2n-1} & \cos 2t_{i+2n}\\ \sin2t_i & \sin2t_{i+1} & \ldots & \sin2t_{i+2n-1} & \sin 2t_{i+2n}\\ \vdots & \vdots & \vdots & \vdots & \vdots \\ \cos nt_i & \cos nt_{i+1} & \ldots & \cos nt_{i+2n-1} & \cos nt_{i+2n}\\ \sin nt_i & \sin nt_{i+1} & \ldots & \sin nt_{i+2n-1} & \sin nt_{i+2n}\\ \end{array}}\right|\\ & = 2^{2n^2}\prod\limits_{i\le l < j\le i+2n}\sin \frac{t_{j}-t_{l}}{2}. \end{split} \end{equation} | (4.19) |
Based on Definition 2.1, it suffices to prove the explicit expression of the function M_{i, 2n+1}(t) over a non-zero subinterval within its support interval. Therefore, according to Lemmas 3.1, 4.1, and 4.2, and Theorems 4.3 and 4.5, we deduce that
\begin{equation*} \begin{split} M_{i, 2n+1}(t)& = \frac{\int_{t_i}^tF_{i, 2n}(s)ds}{\int_{t_i}^{t_{i+2n}}F_{i, 2n}(t)dt}\\ & = \frac{D(t_{i+1}, t_{i+2}, {\cdots}, t_{i+2n})}{\frac{(2n-1)!!}{(2n)!!}U(t_i, t_{i+1}, {\cdots}, t_{i+2n})}\sin ^{2n}\left(\frac{t-t_i}{2}\right) \\ & = \frac{\frac{2^{2n^2-n}}{n!}\prod\limits_{i+1\le l < j\le i+2n}\sin \frac{t_{j}-t_{l}}{2}C(t_{i+1}, t_{i+2}, {\cdots}, t_{i+2n})}{\frac{(2n-1)!!}{(2n)!!}2^{2n^2}\prod\limits_{i\le l < j\le i+2n}\sin \frac{t_{j}-t_{l}}{2}}\sin ^{2n}\left(\frac{t-t_i}{2}\right)\\ & = \frac{C(t_{i+1}, t_{i+2}, {\cdots}, t_{i+2n})}{(2n-1)!!\prod\limits_{j = 1, 2, {\cdots}, 2n}\sin \frac{t_{i+j}-t_i}{2}}\sin ^{2n}\left(\frac{t-t_i}{2}\right)\\ & = \frac{C_{i, 2n+1}}{\prod\limits_{j = 1, 2, {\cdots}, 2n}\sin \frac{t_{i+j}-t_i}{2}}\sin ^{2n}\left(\frac{t-t_i}{2}\right), \ t\in[t_i, t_{i+1}). \end{split} \end{equation*} |
Since
N_{i, 2n+1}(t) = \frac{\sin ^{2n}\left(\frac{t-t_i}{2}\right)}{\prod\limits_{j = 1, 2, {\cdots}, 2n}\sin \frac{t_{i+j}-t_i}{2}}, \ t\in[t_i, t_{i+1}), |
we have
M_{i, 2n+1}(t) = C_{i, 2n+1}N_{i, 2n+1}(t), \ t\in[t_i, t_{i+1}), |
consequently
M_{i, 2n+1}(t) = C_{i, 2n+1}N_{i, 2n+1}(t) = K_{i, 2n+1}(t), \ t\in[t_i, t_{i+2n+1}). |
In this subsection, we consider multiple knots and assume that the multiplicity of the knot t_i in the interval [t_i, t_{i+2n}) is \xi , while the multiplicity of the knot t_{i+2n} in the same interval is \eta . Similarly to the single knot case, there exist the following theorems.
Theorem 4.7. (The function expression in the space \Gamma_{2n}[t_i, t_{i+2n}] over multiple knots) Let
A_{u, v} = \left(\begin{array}{*{20}c} (\cos (t+\frac{\pi}{2}u)) \bigg|_{t = t_v}, \ (\sin (t+\frac{\pi}{2}u)) \bigg|_{t = t_v}, \ \cdots, n^{u}(\cos (nt+\frac{\pi}{2}u)) \bigg|_{t = t_v}, \ n^{u}(\sin (nt+\frac{\pi}{2}u)) \bigg|_{t = t_v}\ \end{array}\right)^{\mathbf T}, |
B_{u, v} = \left(\begin{array}{*{20}c} (-1)^{u-1}A_{u-1, v}, \ (-1)^{u-2}A_{u-2, v}, \ \cdots, (-1)^{1}A_{1, v}, \ (-1)^{0}A_{0, v}\ \end{array}\right), |
E_{u, v} = \left(\begin{array}{*{20}c} G^{(u-1)}_{v, 2n}(t), \ G^{(u-2)}_{v, 2n}(t), \ \cdots, G^\prime_{v, 2n}(t), \ G_{v, 2n}(t)\ \end{array}\right). |
For any function F_{i, 2n}(t)\in\Gamma_{2n}[t_i, t_{i+2n}] , there exists a real number \alpha such that
\begin{equation*} F_{i, 2n}(t) = \alpha H(t), t\in[t_i, t_{i+2n}), \end{equation*} |
where
\alpha = \frac{(-1)^{{\eta}}}{\left| \begin{array}{*{20}c} B_{\xi, i}&B_{m_{i+\xi}, i+\xi}&B_{m_{i+\xi+m_{i+\xi}}, i+\xi+m_{i+\xi}}&\cdots&B_{m_{i+2n-\eta}, i+2n-\eta}& B_{\eta-1, i+2n}\\ \end{array} \right|}, |
and
\begin{equation*} H(t) = \left| \begin{array}{*{20}c} E_{\xi, i}&E_{m_{i+\xi}, i+\xi}&E_{m_{i+\xi+m_{i+\xi}}, i+\xi+m_{i+\xi}}&\cdots&E_{m_{i+2n-\eta}, i+2n-\eta}& E_{\eta, i+2n}\\ B_{\xi, i}&B_{m_{i+\xi}, i+\xi}&B_{m_{i+\xi+m_{i+\xi}}, i+\xi+m_{i+\xi}}&\cdots&B_{m_{i+2n-\eta}, i+2n-\eta}& B_{\eta, i+2n}\\ \end{array} \right|. \end{equation*} |
Here the functions G_{j, 2n}(t) for i\le j\le i+2n are defined in Eq (4.4).
Proof. To simplify the notation, we define
\varphi_{u, v} = \left(\sin{({\mit t}-{{\mit t}_{v})}}\sin^{2n-2}\left(\frac{{\mit t}-t_{v}}{2}\right)\right)^{(u)}. |
Thus, we conclude that
\begin{equation} \begin{split} \varphi_{\eta-1, i+2n} = & \beta_i \varphi_{\xi-1, i} + \beta_{i+1} \varphi_{\xi-2, i} + \cdots + \beta_{i+\xi-1} \varphi_{0, i} + \beta_{i+\xi} \varphi_{m_{i+\xi}-1, i+\xi} + \cdots+ \beta_{i+\xi+m_{i+\xi}-1} \varphi_{0, i+\xi} \\ & + \cdots + \beta_{i+2n+1-\eta-m_{i+2n-\eta}} \varphi_{m_{i+2n-\eta}-1, i+2n-\eta} + \cdots + \beta_{i+2n-\eta} \varphi_{0, i+2n-\eta}\\ & +\beta_{i+2n-\eta+1} \varphi_{0, i+2n} + \cdots + \beta_{i+2n-1} \varphi_{\eta-2, i+2n}. \end{split} \end{equation} | (4.20) |
Similar to Theorem 4.3, there exist
\begin{equation} F_{i, 2n}(t) = \sum\limits_{j = i}^{i+2n-\eta}\alpha_jG_{j, 2n}(t), t\in[t_i, t_{i+2n}) = [t_i, t_{i+2n+1-\eta}), \end{equation} | (4.21) |
\begin{equation} F^{(d)}_{i, 2n}(t_{i+2n}) = \sum\limits_{j = i}^{i+2n-\eta}\alpha_jG^{(d)}_{j, 2n}(t_{i+2n}) = 0, t\in[t_i, t_{i+2n+1-\eta}), d = 0, 1, 2, {\cdots}, 2n-1-\eta. \end{equation} | (4.22) |
Additionally, it follows that Eq (4.20) is equivalent to Eq (4.22) when t = t_{i+2n} . Thus, by applying the proof strategy from Theorem 4.3, we derive that
F_{i, 2n}(t) = (-1)^{\eta}\frac{\left| \begin{array}{*{20}c} E_{\xi, i}&E_{m_{i+\xi}, i+\xi}&E_{m_{i+\xi+m_{i+\xi}}, i+\xi+m_{i+\xi}}&\cdots&E_{m_{i+2n-\eta}, i+2n-\eta}& E_{\eta, i+2n}\\ B_{\xi, i}&B_{m_{i+\xi}, i+\xi}&B_{m_{i+\xi+m_{i+\xi}}, i+\xi+m_{i+\xi}}&\cdots&B_{m_{i+2n-\eta}, i+2n-\eta}& B_{\eta, i+2n}\\ \end{array} \right|}{\left| \begin{array}{*{20}c} B_{\xi, i}&B_{m_{i+\xi}, i+\xi}&B_{m_{i+\xi+m_{i+\xi}}, i+\xi+m_{i+\xi}}&\cdots&B_{m_{i+2n-\eta}, i+2n-\eta}& B_{\eta-1, i+2n} \end{array} \right|}. |
Theorem 4.8. (The normalized function over generalized knots) Suppose that Eq (4.18) still holds, where F_{i, 2n}(t)\in\Gamma_{2n}[t_i, t_{i+2n}] and F_{i+1, 2n}(t)\in\Gamma_{2n}[t_{i+1}, t_{i+2n+1}] are defined in Theorem 4.7, with i\in \mathbb{Z} and n\in \mathbb{Z}^{+}, then
\begin{equation*} \sum\limits_{i = -{\infty}}^{+{\infty}}M_{i, 2n+1}(t)\equiv1, \ t \in [t_j, t_{j+1}). \end{equation*} |
In addition, when F_{i, 2n}(t) = 0 , we set
\int_{-\infty}^{t} \left(\int_{-{\infty}}^{+{\infty}}F_{i, 2n}(s)ds\right)^{-1} F_{i, 2n}(s) \, ds = \begin{cases} 0 & t < t_i, \\ 1 & t \geq t_i. \end{cases} |
Theorem 4.9. (Integral representation of the normalized trigonometric B-spline basis over generalized knots) Given a knot sequence {\mathit{\boldsymbol{T}}} = \{t_i\}^{+\infty}_{i = -\infty} satisfying condition (3.4), then there holds
K_{i, 2n+1}(t) = M_{i, 2n+1}(t), \ t\in[t_i, t_{i+2n+1}), |
where K_{i, 2n+1}(t) and M_{i, 2n+1}(t) are separately defined in Definition 3.1 and Theorem 4.8.
This subsection presents examples of curve modeling to demonstrate that a curve possesses the convex hull property when the knot sequence satisfies condition (3.4).
Figures 3 and 4 illustrate examples of open and closed curves over different knot sequences, respectively. The red curves correspond to the knot sequences that satisfy condition (3.4) as defined in Definition 3.1, while the orange curves correspond to the knot sequences that satisfy condition (2.1) as defined in Definition 2.1. Additionally, the knot sequences in Figure 3 are {\mathit{\boldsymbol{T}}} = \{0, 2, 3, 3, 3.5, 5.3, 6.1, 6.6, 8.4, 9.1, 9.5, 11.2, 12.2, 12.6, 14.2, 15\} , and {\mathit{\boldsymbol{T}}} = \{0, 0.8, 3, 3, 3.5, 5.3, 6.6, 8.6, 9.1, 9.1, 10, 12.2, 12.2, 13, 14.2, 15\} , while those in Figure 4 are {\mathit{\boldsymbol{T}}} = \{-8, -8, -8, -8, -8, -7, -6.3, -5.6, -4.9, -4.5, -1.2, -1.2, -1.2, 0, 1.2, 1.2, 1.2, 4.5, 4.9, 5.6, 6.3, 7, 8, 8, 8, 8, 8\} , and {\mathit{\boldsymbol{T}}} = \{-8, -8, -8, -8, -8, -7, -6.3, -5.3, -4, -3.3, -1.2, -1.2, -1.2, 0, 1.2, 1.2, 1.2, 3.3, 4, 5.3, 6.3, 7, 8, 8, 8, 8, 8\} . Clearly, if the knot sequence only satisfies condition (2.1), the convex hull property of the curve cannot be guaranteed.
In the Chebyshev system, due to the integral properties of sine and cosine in the trigonometric B-spline basis, the trigonometric B-spline basis cannot be directly derived from lower-order bases through integration, which leads to an unnormal Chebyshev system. This paper successfully derives the integral formula for the normalized odd-order trigonometric B-spline basis by constructing a new set of even-order trigonometric B-spline bases. This integral formula allows for the transition from even-order to odd-order bases but cannot be obtained through stepwise integration, indicating that it is only similar to a segment of the integral formula in the Chebyshev system. Although we are currently unable to provide a direct recursive formula for integrating from lower-order trigonometric spline bases to higher-order ones, we hope to use this as a foundation for further exploration of this issue in future work.
Mei Li: Investigation, methodology, software, validation, writing—original draft preparation, writing—review and editing; Wanqiang Shen: Conceptualization, methodology, software, writing—original draft preparation, writing—review and editing. All authors have read and approved the final version of the manuscript for publication.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This research is supported in part by the National Natural Science Foundation of China (Grant No. 61772013).
The authors declare that there are no conflicts of interest regarding the publication of this paper.
[1] | K. E. Atkinson, An introduction to numerical analysis, John Wiley & Sons, 1989. |
[2] |
R. B. Albadarneh, M. Zerqat, I. M. Batiha, Numerical solutions for linear and non-linear fractional differential equations, Int. J. Pure App. Math., 106 (2016): 859–871. doi: 10.12732/ijpam.v106i3.12. doi: 10.12732/ijpam.v106i3.12
![]() |
[3] |
M. Barton, V. M. Calo, Optimal quadrature rules for odd-degree spline spaces and their application to tensor-product-based isogeometric analysis, Comput. Method. Appl. M., 305 (2016), 217–240. doi: 10.1016/j.cma.2016.02.034. doi: 10.1016/j.cma.2016.02.034
![]() |
[4] |
M. Barton, R. Ait-Haddou, V. M. Calo, Gaussian quadrature rules for C1 quintic splines with uniform knot vectors, J. Comput. Appl. Math., 322 (2017), 57–70. doi:10.1016/j.cam.2017.02.022. doi: 10.1016/j.cam.2017.02.022
![]() |
[5] |
M. Barton, V. M. Calo, Gauss-Galerkin quadrature rules for quadratic and cubic spline spaces and their application to isogeometric analysis, Comput. Aided Des., 82 (2017), 57–67. doi:10.1016/j.cad.2016.07.003. doi: 10.1016/j.cad.2016.07.003
![]() |
[6] |
S. Bu, W. Jung, P. Kim, An error embedded Runge-Kutta method for initial value problems, Kyungpook Math. J., 56 (2016), 311–327. doi:10.5666/KMJ.2016.56.2.311. doi: 10.5666/KMJ.2016.56.2.311
![]() |
[7] |
J. Y. Cao, C. J. Xu, A high order schema for the numerical solution of the fractional ordinary differential equation, J. Comput. Phys., 238 (2013), 154–168. doi:10.1016/j.jcp.2012.12.013. doi: 10.1016/j.jcp.2012.12.013
![]() |
[8] |
K. Diethelm, Efficient solution of multi-term fractional differential equations using P(EC)mE methods, Computing, 71 (2003), 305–-319. doi:10.1007/s00607-003-0033-3. doi: 10.1007/s00607-003-0033-3
![]() |
[9] |
K. Diethelm, An investigation of some nonclassical methods for the numerical approximation of Caputo-type fractional derivatives, Numer. Algor., 47 (2008), 361–390. doi:10.1007/s11075-008-9193-8. doi: 10.1007/s11075-008-9193-8
![]() |
[10] | K. Diethelm, The analysis of fractional differential equations: An application-oriented exposition using differential operators of Caputo type, Springer Science & Business Media, 2010. |
[11] |
K. Diethelm, N. J. Ford, A. D. Freed, A predictor-corrector approach for the numerical solution of fractional differential equations, Nonlinear Dynam., 29 (2002), 3–22. doi:10.1023/A:1016592219341. doi: 10.1023/A:1016592219341
![]() |
[12] |
K. Diethelm, N. J. Ford, A. D. Freed, Detailed error analysis for a fractional Adams method, Numer. Algor., 36 (2004), 31–52. doi:10.1023/B:NUMA.0000027736.85078.be. doi: 10.1023/B:NUMA.0000027736.85078.be
![]() |
[13] |
W. Deng, Smoothness and stability of the solutions for nonlinear fractional differential equations, Nonlinear Anal. Theor., 72 2010, 1768–1777. doi:10.1016/j.na.2009.09.018. doi: 10.1016/j.na.2009.09.018
![]() |
[14] |
W. Deng, S. Du, Y. Wu, High order finite difference WENO schemes for fractional differential equations, Appl. Math. Lett., 26 (2012), 362–366. doi:10.1016/j.aml.2012.10.005. doi: 10.1016/j.aml.2012.10.005
![]() |
[15] |
N. Ford, M. Morgado, M. Rebelo, Nonpolynomial collocation approximation of solutions to fractional differential equations, Frac. Calc. Appl. Anal., 16 (2013), 874–891. doi:10.2478/s13540-013-0054-3. doi: 10.2478/s13540-013-0054-3
![]() |
[16] | C. W. Gear, Numerical initial value problems in ordinary differential equations, Prentice-Hall, 1971. |
[17] |
R. Hiemstra, F. Calabro, D. Schillinger, T. J. R. Hughes, Optimal and reduced quadrature rules for tensor product and hierarchically refined splines in isogeometric analysis, Comput. Method. Appl. M., 316 (2017), 966–1004. doi:10.1016/j.cma.2016.10.049. doi: 10.1016/j.cma.2016.10.049
![]() |
[18] | E. Hairer, S. P. Norsett, G. Wanner, Solving ordinary differential equations. I nonstiff, Springer, 1993. |
[19] |
T. J. R. Hughes, A. Reali, G. Sangalli, Efficient quadrature for NURBS-based isogeometric analysis, Comput. Method. Appl. M., 199 (2010), 301–313. doi:10.1016/j.cma.2008.12.004. doi: 10.1016/j.cma.2008.12.004
![]() |
[20] |
Y. Jeon, S. Bak, S. Bu, Reinterpretation of multi-Stage methods for stiff systems: A comprehensive review on current perspectives and recommendations, Mathematics, 7 (2019), 1158. doi:10.3390/math7121158. doi: 10.3390/math7121158
![]() |
[21] |
P. Kumar, O. P. Agrawal, An approximate method for numerical solution of fractional differential equations, Signal Process., 86 (2006), 2602–2610. doi:10.1016/j.sigpro.2006.02.007. doi: 10.1016/j.sigpro.2006.02.007
![]() |
[22] |
S. Khatoon, I. Uddin, D. Baleanu, Approximation of fixed point and its application to fractional differential equation, J. Appl. Math. Comput., 66 (2021), 507–525. doi:10.1007/s12190-020-01445-1. doi: 10.1007/s12190-020-01445-1
![]() |
[23] |
C. Lv, M. Azaiez, C. Xu, Spectral deferred correction methods for fractional differential equations, Numer. Math. Theor. Meth. Appl., 11 (2018), 729–751. doi: 10.4208/nmtma.2018.s03. doi: 10.4208/nmtma.2018.s03
![]() |
[24] | G. Nikolov, Gaussian quadrature formulae for splines, In: ISNM International Series of Numerical Mathematics, Basel: Birkhäuser, 1993. |
[25] | I. Podlubny, Numerical solution of ordinary fractional differential equations by the fractional difference method, In: Proceedings of the Second International Conference on Difference Equations, 1997. |
[26] | I. Podlubny, Fractional differential equations, San Diego: Academic Press, 1999. |
[27] |
M. Rehman, A. Idrees, U. Saeed, A quadrature method for numerical solutions of fractional differential equations, Appl. Math. Comput., 307 (2017), 38–49. doi:10.1016/j.amc.2017.02.053. doi: 10.1016/j.amc.2017.02.053
![]() |
[28] |
M. F. Simões Patrício, H. Ramos, M. Patrício, Solving initial and boundary value problems of fractional ordinary differential equations by using collocation and fractional powers, J. Comput. Appl. Math., 354 (2019), 348–359. doi:10.1016/j.cam.2018.07.034. doi: 10.1016/j.cam.2018.07.034
![]() |
[29] |
J. Xin, J. Huang, W. Zhao, J. Zhu, A spectral deferred correction method for fractional differential equations, Abstr. Appl. Anal., 2013 (2013), 139530. doi:10.1155/2013/139530. doi: 10.1155/2013/139530
![]() |
[30] |
Y. Yan, K. Pal, N. Ford, Higher order numerical methods for solving fractional differential equations, Bit Numer. Mathe., 54 (2014), 555–584. doi:10.1007/s10543-013-0443-3. doi: 10.1007/s10543-013-0443-3
![]() |
[31] |
J. Zhao, Y. Li, Y. Xu, A kind of product integration scheme for solving fractional ordinary differential equations, Appl. Numer. Math., 136 (2019), 279–292. doi:10.1016/j.apnum.2018.10.014. doi: 10.1016/j.apnum.2018.10.014
![]() |
[32] |
Y. Zhong, X. B. Bao, L. B. Liu, Z. F. Liang, Analysis of a finite difference scheme for a nonlinear Caputo fractional differential equation on an adaptive grid, AIMS Mathematics, 6 (2021), 8611–8624. doi:10.3934/math.2021500. doi: 10.3934/math.2021500
![]() |