Concept

Discretization error

Publications associées (21)

An adaptive space-time algorithm for the incompressible Navier-Stokes equations

A space-time adaptive algorithm is presented to solve the incompressible Navier-Stokes equations. Time discretization is performed with the BDF2 method while continuous, piecewise linear anisotropic finite elements are used for the space discretization. Th ...

San Diego2023

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

Michaël Unser, Shayan Aziznejad, Thomas Jean Debarre

We present a novel framework for the reconstruction of 1D composite signals assumed to be a mixture of two additive components, one sparse and the other smooth, given a finite number of linear measurements. We formulate the reconstruction problem as a cont ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Probabilistic and Bayesian methods for uncertainty quantification of deterministic and stochastic differential equations

Giacomo Garegnani

In this thesis we explore uncertainty quantification of forward and inverse problems involving differential equations. Differential equations are widely employed for modeling natural and social phenomena, with applications in engineering, chemistry, meteor ...

EPFL2021

Novel corrector problems with exponential decay of the resonance error for numerical homogenization

Edoardo Paganoni

Multiscale problems, such as modelling flows through porous media or predicting the mechanical properties of composite materials, are of great interest in many scientific areas. Analytical models describing these phenomena are rarely available, and one mus ...

EPFL2020

Multilevel weighted least squares polynomial approximation

Fabio Nobile

Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi ...

2020

Open-Source Implementation and Validation of a 3D Inverse Design Method for Francis Turbine Runners

François Avellan, Sebastián Camilo Leguizamón Sarmiento

The hydraulic design of Francis turbines and pump-turbines is an expensive project-specific engineering effort that typically involves a direct iterative exploration of the design space. An inverse design method for turbomachinery has been previously intro ...

2020

A Fourier-accelerated volume integral method for elastoplastic contact

Jean-François Molinari, Guillaume Anciaux, Lucas Henri Galilée Frérot

The contact of solids with rough surfaces plays a fundamental role in physical phenomena such as friction, wear, sealing, and thermal transfer. However, its simulation is a challenging problem due to surface asperities covering a wide range of length-scale ...

2019

3D model discretization in assessing urban solar potential: the effect of grid spacing on predicted solar irradiation

Marilyne Andersen, Giuseppe Peronato

The increasing interest in solar energy production in urban areas requires an accurate simulation of solar irradiation on building surfaces, including vertical surfaces. However, solar potential analyses are usually conducted on 2.5D models, which are limi ...

2018

MATHICSE Technical Report : Multilevel weighted least squares polynomial approximation

Fabio Nobile

MATHICSE2017

Multilevel weighted least squares polynomial approximation

Fabio Nobile

2017

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search