Concept

Base de Schauder

Publications associées (53)

SPACE-TIME REDUCED BASIS METHODS FOR PARAMETRIZED UNSTEADY STOKES EQUATIONS

Simone Deparis, Riccardo Tenderini, Nicholas Mueller

In this work, we analyze space-time reduced basis methods for the efficient numerical simulation of haemodynamics in arteries. The classical formulation of the reduced basis (RB) method features dimensionality reduction in space, while finite difference sc ...

Philadelphia2024

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

Fredholm transformation on Laplacian and rapid stabilization for the heat equations

Shengquan Xiang

We revisit the rapid stabilization of the heat equation on the 1-dimensional torus using the backstepping method with a Fredholm transformation. We prove that, under some assumption on the control operator, two scalar controls are necessary and sufficient ...

2021

On Katznelson's Question for skew product systems

Florian Karl Richter

Katznelson's Question is a long-standing open question concerning recurrence in topological dynamics with strong historical and mathematical ties to open problems in combinatorics and harmonic analysis. In this article, we give a positive answer to Katznel ...

2021

Shortest-support multi-spline bases for generalized sampling

Michaël Unser, Alexis Marie Frederic Goujon, Shayan Aziznejad, Alireza Naderi

Generalized sampling consists in the recovery of a function f, from the samples of the responses of a collection of linear shift-invariant systems to the input f . The reconstructed function is typically a member of a finitely generated integer-shift invar ...

2021

Reduction techniques for PDEs built upon Reduced Basis and Domain Decomposition Methods with applications to hemodynamics

Luca Pegolotti

This thesis focuses on the development and validation of a reduced order technique for cardiovascular simulations. The method is based on the combined use of the Reduced Basis method and a Domain Decomposition approach and can be seen as a particular imple ...

EPFL2021

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...

SPRINGER HEIDELBERG2020

An algebraic least squares reduced basis method for the solution of nonaffinely parametrized Stokes equations

Alfio Quarteroni, Simone Deparis, Andrea Manzoni, Niccolò Dal Santo

In this paper we propose a new, purely algebraic, Petrov-Galerkin reduced basis (RB) method to solve the parametrized Stokes equations, where parameters serve to identify the (variable) domain geometry. Our method is obtained as an algebraic least squares ...

ELSEVIER SCIENCE SA2019

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

Multi space reduced basis preconditioners for large-scale parametrized PDEs

Alfio Quarteroni, Simone Deparis, Andrea Manzoni, Niccolò Dal Santo

In this work we introduce a new two-level preconditioner for the efficient solution of large-scale linear systems arising from the discretization of parametrized PDEs. The proposed preconditioner combines in a multiplicative way a reduced basis solver, whi ...

2018

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