Concept

Smooth scheme

Publications associées (55)

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

Joint image reconstruction and segmentation using the Potts model

Michaël Unser, Martin Kurt Storath

We propose a new algorithmic approach to the non-smooth and non-convex Potts problem (also called piecewise-constant Mumford-Shah problem) for inverse imaging problems. We derive a suitable splitting into specific subproblems that can all be solved efficie ...

Institute of Physics2015

Large global solutions for energy supercritical nonlinear wave equations on $\R^{3+1}$

Joachim Krieger

For the radial energy-supercritical nonlinear wave equation

\Box u = -u_{tt} + \triangle u = \pm u^7

\R^{3+1}

, we prove the existence of a class of global in forward time

C^\infty

-smooth solutions with infinite critical Sobolev norm $\dot{H}^{\f ...

Springer Verlag2014

Matrix Completion on Graphs

Pierre Vandergheynst, Michael Bronstein, Xavier Bresson, Vasilis Kalofolias

The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem is NP-hard, Candes and Recht showed that it can be exactly relaxed if the ...

2014

Matrix Completion on Graphs

Pierre Vandergheynst, Michael Bronstein, Xavier Bresson, Vasilis Kalofolias

The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Al- though the problem under the standard low rank assumption is NP-hard, Cande`s and Recht sho ...

2014

Superfluid–insulator transition in weakly interacting disordered Bose gases: a kernel polynomial approach

Vincenzo Savona, Pierre Lugan, Joseph Saliba

An iterative scheme based on the kernel polynomial method is devised for the efficient computation of the one-body density matrix of weakly interacting Bose gases within Bogoliubov theory. This scheme is used to analyze the coherence properties of disorder ...

Institute of Physics (IoP) and Deutsche Physikalische Gesellschaft2013

Harmonic Maps on Smooth Metric Measure Spaces and on Riemannian Polyhedra

Zahra Sinaei

This thesis is a study of harmonic maps in two different settings. The first part is concerned with harmonic maps from smooth metric measure spaces to Riemannian manifolds. The second part is study of harmonic maps from Riemannian polyhedra to non-positive ...

EPFL2013

Prym varieties of spectral covers

Tamás Hausel

Given a possibly reducible and non-reduced spectral cover pi: X -> C over a smooth projective complex curve C we determine the group of connected components of the Prym variety Prym(X/C). As an immediate application we show that the finite group of n-torsi ...

Geometry & Topology Publications2012

MATHICSE Technical Report : Sparse spectral approximations for computing polynomial functionals

Fabio Nobile

We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral eigenfunctions th ...

MATHICSE2012

Sparse spectral approximations for computing polynomial functionals

Fabio Nobile

2012

Some remarks on orbit sets of unimodular rows

Jean Fasel

Let A be a d-dimensional smooth algebra over a perfect field of characteristic not 2. Let Um(n+1)(A)/En+1 (A) be the set of unimodular rows of length n + 1 up to elementary transformations. If n >= (d + 2)/2, it carries a natural structure of group as disc ...

2011