An efficient accurate scheme for solving the three-dimensional Bratu-type problem

In this manuscript, we present an innovative discretization algorithm designed to address the challenges posed by the three-dimensional (3D) Bratu problem, a well-known problem characterized by non-unique solutions. Our algorithm aims to achieve exceptional precision and accuracy in determining all potential solutions, as previous studies in the literature have only managed to produce limited accurate results. Additionally, our computational scheme approximates the critical values of the transition parameter. Moreover, we establish a rigorous proof demonstrating the uniform convergence of the approximation sequence to the exact solution of the original problem, under the condition that the initial guess is sufficiently close to the true solution. This theoretical result further establishes the reliability of our algorithm. To evaluate the effectiveness of our proposed approach, we conduct extensive numerical simulations, which convincingly demonstrate its capability to accurately solve the 3D Bratu problem while effectively determining the critical values of the transition parameter. Furthermore, we investigate the bifurcated behavior of the solution by analyzing the infinity norm for various values of the transition parameter. The outcomes of our study offer a robust and efficient method for tackling the 3D Bratu problem, making a significant contribution to the field of numerical analysis of partial differential equations (PDEs) where non-unique solutions are commonly encountered. Our algorithm's ability to produce accurate results for this challenging problem showcases its potential for broader applications in diverse scientific and engineering domains. •Continuation of a series of publications on the Bratu problem.•Three-dimensional nonlinear problem.•Only two papers studied the 3D Bratu problem.•Existence of three critical values of the transition parameter.•Highly accurate solution to be considered as benchmark for future work.