A brain tumor is a dynamic system in which cells develop rapidly and abnormally, as is the case with most cancers. Cancer develops in the brain or inside the skull when aberrant and odd cells proliferate in the brain. By depriving the healthy cells of leisure, nutrition, and oxygen, these aberrant cells eventually cause the healthy cells to perish. This article investigated the development of glioma cells in treating brain tumors. Mathematically, reaction-diffusion models have been developed for brain glioma growth to quantify the diffusion and proliferation of the tumor cells within brain tissues. This study presents the formulation the two-stage successive over-relaxation (TSSOR) algorithm based on the finite difference approximation for solving the treated brain glioma model to predict glioma cells in treating the brain tumor. Also, the performance of TSSOR method is compared to the Gauss-Seidel (GS) and two-stage Gauss-Seidel (TSGS) methods in terms of the number of iterations, the amount of time it takes to process the data, and the rate at which glioma cells grow the fastest. The implementation of the TSSOR, TSGS, and GS methods predicts the growth of tumor cells under the treatment protocol. The results show that the number of glioma cells decreased initially and then increased gradually by the next day. The computational complexity analysis is also used and concludes that the TSSOR method is faster compared to the TSGS and GS methods. According to the results of the treated glioma development model, the TSSOR approach reduced the number of iterations by between 8.0 and 71.95%. In terms of computational time, the TSSOR approach is around 1.18-76.34% faster than the TSGS and GS methods.
The equations describe the behavior of steady state flow in porous medium generally results in elliptic partial differential equations with coefficient represents the permeability of the medium. This article presents the extension of mortar mixed method for second order nonlinear elliptic equations that describes flow in porous media. The domain is decomposed into non-overlapping regions with each partitioned independently. The grids on subdomains are allowed to be non-matching across the subdomains internal boundaries. The fixed point argument (FPA) is employed to establish the existence and uniqueness of discrete problem, and optimal order error estimates are provided for approximations. The computational results are given to validate the theory.