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.
F. Nobile and L. Tamellini have been partially supported by the Swiss National Science Foundation under the Project No. 140574 “Efficient numerical methods for flow and transport phenomena in heterogeneous random porous media” and by the Center for ADvanced MOdeling Science (CADMOS). R. Tempone is a member of the KAUST SRI Center for Uncertainty Quantification in Computational Science and Engineering.
- 2.J. Beck, F. Nobile, L. Tamellini, R. Tempone, On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods. Math. Models Methods Appl. Sci. 22(09) (2012)Google Scholar
- 3.J. Beck, F. Nobile, L. Tamellini, R. Tempone, A quasi-optimal sparse grids procedure for groundwater flows, in Spectral and High Order Methods for Partial Differential Equations - ICOSAHOM 2012. Lecture Notes in Computational Science and Engineering, vol. 95 (Springer International Publishing, Switzerland, 2014), pp. 1–16Google Scholar
- 11.F. Nobile, L. Tamellini, R. Tempone, Convergence of quasi-optimal sparse-grids approximation of Hilbert-space-valued functions: application to random elliptic PDEs. Accepted for publication on Numerische Mathematik. Also available as Mathicse report 12/2014, EPFLGoogle Scholar
- 12.C. Schillings, C. Schwab, Sparse, adaptive Smolyak quadratures for Bayesian inverse problems. Inverse Probl. 29(6) (2013)Google Scholar