Numerical Solution of Direct and Inverse Problems for Time-Dependent Volterra Integro-Differential Equation Using Finite Integration Method with Shifted Chebyshev Polynomials

In this article, the direct and inverse problems for the one-dimensional time-dependent Volterra integro-differential equation involving two integration terms of the unknown function (i.e., with respect to time and space) are considered. In order to acquire accurate numerical results, we apply the f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Symmetry (Basel) 2020-04, Vol.12 (4), p.497
Hauptverfasser: Boonklurb, Ratinan, Duangpan, Ampol, Gugaew, Phansphitcha
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this article, the direct and inverse problems for the one-dimensional time-dependent Volterra integro-differential equation involving two integration terms of the unknown function (i.e., with respect to time and space) are considered. In order to acquire accurate numerical results, we apply the finite integration method based on shifted Chebyshev polynomials (FIM-SCP) to handle the spatial variable. These shifted Chebyshev polynomials are symmetric (either with respect to the point x = L 2 or the vertical line x = L 2 depending on their degree) over [ 0 , L ] , and their zeros in the interval are distributed symmetrically. We use these zeros to construct the main tool of FIM-SCP: the Chebyshev integration matrix. The forward difference quotient is used to deal with the temporal variable. Then, we obtain efficient numerical algorithms for solving both the direct and inverse problems. However, the ill-posedness of the inverse problem causes instability in the solution and, so, the Tikhonov regularization method is utilized to stabilize the solution. Furthermore, several direct and inverse numerical experiments are illustrated. Evidently, our proposed algorithms for both the direct and inverse problems give a highly accurate result with low computational cost, due to the small number of iterations and discretization.
ISSN:2073-8994
2073-8994
DOI:10.3390/sym12040497