Concept

Fonction signe

Publications associées (33)

Stability of the Faber-Krahn inequality for the short-time Fourier transform

We prove a sharp quantitative version of the Faber–Krahn inequality for the short-time Fourier transform (STFT). To do so, we consider a deficit which measures by how much the STFT of a function fails to be optimally concentrated on an arbitrary set of pos ...

Springer Heidelberg2024

Rational-based model order reduction of Helmholtz frequency response problems with adaptive finite element snapshots

Francesca Bonizzoni, Davide Pradovera

We introduce several spatially adaptive model order reduction approaches tailored to non-coercive elliptic boundary value problems, specifically, parametric-in-frequency Helmholtz problems. The offline information is computed by means of adaptive finite el ...

2021

Substructured Two-grid and Multi-grid Domain Decomposition Methods

Tommaso Vanzan

Two-level domain decomposition methods are very powerful techniques for the efficient numerical solution of partial differential equations (PDEs). A two-level domain decomposition method requires two main components: a one-level preconditioner (or its corr ...

2021

Correcting for non-periodic behaviour in perturbative experiments: application to heat pulse propagation and modulated gas-puff experiments

Federico Alberto Alfredo Felici, Cristian Galperti

This paper introduces a recent innovation in dealing with non-periodic behavior often referred to as transients in perturbative experiments. These transients can be the result from the unforced response due to the initial condition and other slow trends in ...

2020

A generalization of Kátai's orthogonality criterion with applications

Florian Karl Richter

We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of Kátai's orthogonality cri ...

2019

Statistical and physical characterization of rainfall-driven overland flow morphologies

Mohsen Cheraghi

Environmental transport processes are highly coupled with the shape of landscapes. Modern catchment analysis with high-resolution data and huge computational powers demand more detailed within-cell metrics for surface evolution modeling. This dissertation ...

EPFL2019

Exploring the energy use drivers of 10 cities at microscale level

Franziska Meinherz, Aristide Henri Roger Athanassiadis, João Vitor Meirelles de Miranda

Cities are responsible for the predominant share of anthropogenic environmental pressures. Recently, consistent methodologies to measure the metabolism of cities have been developed in order to enhance comparability between case studies and enable cross-ci ...

Elsevier2017

BDD Minimization for Approximate Computing

Mathias Soeken, Arun Chandrasekharan

We present Approximate BDD Minimization (ABM) as a problem that has application in approximate computing. Given a BDD representation of a multi-output Boolean function, ABM asks whether there exists another function that has a smaller BDD representa ...

IEEE2016

Computation in Multicast Networks: Function Alignment and Converse Theorems

Michael Christoph Gastpar, Naveen Goela

The classical problem in a network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers that decode the same set of messages. In this paper, computation over multicast networks ...

Institute of Electrical and Electronics Engineers2016

Reduced basis method and domain decomposition for elliptic problems in networks and complex parametrized geometries

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

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 ...

Elsevier2016

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