ARTICLE
TITLE

Approximate solution of generalized pantograph equations with variable coefficients by operational method

SUMMARY

In this paper, we present efficient direct solver for solving the generalized pantographequations with variable coefficients. The approach is based on the second kind Chebyshev polynomialstogether with operational method. The main characteristic behind this approach is that it reducessuch problem to ones of solving systems of algebraic equations. Only a small number of Chebyshevpolynomials are needed to obtain a satisfactory result. Numerical results with comparisons are givento confirm the reliability of the proposed method for solving generalized pantograph equations with variable coefficients.

 Articles related

Ozgur Yildirim    

In this paper, third and fourth order of accuracy stable difference schemes for approximately solving multipoint nonlocal boundary value problems for hyperbolic equations with the Neumann boundary conditions are considered. Stability estimates for the so... see more


Shrishail Ramappa Gani,Shreedevi Veerabhadrappa Halawar    

The present study considered the optimal control analysis of  both deterministic differential equation modeling and stochastic differential equation modeling of infectious disease by taking effects of media awareness programs  and treatment of ... see more


Aydin Secer    

In this work, we consider the hyperbolic equations to determine the approximate solutions via Sinc-Galerkin Method (SGM). Without any numerical integration, the partial differential equation transformed to an algebraic equation system. For the numerical ... see more


Nilay Akgonullu Pirim,Fatma Ayaz    

This paper focuses on the approximate solutions of the higher order fractional differential equations with multi terms by the help of Hermite Collocation method (HCM). This new method is an adaptation of Taylor's collocation method in terms of truncated ... see more


Binayak S. Choudhury,Pranati Maity,P. Konar    

In this paper we prove two proximity point results for finding the distance between two sets. Unlike the best approximation theorems they provide with globally optimal values. Here our approach is to reduce the problem to that of finding optima... see more