MATHICSE-GroupNobile, FabioTamellini, LorenzoTempone, Raúl2019-01-222019-01-222019-01-222014-10-0210.5075/epfl-MATHICSE-263229https://infoscience.epfl.ch/handle/20.500.14299/153709In this work we compare numerically 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 the performances of both families are essentially comparable within such framework.Uncertainty QuanticationPDEs with random datalinear elliptic equationsStochastic Collocation methodsSparse grids approximationLeja pointsClenshaw{Curtis points)text::working paper