Niall Madden

Stephen Russell, Niall Madden

Our goal is to present an elementary approach to the analysis and programming of sparse grid finite element methods. This family of schemes can compute accurate solutions to partial differential equations, but using far fewer degrees of freedom than their classical counterparts. After a brief discussion of the classical Galerkin finite element method with bilinear elements, we give a short analysis of what is probably the simplest sparse grid method: the two-scale technique of Lin et al. (2001). We then demonstrate how to extend this to a multiscale sparse grid method which, up to choice of basis, is equivalent to the hierarchical approach, as described by, e.g., Bungartz and Griebel (2004). However, by presenting it as an extension of the two-scale method, we can give an elementary treatment of its analysis and implementation. For each method considered, we provide MATLAB code, and a comparison of accuracy and computational costs.

Thái Anh Nhan, Niall Madden

We consider the solution of large linear systems of equations that arise when two-dimensional singularly perturbed reaction-diffusion equations are discretized. Standard methods for these problems, such as central finite differences, lead to system matrices that are positive definite. The direct solvers of choice for such systems are based on Cholesky factorisation. However, as observed by MacLachlan and Madden (SIAM J. Sci. Comput. 35-5 (2013), pp. A2225-A2254), these solvers may exhibit poor performance for singularly perturbed problems. We provide an analysis of the distribution of entries in the factors based on their magnitude that explains this phenomenon, and give bounds on the ranges of the perturbation and discretization parameters where poor performance is to be expected.