DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/19509
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSantra, Sudarshan-
dc.date.accessioned2025-09-22T11:13:35Z-
dc.date.available2025-09-22T11:13:35Z-
dc.date.issued2022-06-
dc.identifier.urihttps://www.tandfonline.com/doi/full/10.1080/02286203.2022.2085976-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/19509-
dc.description.abstractThe main aim of this paper is to construct an efficient recursive algorithm to solve a time-space fractional Poisson’s equation which can be treated as a time-space fractional diffusion equation in two dimensions. The fractional derivatives in both time and space are defined in the Caputo sense. A homotopy perturbation method is introduced to approximate the solution, and a comparison is made between the exact and the approximate solutions. In addition, we present a procedure for solving higher-order fractional Poisson’s equations. In this case, the equation is converted to a system of fractional differential equations in which the order of the time derivatives is less than or equal to one. The convergence analysis is carried out, and an apriori bound of the solution is obtained for the present problem. Numerical examples are provided and the experimental evidence proves the effectiveness of the proposed method.en_US
dc.language.isoenen_US
dc.publisherTaylor & Francisen_US
dc.subjectMathematicsen_US
dc.subjectFractional poisson’s equationen_US
dc.subjectCaputo derivativeen_US
dc.subjectSystem of FDEen_US
dc.subjectMittag-Leffler functionen_US
dc.subjectHomotopy perturbationen_US
dc.titleAn efficient computational approach for the solution of time-space fractional diffusion equationen_US
dc.typeArticleen_US
Appears in Collections:Department of Mathematics

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.