Nobile, FabioTamellini, LorenzoTempone, Raul2014-10-012014-10-01201510.1007/978-3-319-19800-2_44https://infoscience.epfl.ch/handle/20.500.14299/107171WOS:000368440400044In 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.Uncertainty QuantificationPDEs with random datalinear elliptic equationsStochastic Collocation methodsSparse grids approximationLeja pointsClenshaw–Curtis pointsComparison of Clenshaw-Curtis and Leja Quasi-Optimal Sparse Grids for the Approximation of Random PDEstext::conference output::conference proceedings::conference paper