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.
Comparison of Clenshaw-Curtis and Leja quasi-optimal sparse grids for the approximation of random PDEs
L Tamellini;
2015
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_370233-doc_152619.pdf
non disponibili
Descrizione: Comparison of Clenshaw-Curtis and Leja Quasi-Optimal Sparse Grids for the Approximation of Random PDEs
Tipologia:
Versione Editoriale (PDF)
Dimensione
424.62 kB
Formato
Adobe PDF
|
424.62 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
