Comparison of clenshaw–curtis and leja quasi-optimal sparse grids for the approximation of random PDEs

Abstract

In this work we compare different families of nested quadrature points, i. e. the classic Clenshaw–Curtis and various kinds of Leja points, in the context of the quasi-optimal sparse grid approximation of random elliptic PDEs. Numerical evidence suggests that both families perform comparably within such framework.