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.


Editor(s):
Kirby, Robert M.
Berzins, Martin
Hesthaven, Jan S.
Published in:
Spectral and High Order Methods for Partial Differential Equations ICOSAHOM 2014, 475-482
Presented at:
International Conference on Spectral and High-Order Methods 2014 (ICOSAHOM'14), Salt Lake City, June 23-27, 2014
Year:
2015
Publisher:
Springer
ISSN:
1439-7358
ISBN:
978-3-319-19800-2
Keywords:
Laboratories:


Note: The status of this file is: EPFL only
PRIVATE


 Record created 2014-10-01, last modified 2018-01-28

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)