A Computational Analysis to Burgers Huxley Equation

The efficiency of solving computationally partial differential equations can be profoundly highlighted by the creation of precise, higher-order compact numerical scheme that results in truly outstanding accuracy at a given cost. The objective of this article is to develop a highly accurate novel algorithm for two dimensional non-linear Burgers Huxley (BH) equations. The proposed compact numerical scheme is found to be free of superiors approximate oscillations across discontinuities, and in a smooth flow region, it efficiently obtained a high-order accuracy. In particular, two classes of higher-order compact finite difference schemes are taken into account and compared based on their computational economy. The stability and accuracy show that the schemes are unconditionally stable and accurate up to a two-order in time and to six-order in space. Moreover, algorithms and data tables illustrate the scheme efficiency and decisiveness for solving such non-linear coupled system. Efficiency is scaled in terms of L2 and L∞ norms, which validate the approximated results with the corresponding analytical solution. The investigation of the stability requirements of the implicit method applied in the algorithm was carried out. Reasonable agreement was constructed under indistinguishable computational conditions. The proposed methods can be implemented for real-world problems, originating in engineering and science.