Concept

Interpolation lagrangienne

Publications associées (88)

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

The double description method for the approximation of explicit MPC control laws

Colin Neil Jones

A standard model predictive controller (MPC) can be written as a parametric optimization problem whose solution is a piecewise affine (PWA) map from the measured state to the optimal control input. The primary limitation of this optimal `explicit solutionÂ ...

IEEE2008

Short Basis Functions for Constant-Variance Interpolation

Michaël Unser, Philippe Thévenaz, Thierry Blu

An interpolation model is a necessary ingredient of intensity-based registration methods. The properties of such a model depend entirely on its basis function, which has been traditionally characterized by features such as its order of approximation and it ...

SPIE2008

The symmetric discontinuous Galerkin method does not need stabilization in 1D for polynomial orders p ≥ 2

Erik Burman, Benjamin Stamm

In this Note we prove that in one space dimension, the symmetric discontinuous Galerkin method for second order elliptic problems is stable for polynomial orders

p \ge 2

without using any stabilization parameter. The method yields optimal convergence rat ...

2007

Regularized interpolation for noisy data

Michaël Unser, Philippe Thévenaz, Sathish Ramani

Interpolation is a vital tool in biomedical signal processing. Although there exists a substantial literature dedicated to noise-free conditions, much less is known in the presence of noise. Here, we document the breakdown of standard interpolation for noi ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Regularized Interpolation for Noisy Data

Michaël Unser, Philippe Thévenaz, Sathish Ramani

IEEE2007

Fine-scale structures and negative-density regions: Comparison of numerical methods for solving the advection equation

Olivier Sauter, Laurent Villard

A common feature of the Vlasov equation is that it develops fine-scale filamentation as time evolves, as observed, for example, in global nonlinear simulations of the ion-temperature-gradient instability. From a numerical point of view, it is not trivial t ...

2005

Spectral Discontinuous Galerkin Method for Hyperbolic Problems

Benjamin Stamm

In this project we address the numerical approximation of hyperbolic equations and systems using the discontinuous Galerkin (DG) method in combination with higher order polynomial degrees. In short, this is called Spectral Discontinuous Galerkin (SDG) meth ...

2005

High-Resolution Frequency Estimation Technique for Recovering Phase Distribution in Interferometers

Pramod Rastogi, Abhijit Patil, Rajesh Langoju

An integral approach to phase measurement is presented. First, the use of a high-resolution technique for the pixelwise detection of phase steps is proposed. Next, the robustness of the algorithm that is developed is improved by incorporation of a denoisin ...

OSA2005

An improved decoding scheme for Matching Pursuit Streams

Pierre Vandergheynst

This work presents an improved coefficient decoding method for Matching Pursuit streams. It builds on the adaptive a posteriori quantization of coefficients, and implements an interpolation scheme that enhances the inverse quantization performance at the d ...

2005

A Note on Cubic Convolution Interpolation

Michaël Unser

We establish a link between classical osculatory interpolation and modern convolution-based interpolation and use it to show that two well-known cubic convolution schemes are formally equivalent to two osculatory interpolation schemes proposed in the actua ...

IEEE2003

The symmetric discontinuous Galerkin method does not need stabilization in 1D for polynomial orders p ≥ 2

Erik Burman, Benjamin Stamm

In this Note we prove that in one space dimension, the symmetric discontinuous Galerkin method for second order elliptic problems is stable for polynomial orders

p \ge 2

without using any stabilization parameter. The method yields optimal convergence rat ...

2007