Skip to main navigation Skip to search Skip to main content

Collocation methods for general Riemann-Liouville two-point boundary value problems

  • Hui Liang
  • , Martin Stynes*
  • *Corresponding author for this work
  • Shenzhen University
  • China Academy of Engineering Physics

Research output: Contribution to journalArticlepeer-review

Abstract

General Riemann-Liouville linear two-point boundary value problems of order α p , where n − 1 < α p < n for some positive integer n, are investigated on the interval [0,b]. It is shown first that the natural degree of regularity to impose on the solution y of the problem is y∈ C n 2 [0 , b] and Dαp−1y∈C[0,b], with further restrictions on the behavior of the derivatives of y (n− 2) (these regularity conditions differ significantly from the natural regularity conditions in the corresponding Caputo problem). From this regularity, it is deduced that the most general choice of boundary conditions possible is y(0) = y (0) = … = y ( n 2 ) (0) = 0 and ∑j=0n1βjy(j)(b1)=γ for some constants β j and γ, with b 1 ∈ (0,b] and n 1 ∈ { 0 , 1 , … , n− 1 }. A wide class of transformations of the problem into weakly singular Volterra integral equations (VIEs) is then investigated; the aim is to choose the transformation that will yield the most accurate results when the VIE is solved using a collocation method with piecewise polynomials. Error estimates are derived for this method and for its iterated variant. Numerical results are given to support the theoretical conclusions.

Original languageEnglish
Pages (from-to)897-928
Number of pages32
JournalAdvances in Computational Mathematics
Volume45
Issue number2
DOIs
StatePublished - 2 Apr 2019
Externally publishedYes

Keywords

  • Collocation methods
  • Fractional derivative
  • Riemann-Liouville derivative
  • Two-point boundary value problem
  • Volterra integral equation

Fingerprint

Dive into the research topics of 'Collocation methods for general Riemann-Liouville two-point boundary value problems'. Together they form a unique fingerprint.

Cite this