DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/10924
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Devendra-
dc.date.accessioned2023-05-18T10:03:10Z-
dc.date.available2023-05-18T10:03:10Z-
dc.date.issued2023-
dc.identifier.urihttps://journals.vilniustech.lt/index.php/MMA/article/view/14953-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10924-
dc.description.abstractThis computational study investigates a class of singularly perturbed second-order boundary-value problems having dual (twin) boundary layers and simple turning points. It is well-known that the classical discretization methods fail to resolve sharp gradients arising in solving singularly perturbed differential equations as the perturbation (diffusion) parameter decreases, i.e., ε → 0+. To this end, this paper proposes a semi-analytic hybrid method consisting of a numerical procedure based on finite differences and an asymptotic method called the Successive Complementary Expansion Method (SCEM) to approximate the solution of such problems. Two numerical experiments are provided to demonstrate the method’s implementation and to evaluate its computational performance. Several comparisons with the numerical results existing in the literature are also made. The numerical observations reveal that the hybrid method leads to good solution profiles and achieves this in only a few iterations.en_US
dc.language.isoenen_US
dc.publisherVilnius Gediminas Technical Universityen_US
dc.subjectMathematicsen_US
dc.subjectAsymptotic expansionen_US
dc.subjectTurning pointen_US
dc.subjectSingular perturbationen_US
dc.subjectFinite differencesen_US
dc.titleA semi-analytic method for solving singularly perturbed twin-layer problems with a turning pointen_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.