Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/102846
DC FieldValue
dc.titleAn iterative scheme for solving nonlinear two point boundary value problems
dc.contributor.authorQu, R.
dc.contributor.authorAgarwal, R.P.
dc.date.accessioned2014-10-28T02:30:25Z
dc.date.available2014-10-28T02:30:25Z
dc.date.issued1997
dc.identifier.citationQu, R.,Agarwal, R.P. (1997). An iterative scheme for solving nonlinear two point boundary value problems. International Journal of Computer Mathematics 64 (3-4) : 285-302. ScholarBank@NUS Repository.
dc.identifier.issn00207160
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/102846
dc.description.abstractIn this paper, by using the ideas employed in the analysis of interpolatory subdivision algorithms for the generation of smooth curves, an iterative scheme for solving nonlinear two point boundary value problems is formulated. This method is basically a collocation method for nonlinear second order two point boundary value problems. It is proved that the iterative algorithm converges to a smooth approximate solution provided the boundary value problem is well posed and the algorithm is applied appropriately. Error estimates in the case of uniform partitions are also investigated. Some numerical examples are included to show the convergence of the proposed algorithm.
dc.sourceScopus
dc.subjectApproximation
dc.subjectBoundary value problems
dc.subjectInterpolation
dc.subjectIterative method
dc.subjectMethod of collocation
dc.subjectSubdivision algorithm
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.sourcetitleInternational Journal of Computer Mathematics
dc.description.volume64
dc.description.issue3-4
dc.description.page285-302
dc.description.codenIJCMA
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

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

Google ScholarTM

Check


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