z-logo
Premium
A steady barycentric Lagrange interpolation method for the 2D higher‐order time‐fractional telegraph equation with nonlocal boundary condition with error analysis
Author(s) -
Yi ShiChao,
Yao LinQuan
Publication year - 2019
Publication title -
numerical methods for partial differential equations
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.901
H-Index - 61
eISSN - 1098-2426
pISSN - 0749-159X
DOI - 10.1002/num.22371
Subject(s) - barycentric coordinate system , mathematics , lagrange polynomial , interpolation (computer graphics) , mathematical analysis , convergence (economics) , rate of convergence , boundary (topology) , geometry , polynomial , computer science , animation , channel (broadcasting) , computer graphics (images) , economics , economic growth , computer network
In this paper, we consider the numerical solution of the time‐fractional telegraph equation with a nonlocal boundary condition. A novel barycentric Lagrange interpolation collocation method is developed to solve this equation. Two difficulties have been sorted: the singularity of the integration and the higher accuracy. At the same, we put forward a steady barycentric Lagrange interpolation technique to overcome the new “Runge” phenomenon in computation. Error estimates of the barycentric Lagrange interpolation and the time‐fractional telegraph system for the present method are presented in Sobolev spaces. High convergence rates of the proposed method are obtained and are consisted with the numerical values. Especially in the time dimension, we get the error bound, O h n t − 2for h ‐refinement and Oeh t / 2n t − 2n t − 2for n t ‐density in the L 2 norms. The numerical results obtained show that the proposed numerical algorithm is accurate and computationally efficient for solving time‐fractional telegraph equation. Experiments demonstrate the high convergence rates of the proposed method are consisted with the theoretical values.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here