DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/10965
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Devendra-
dc.date.accessioned2023-07-22T04:40:07Z-
dc.date.available2023-07-22T04:40:07Z-
dc.date.issued2021-05-
dc.identifier.urihttps://www.tandfonline.com/doi/full/10.1080/00207160.2021.1925115-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10965-
dc.description.abstractWe present a numerical scheme for the solution of two-parameter singularly perturbed problems whose solution has multi-scale behaviour in the sense that there are small regions where the solution changes very rapidly (known as layer regions) otherwise the solution is smooth (known as a regular region) throughout the domain of consideration. In particular, to solve the problems whose solution exhibits twin boundary layers at both endpoints of the domain of consideration, we propose a collocation method based on the quintic B-spline basis functions. A piecewise-uniform mesh that increases the density within the layer region compared to the outer region is used. An (N+1)×(N+1) penta-diagonal system of algebraic equations is obtained after the discretization. A well-known fast penta-diagonal system solver algorithm is used to solve the system. We have shown that the method is almost fourth-order parameters uniformly convergent. The theoretical estimates are verified through numerical simulations for two test problems.en_US
dc.language.isoenen_US
dc.publisherTaylor & Francisen_US
dc.subjectMathematicsen_US
dc.subjectSingularly perturbed parabolic problemsen_US
dc.subjectTwo-parameteren_US
dc.subjectCollocation methoden_US
dc.subjectShishkin-type meshen_US
dc.titleA uniformly convergent scheme for two-parameter problems having layer behaviouren_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.