DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/17618
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Rajesh-
dc.date.accessioned2025-02-12T10:03:10Z-
dc.date.available2025-02-12T10:03:10Z-
dc.date.issued2023-06-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0378475423000575-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/17618-
dc.description.abstractThe objectives of this article are to deal with computing the series solutions of 1D dimensionless Burgers’ equation using the optimized decomposition method (ODM) and the extension of ODM to the system of PDEs which aids in dealing with multi-dimensional Burgers’ equation. Several examples of the inviscid and viscous 1D Burgers’ equations are considered to demonstrate the implementation of the scheme. In this case, it is shown that ODM provides better estimates than the existing Adomian decomposition method (ADM). Owing to the advantage of ODM over ADM, the extension of ODM is used to calculate the semi-analytical approximate solutions of the dimensionless 2D and 3D Burgers’ equations. In most cases, it is observed that the series solution gives the closed-form solution. Moreover, in all the examples, the finite term approximate solutions obtained by the proposed method are shown to provide good accuracy with the exact solutions. The theoretical convergence results are also established to showcase the efficacy of our techniqueen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectMathematicsen_US
dc.subjectInviscid Burgers’ equationen_US
dc.subjectViscous Burgers’ equationen_US
dc.subjectSemi-analytical approximationsen_US
dc.titleOptimized decomposition method for solving multi-dimensional Burgers’ 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.