Publication

Comparison of Clenshaw-Curtis and Leja Quasi-Optimal Sparse Grids for the Approximation of Random PDEs

Fabio Nobile, Lorenzo Tamellini
2015
Conference Papers

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.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Comparison of Clenshaw-Curtis and Leja Quasi-Optimal Sparse Grids for the Approximation of Random PDEs

Chat with Graph Search

Roger F. Harrington and the Method of Moments: Part 1: Electrostatics

Low-Rank Tensor Methods for High-Dimensional Problems

Ultra-broadband terahertz radiation by supercontinuum generation and optical rectification in a dispersion-engineered waveguide: a numerical study