Publications by Fabio Nobile | EPFL Graph Search

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 present a theoretical analysis of the CORSING (COmpRessed SolvING) method for the numerical approximation of partial differential equations based on compressed sensing. In particular, we show that the best s-term approximation of the weak solution of a ...

Accurate and reliable electricity load forecasts are becoming increasingly important as the share of intermittent resources in the system increases. Distribution System Operators (DSOs) are called to accurately forecast their production and consumption to ...

We analyze the stochastic initial-boundary value problem for the elastic wave equation with random coefficients and deterministic data. We propose a stochastic collocation method for computing statistical moments of the solution or statistics of some given quantities of interest. We study the convergence rate of the error in the stochastic collocation method. In particular, we show that, the rate of convergence depends on the regularity of the solution or the quantity of interest in the stochastic space, wh

We consider the Dynamical Low Rank (DLR) approximation of random parabolic equations and propose a class of fully discrete numerical schemes. Similarly to the continuous DLR approximation, our schemes are shown to satisfy a discrete variational formulation ...

The Purkinje network is responsible for the fast and coordinated distribution of the electrical impulse in the ventricle that triggers its contraction. Therefore, it is necessary to model its presence to obtain an accurate patient-specific model of the ven ...

Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochastic Collocation (SC) methods for uncertainty quantification. An open and relevant research topic is the comparison of these two methods. By introducing a suitable generalization of the classical sparse grid SC method, we are able to compare SG and SC on the same underlying multivariate polynomial space in terms of accuracy vs. computational work. The approximation spaces considered here include isotropic and a

In this work we apply the Continuation Multi-Level Monte Carlo (C-MLMC) algorithm proposed in Collier et al. (2014) to efficiently propagate operating and geometric uncertainties in inviscid compressible aerodynamics numerical simulations. The key idea of ...

The stochastic gradient descent (SGD) method is a widely used approach for solving stochastic optimization problems, but its convergence is typically slow. Existing variance reduction techniques, such as SAGA, improve convergence by leveraging stored gradient information; however, they are restricted to settings where the objective functional is a finite sum, and their performance degrades when the number of terms in the sum is large. In this work, we propose a novel approach which is well suited when the o

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 interpolation on unbounded sets. We also consider several profit indicators that are suitable to drive the adaptation process. We then use such algorithm to solve an important test case in Uncertainty Quantification problem, namely the Darcy equation with lo

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 interpolation on unbounded sets. We also consider several profit indicators that are suitable to drive the adaptation process.We then use such algorithm to solve an important test case in Uncertainty Quantification problem, namely the Darcy equation with log

We study the single-phase flow in a saturated, bounded heterogeneous porous medium. We model the permeability as a log-normal random field. We perform a perturbation analysis, expanding the solution in Taylor series. The series is directly computable in th ...

We propose a model order reduction approach for non-intrusive surrogate modeling of parametric dynamical systems. The reduced model over the whole parameter space is built by combining surrogates in frequency only, built at few selected values of the param ...

We perform a general optimization of the parameters in the multilevel Monte Carlo (MLMC) discretization hierarchy based on uniform discretization methods with general approximation orders and computational costs. We optimize hierarchies with geometric and ...

In this paper we consider the numerical solution of the three-dimensional fluid–structure interaction problem in haemodynamics, in the case of real geometries, physiological data and finite elasticity vessel deformations. We study some new inexact schemes, ...

We quantify the effect of uncertainties on quantities of interest related to contact mechanics of rough surfaces. Specifically, we consider the problem of frictionless non adhesive normal contact between two semi infinite linear elastic solids subject to uncertainties. These uncertainties may for example originate from an incomplete surface description. To account for surface uncertainties, we model a rough surface as a suitable Gaussian random field whose covariance function encodes the surface's roughness

This manuscript presents a framework for using multilevel quadrature formulae to compute the solution of optimal control problems constrained by random partial differential equations. Our approach consists in solving a sequence of optimal control problems discretized with different levels of accuracy of the physical and probability discretizations. The final approximation of the control is then obtained in a postprocessing step, by suitably combining the adjoint variables computed on the different levels. W

We consider the numerical approximation of the stochastic Darcy problem with log-normal permeability field and propose a novel Multi Level Monte Carlo approach with a control variate variance reduction technique on each level. We model the log-permeability as a stationary Gaussian random field with a covariance function belonging to the so called Matérn family, which includes both fields with very limited and very high spatial regularity. The control variate is obtained starting from the solution of an auxi

In this work we deal with the numerical solution of the fluid-structure interaction problem arising in the haemodynamic environment. In particular, we consider BDF and Newmark time discretization schemes, and we study different methods for the treatment of ...

We consider rank-1 lattices for integration and reconstruction of functions with series expansion supported on a finite index set. We explore the connection between the periodic Fourier space and the non-periodic cosine space and Chebyshev space, via tent transform and then cosine transform, to transfer known results from the periodic setting into new insights for the non-periodic settings. Fast discrete cosine transform can be applied for the reconstruction phase. To reduce the size of the auxiliary index

The challenges for non-intrusive methods for Polynomial Chaos modeling lie in the computational efficiency and accuracy under a limited number of model simulations. These challenges can be addressed by enforcing sparsity in the series representation through retaining only the most important basis terms. In this work, we present a novel sparse Bayesian learning technique for obtaining sparse Polynomial Chaos expansions which is based on a Relevance Vector Machine model and is trained using Variational Infere

Fabio Nobile

Chat with Graph Search

A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems

Probabilistic Load Forecasting of distribution power systems based on empirical copulas

MATHICSE Technical Report : Analysis and computation of the elastic wave equation with random coefficients

Stability properties of a projector-splitting scheme for dynamical low rank approximation of random parabolic equations

An effective algorithm for the generation of patient-specific Purkinje networks in computational electrocardiology

Stochastic spectral Galerkin and collocation methods for PDEs with random coefficients: a numerical comparison

A Continuation Multi Level Monte Carlo (C-MLMC) method for uncertainty quantification in compressible inviscid aerodynamics

Stochastic gradient with least-squares control variates

An Adaptive Sparse Grid Algorithm for Elliptic PDEs with Lognormal Diffusion Coefficient

MATHICSE Technical Report : An adaptive sparse grid algorithm for elliptic PDEs with lognormal diffusion coefficient

Perturbation analysis for the Darcy problem with log-normal permeability

Non-intrusive double-greedy parametric model reduction by interpolation of frequency-domain rational surrogates

Optimization of mesh hierarchies in multilevel Monte Carlo samplers

Inexact accurate partitioned algorithms for fluid-structure interaction problems with finite elasticity in haemodynamics

MATHICSE Technical Report : Quantifying uncertainties in contact mechanics of rough surfaces using the Multilevel Monte Carlo method

Multilevel quadrature formulae for the optimal control of random PDEs

MATHICSE Technical Report : A multi level Monte Carlo method with control variate for elliptic PDEs with log-normal coefficients

Time accurate partitioned algorithms for the solution of fluid-structure interaction problems in haemodynamics

MATHICSE Technical Report : Function integration, reconstruction and approximation using rank-1 lattices

MATHICSE Technical Report : Sparse Polynomial Chaos expansions using Variational Relevance Vector Machines