Aspects of an adaptive finite element method for the fractional Laplacian: a priori and a posteriori error estimates, efficient implementation and multigrid solver

TL;DR

This paper develops an adaptive finite element method for fractional PDEs, including error estimates, efficient implementation, and multigrid solvers, enabling accurate solutions on complex domains.

Contribution

It introduces a comprehensive framework combining a priori and a posteriori error estimates with efficient assembly and multigrid solvers for fractional PDEs.

Findings

Effective adaptive refinement driven by a posteriori error estimates

Efficient matrix assembly and multigrid solution techniques

Validated performance on various complex domain examples

Abstract

We develop all of the components needed to construct an adaptive finite element code that can be used to approximate fractional partial differential equations, on non-trivial domains in $d\geq 1$ dimensions. Our main approach consists of taking tools that have been shown to be effective for adaptive boundary element methods and, where necessary, modifying them so that they can be applied to the fractional PDE case. Improved a priori error estimates are derived for the case of quasi-uniform meshes which are seen to deliver sub-optimal rates of convergence owing to the presence of singularities. Attention is then turned to the development of an a posteriori error estimate and error indicators which are suitable for driving an adaptive refinement procedure. We assume that the resulting refined meshes are locally quasi-uniform and develop efficient methods for the assembly of the resulting linear algebraic systems and their solution using iterative methods, including the multigrid method. The storage of the dense matrices along with efficient techniques for computing the dense matrix vector products needed for the iterative solution is also considered. The performance and efficiency of the resulting algorithm is illustrated for a variety of examples.