Journal
APPLIED NUMERICAL MATHEMATICS
Volume 139, Issue -, Pages 62-76Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.apnum.2019.01.003
Keywords
Bratu's problem; Two-branched solution; Newton-Raphson-Kantorovich approximation; Iterative finite difference method
Categories
Ask authors/readers for more resources
In this paper, we propose an iterative finite difference (IFD) scheme to simultaneously approximate both branches of a two-branched solution to the one-dimensional Bratu's problem. We first introduce a transformation to convert Bratu's problem into a simpler one. The transformed nonlinear ordinary differential equation is discretized using the Newton-Raphson-Kantorovich approximation in function space. The convergence of the sequence of approximations is proved to be quadratic. Then, we apply the classical finite difference method to approximate the sequence of approximations. The proposed new scheme has two main advantages. First, it produces accurate numerical solutions with low computational cost. Second, it is able to compute the two branches of the solution of Bratu's problem, even for small values of the transition parameter A, where the numerical computation of the upper branch of the solution becomes challenging. Numerical examples are provided to show the efficiency and accuracy of the proposed scheme. (C) 2019 IMACS. Published by Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available