Reduced Basis Approximations of the Solutions to Spectral Fractional Diffusion Problems

Abstract

We 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<s_{\min}\leq s \leq s_{\max}<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.