Publication

MATHICSE Technical Report : Comparison of Clenshaw-Curtis and Leja quasi-optimal sparse grids for the approximation of random PDEs

Fabio Nobile
2014
Working Papers

Abstract

In this work we compare numerically 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 the performances of both families are essentially comparable 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.

MATHICSE Technical Report : Comparison of Clenshaw-Curtis and Leja quasi-optimal sparse grids for the approximation of random PDEs

Chat with Graph Search

High-performance coupling for monolithic microreactor analysis with preCICE

MATHICSE Technical Report : A probabilistic finite element method based on random meshes: Error estimators and Bayesian inverse problems

Large-Scale Tsunami Simulations using the Discontinuous Galerkin Method