A fast numerical method for fractional partial integro-differential equations with spatial-time delays

dc.contributor.authorAslan E.
dc.contributor.authorKürkçü Ö.K.
dc.contributor.authorSezer M.
dc.date.accessioned2024-07-22T08:06:14Z
dc.date.available2024-07-22T08:06:14Z
dc.date.issued2021
dc.description.abstractThis study aims to efficiently solve the space-time fractional partial integro-differential equations with spatial-time delays, employing a fast numerical methodology dependent upon the matching polynomial of complete graph and matrix-collocation procedure. This methodology provides a sustainable approach for each computation limit since it arises from the durable graph structure of complete graph and fractional matrix relations. The convergence analysis is established using the residual function of mean value theorem for double integrals. An error estimation is also implemented. All computations are performed with the aid of a unique computer program, which returns the desired results in seconds. Some specific numerical problems are tested to discuss the applicability of the method in tables and figures. It is stated that the method stands for fast, simple and highly accurate computation. © 2020 IMACS
dc.identifier.DOI-ID10.1016/j.apnum.2020.12.007
dc.identifier.issn01689274
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/13438
dc.language.isoEnglish
dc.publisherElsevier B.V.
dc.subjectComputation theory
dc.subjectGraph structures
dc.subjectGraph theory
dc.subjectIntegrodifferential equations
dc.subjectMatrix algebra
dc.subjectTime delay
dc.subjectConvergence analysis
dc.subjectDouble integrals
dc.subjectMatching polynomial
dc.subjectMean value theorem
dc.subjectNumerical methodologies
dc.subjectNumerical problems
dc.subjectPartial integro-differential equations
dc.subjectResidual functions
dc.subjectNumerical methods
dc.titleA fast numerical method for fractional partial integro-differential equations with spatial-time delays
dc.typeArticle

Files