DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/10946
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Devendra-
dc.date.accessioned2023-07-21T06:37:14Z-
dc.date.available2023-07-21T06:37:14Z-
dc.date.issued2008-08-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0096300308001720-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10946-
dc.description.abstractIn this paper, a method based on initial value technique is proposed for solving non-linear two-point singularly perturbed boundary value problems for second order ordinary differential equations (ODEs) with a boundary layer at one (either left or right) end. The original singularly perturbed boundary value problem is reduced to an initial value problem approximated by its outer solution (asymptotic approximation). The new initial value problem is solved by proposed non-linear single step explicit scheme followed the idea given in [F.D. Van Niekerk, Non-linear one-step methods for initial value problems, Comput. Math. Appl. 13 (1987) 367–371]. The proposed scheme has been shown to be of order two. To demonstrate the applicability of the proposed scheme several (linear and non-linear) problems have been solved. It is observed that the present scheme approximate the exact solution very well.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectMathematicsen_US
dc.subjectSingular perturbationen_US
dc.subjectTwo-point boundary value problemen_US
dc.subjectBoundary layersen_US
dc.subjectInitial valueen_US
dc.subjectAsymptotic approximationen_US
dc.subjectSingle step explicit schemeen_US
dc.titleA non-linear single step explicit scheme for non-linear two-point singularly perturbed boundary value problems via initial value techniqueen_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.