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 show that isogeometric Galerkin discretizations of eigenvalue problems related to the Laplace operator subject to any standard type of homogeneous boundary conditions have no outliers in certain optimal spline subspaces. Roughly speaking, these optimal ...
In this paper we show that the incompressible Euler equation on the Sobolev space H-s(R-n), s> n/2+1, can be expressed in Lagrangian coordinates as a geodesic equation on an infinite dimensional manifold. Moreover the Christoffel map describing the geodesi ...
The Internodes method is a general purpose method to deal with non-conforming discretizations of partial differential equations on 2D and 3D regions partitioned into disjoint subdomains. In this paper we are interested in measuring how much the Internodes ...
2022
,
Fractional operators are widely used in mathematical models describing abnormal and nonlocal phenomena. Although there are extensive numerical methods for solving the corresponding model problems, theoretical analysis such as the regularity result, or the ...
In this work we build on the classical adaptive sparse grid algorithm (T. Gerstner and M. Griebel, Dimension-adaptive tensor-product quadrature), obtaining an enhanced version capable of using non-nested collocation points, and supporting quadrature and in ...
In this paper we review various numerical homogenization methods for monotone parabolic problems with multiple scales. The spatial discretisation is based on finite element methods and the multiscale strategy relies on the heterogeneous multiscale method. ...
We use the averaged variational principle introduced in a recent article on graph spectra [10] to obtain upper bounds for sums of eigenvalues of several partial differential operators of interest in geometric analysis, which are analogues of Kroger's bound ...
Low-rank tensor approximation techniques attempt to mitigate the overwhelming complexity of linear algebra tasks arising from high-dimensional applications. In this work, we study the low-rank approximability of solutions to linear systems and eigenvalue p ...
Elsevier Science Inc2016
,
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” ...
The aim of this work is to solve parametrized partial differential equations in computational domains represented by networks of repetitive geometries by combining reduced basis and domain decomposition techniques. The main idea behind this approach is to ...
