Numerical algorithm to solve generalized fractional pantograph equations with variable coefficients based on shifted Chebyshev polynomials
Résumé
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 polynomi-als to approximate the unknown function. Using the properties of the SCPs, we derive the generalized pantograph operational matrix of SCPs and the one of fractional-order differentiation. Then the original problems can be transformed to a system of algebraic equations based on these matrices. 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 is demonstrated.
Fichier principal
Numerical algorithm to solve generalized fractional pantograph equations with variable coefficients based on shifted Chebyshev polynomials.pdf (369.45 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|