chelyshkov polynomials
Recently Published Documents


TOTAL DOCUMENTS

5
(FIVE YEARS 4)

H-INDEX

1
(FIVE YEARS 0)

2022 ◽  
Vol 40 ◽  
pp. 1-13
Author(s):  
Fakhrodin Mohammadi ◽  
Hossein Hassani

‎In this article‎, ‎an efficient numerical method based on a new class of orthogonal polynomials‎, ‎namely Chelyshkov polynomials‎, ‎has been presented to approximate solution of time-fractional telegraph (TFT) equations‎. ‎The fractional operational matrix of the Chelyshkov polynomials along with the typical collocation method is used to reduces TFT equations to a system of algebraic equations‎. ‎The error analysis of the proposed collocation method is also investigated‎. ‎A comparison with other published results confirms that the presented Chelyshkov collocation approach is efficient and accurate for solving TFT equations‎. ‎Illustrative examples are included to demonstrate the efficiency of the Chelyshkov method‎.


2021 ◽  
Vol 40 (4) ◽  
Author(s):  
Leila Moradi ◽  
Dajana Conte ◽  
Eslam Farsimadan ◽  
Francesco Palmieri ◽  
Beatrice Paternoster

AbstractThis work presents a novel formulation for the numerical solution of optimal control problems related to nonlinear Volterra fractional integral equations systems. A spectral approach is implemented based on the new polynomials known as Chelyshkov polynomials. First, the properties of these polynomials are studied to solve the aforementioned problems. The operational matrices and the Galerkin method are used to discretize the continuous optimal control problems. Thereafter, some necessary conditions are defined according to which the optimal solutions of discrete problems converge to the optimal solution of the continuous ones. The applicability of the proposed approach has been illustrated through several examples. In addition, a comparison is made with other methods for showing the accuracy of the proposed one, resulting also in an improved efficiency.


Fractals ◽  
2020 ◽  
Vol 28 (08) ◽  
pp. 2040042
Author(s):  
M. HOSSEININIA ◽  
M. H. HEYDARI ◽  
Z. AVAZZADEH

This paper develops an effective semi-discrete method based on the 2D Chelyshkov polynomials (CPs) to provide an approximate solution of the fractal–fractional nonlinear Emden–Fowler equation. In this model, the fractal–fractional derivative in the concept of Atangana–Riemann–Liouville is considered. The proposed algorithm first discretizes the fractal–fractional differentiation by using the finite difference formula in the time direction. Then, it simplifies the original equation to the recurrent equations by expanding the unknown solution in terms of the 2D CPs and using the [Formula: see text]-weighted finite difference scheme. The differentiation operational matrices and the collocation method play an important role to obtaining a linear system of algebraic equations. Last, solving the obtained system provides an approximate solution in each time step. The validity of the formulated method is investigated through a sufficient number of test problems.


Sign in / Sign up

Export Citation Format

Share Document