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.
Title
Comparison of Clenshaw-Curtis and Leja Quasi-Optimal Sparse Grids for the Approximation of Random PDEs
Published in
Spectral and High Order Methods for Partial Differential Equations ICOSAHOM 2014
Series
Lecture Notes in Computational Science and Engineering, 106
Pages
475-482
Conference
International Conference on Spectral and High-Order Methods 2014 (ICOSAHOM'14), Salt Lake City, June 23-27, 2014
Date
2015
Publisher
Springer
ISSN
1439-7358
ISBN
978-3-319-19800-2
Record creation date
2014-10-01