scholarly journals On the robustness of a multigrid method for anisotropic reaction-diffusion problems

Computing ◽  
2007 ◽  
Vol 80 (4) ◽  
pp. 299-317 ◽  
Author(s):  
A. Reusken ◽  
M. Soemers
Computing ◽  
2000 ◽  
Vol 65 (3) ◽  
pp. 193-202 ◽  
Author(s):  
Maxim A. Olshanskii ◽  
Arnold Reusken

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Yahya Alnashri ◽  
Hasan Alzubaidi

Abstract A gradient discretisation method (GDM) is an abstract setting that designs the unified convergence analysis of several numerical methods for partial differential equations and their corresponding models. In this paper, we study the GDM for anisotropic reaction–diffusion problems, based on a general reaction term, with Neumann boundary condition. With natural regularity assumptions on the exact solution, the framework enables us to provide proof of the existence of weak solutions for the problem, and to obtain a uniform-in-time convergence for the discrete solution and a strong convergence for its discrete gradient. It also allows us to apply non-conforming numerical schemes to the model on a generic grid (the non-conforming ℙ ⁢ 1 {\mathbb{P}1} finite element scheme and the hybrid mixed mimetic (HMM) methods). Numerical experiments using the HMM method are performed to assess the accuracy of the proposed scheme and to study the growth of glioma tumors in heterogeneous brain environment. The dynamics of their highly diffusive nature is also measured using the fraction anisotropic measure. The validity of the HMM is examined further using four different mesh types. The results indicate that the dynamics of the brain tumor is still captured by the HMM scheme, even in the event of a highly heterogeneous anisotropic case performed on the mesh with extreme distortions.


2020 ◽  
Vol 28 (3) ◽  
pp. 147-160
Author(s):  
Andrea Bonito ◽  
Diane Guignard ◽  
Ashley R. Zhang

AbstractWe consider the numerical approximation of the spectral fractional diffusion problem based on the so called Balakrishnan representation. The latter consists of an improper integral approximated via quadratures. At each quadrature point, a reaction–diffusion problem must be approximated and is the method bottle neck. In this work, we propose to reduce the computational cost using a reduced basis strategy allowing for a fast evaluation of the reaction–diffusion problems. The reduced basis does not depend on the fractional power s for 0 < smin ⩽ s ⩽ smax < 1. It is built offline once for all and used online irrespectively of the fractional power. We analyze the reduced basis strategy and show its exponential convergence. The analytical results are illustrated with insightful numerical experiments.


Sign in / Sign up

Export Citation Format

Share Document