Comparison of Clenshaw-Curtis and Leja Quasi-Optimal Sparse Grids for the Approximation of Random PDEs
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.
Record created on 2014-10-01, modified on 2016-08-09