An Algorithm for Solving Boundary Value Problems
β Scribed by Elias Deeba; S.A. Khuri; Shishen Xie
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 83 KB
- Volume
- 159
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper a numerical algorithm, based on the decomposition technique, is presented for solving a class of nonlinear boundary value problems. The method is implemented for well-known examples, including Troesch's and Bratu's problems which have been extensively studied. The scheme is shown to be highly accurate, and only a few terms are required to obtain accurate computable solutions.
π SIMILAR VOLUMES
The purpose of this paper is to construct solutions of self-adjoint boundary value problems on finite networks. To this end, we obtain explicit expressions of the Green functions for all different boundary value problems. The method consists of reducing each boundary value problem either to a Dirich