Numerical algorithm to solve generalized fractional pantograph equations with variable coefficients based on shifted Chebyshev polynomials. Issue 12 (2nd December 2019)

• Record Type: Journal Article
• Authors: Wang, Li-Ping; Chen, Yi-Ming; Liu, Da-Yan; Boutat, Driss
• Is Part Of: International journal of computer mathematics. Volume 96:Issue 12(2019)
• Page Start: 2487
• Page End: 2510
• Publication Date: 2019-12-02
• Subjects: Shifted Chebyshev polynomials -- operational matrix -- generalized fractional pantograph equations -- numerical solution -- error analysis; 34A08 -- 42C05 -- 41A10 -- 41A35 -- 34K28; Computers -- Periodicals; Numerical analysis -- Periodicals; Automation -- Periodicals; 004.0151
• DOI: 10.1080/00207160.2019.1573992
• Languages: English
• ISSNs: 0020-7160

Abstract

ABSTRACT: In this paper, an efficient numerical technique based on the shifted Chebyshev polynomials (SCPs) is established to obtain numerical solutions of generalized fractional pantograph equations with variable coefficients. These polynomials are orthogonal and have compact support on 0, L . We use these polynomials to approximate unknown solutions. Using the properties of the SCPs, we derive the generalized pantograph operational matrix of SCPs and the one of fractional-order differentiation. Then, based on these matrices the original problem is transformed into a system of algebraic equations. By solving these algebraic equations, we can obtain numerical solutions. In addition, we investigate the error analysis and introduce the process of error correction for improving the precision of numerical solutions. Lastly, by giving some examples and comparing with other existing methods, the validity and efficiency of our method are demonstrated.