Computational Scheme for the First-Order Linear Integro-Differential Equations Based on the Shifted Legendre Spectral Collocation Method

First-order linear Integro-Differential Equations (IDEs) has a major importance in modeling of some phenomena in sciences and engineering. The numerical solution for the first-order linear IDEs is usually obtained by the finite-differences methods. However, the convergence rate of the finite-differences method is limited by the order of the differences in (Formula presented.) space. Therefore, how to design a computational scheme for the first-order linear IDEs with computational efficiency becomes an urgent problem to be solved. To this end, a polynomial approximation scheme based on the shifted Legendre spectral collocation method is proposed in this paper. First, we transform the first-order linear IDEs into an Cauchy problem for consideration. Second, by decomposing the system operator, we rewrite the Cauchy problem into a more general form for approximating. Then, by using the shifted Legendre spectral collocation method, we construct a computational scheme and write it into an abstract version. The convergence of the scheme is proven in the sense of (Formula presented.) -norm by employing Trotter-Kato theorem. At the end of this paper, we summarize the usage of the scheme into an algorithm and present some numerical examples to show the applications of the algorithm.