Concept

Endomorphisme autoadjoint

Publications associées (167)

Optimized distributed implementation of multiparty interactions with Restriction

Using high level coordination primitives allows enhanced expressiveness of component-based frameworks to cope with the inherent complexity of present-day systems designs. Nonetheless, their distributed implementation raises multiple issues, regarding both ...

Elsevier2015

Smooth Scan: Statistics-Oblivious Access Paths

Anastasia Ailamaki, Renata Borovica-Gajic

Query optimizers depend heavily on statistics representing column distributions to create efficient query plans. In many cases, though, statistics are outdated or non-existent, and the process of refreshing statistics is very expensive, especially for ad-h ...

2015

Estimation in Functional Lagged Regression

Lukasz Kidzinski

The paper introduces a functional time series (lagged) regression model. The impulse-response coefficients in such a model are operators acting on a separable Hilbert space, which is the function space L-2 in applications. A spectral approach to the estima ...

Wiley-Blackwell2015

A new formulation for imposing Dirichlet boundary conditions on non-matching meshes

Jean-François Molinari, Alejandro Marcos Aragon, Aurelia Isabel Cuba Ramos

Generating matching meshes for problems with complex boundaries is often an intricate process, and the use of non-matching meshes appears as an appealing solution. Yet, enforcing boundary conditions on non-matching meshes is not a straightforward process, ...

Wiley-Blackwell2015

Sampling and (Sparse) Stochastic Processes: A Tale of Splines and Innovation

Michaël Unser

The commonality between splines and Gaussian or sparse stochastic processes is that they are ruled by the same type of differential equations. Our purpose here is to demonstrate that this has profound implications for the three primary forms of sampling: u ...

IEEE2015

MATHICSE Technical Report : A certified reduced basis method for PDE-constrained parametric optimization problems by an adjoint-based approach

Andrea Manzoni, Stefano Pagani

In this paper we present a certified reduced basis (RB) framework for the efficient solution of PDE-constrained parametric optimization problems. We consider optimization problems (such as optimal control and optimal design) governed by elliptic PDEs and i ...

MATHICSE2015

A new formulation for imposing dirichlet boundary conditions on non-matching meshes

Jean-François Molinari, Alejandro Marcos Aragon

Generating matching meshes for problems with complex boundaries is often an intricate process, and the use of non-matching meshes appears as an appealing solution. Yet, enforcing boundary conditions on non- matching meshes is not a straightforward process, ...

2015

A Parareal Method for Time-fractional Differential Equations

Jan Sickmann Hesthaven

In this paper, a parareal method is proposed for the parallel-in-time integration of time-fractional differential equations (TFDEs). It is a generalization of the original parareal method, proposed for classic differential equations. To match the global fe ...

Elsevier2015

MATHICSE Technical Report : A model order reduction framework for parametrized nonlinear PDE constrained optimization

Federico Negri

In this paper, we propose a model order reduction framework for parametrized quadratic optimization problems constrained by nonlinear stationary PDEs. Once the solutions of the optimization problem are characterized as the solutions of the corresponding op ...

MATHICSE2015

Moment bounds and asymptotics for the stochastic wave equation

Robert Dalang, Le Chen

We consider the stochastic wave equation on the real line driven by space time white noise and with irregular initial data. We give bounds on higher moments and, for the hyperbolic Anderson model, explicit formulas for second moments. These bounds imply we ...

Elsevier Science Bv2015

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