From electrostatics to almost optimal nodal sets for polynomial interpolation in a simplex
Graph Chatbot
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.
We are interested in the approximation of partial differential equations on domains decomposed into two (or several) subdomains featuring non-conforming interfaces. The non-conformity may be due to different meshes and/or different polynomial degrees used ...
We are interested in the approximation of partial differential equations on domains decomposed into two (or several) subdomains featuring non-conforming interfaces. The non-conformity may be due to different meshes and/or different polynomial degrees used ...
In this project, we study and compare two methods to solve stochastic ordinary differential equations. The first is the Monte Carlo method and the second uses Polynomial Chaos. In the first part, we will solve a stochastic ordinary differential equation by ...
We observe that polynomial measure modifications for families of univariate orthogonal polynomials imply sparse connection coefficient relations. We therefore propose connecting L (2) expansion coefficients between a polynomial family and a modified family ...
Novel memory-efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the ...
In this paper we propose and analyze a stochastic collocation method for solving the second order wave equation with a random wave speed and subjected to deterministic boundary and initial conditions. The speed is piecewise smooth in the physical space and ...
In this work we provide a convergence analysis for the quasi-optimal version of the Stochastic Sparse Grid Collocation method we had presented in our previous work \On the optimal polynomial approximation of Stochastic PDEs by Galerkin and Collocation meth ...
In this work we provide a convergence analysis for the quasi-optimal version of the sparse-grids stochastic collocation method we presented in a previous work: “On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods” ...
We establish exponential convergence of the hp-version of isogeometric analysis for second order elliptic problems in one spacial dimension. Specifically, we construct, for functions which are piecewise analytic with a finite number of algebraic singularit ...
Frequency response function measurements take a central place in the instrumentation and measurement field because many measurement problems boil down to the characterisation of a linear dynamic behaviour. The major problems to be faced are leakage- and no ...
