Concept

Compact operator on Hilbert space

Publications associées (47)

Asymptotic bifurcation and second order elliptic equations on R-N

This paper deals with asymptotic bifurcation, first in the abstract setting of an equation G(u) = lambda u, where G acts between real Hilbert spaces and lambda is an element of R, and then for square-integrable solutions of a second order non-linear ellipt ...

Elsevier Science Bv2015

Sequences with Minimal Time-Frequency Uncertainty

Martin Vetterli, Reza Parhizkar, Yann Barbotin

A central problem in signal processing and communications is to design signals that are compact both in time and frequency. Heisenberg's uncertainty principle states that a given function cannot be arbitrarily compact both in time and frequency, defining a ...

Elsevier2015

Optimized distributed implementation of multiparty interactions with Restriction

Joseph Sifakis

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

An Adjoint Approach for Stabilizing the Parareal Method

Jan Sickmann Hesthaven, Allan Svejstrup Nielsen, Yvon Maday

The parareal algorithm seeks to extract parallelism in the time-integration direction of time-dependent differential equations. While it has been applied with success to a wide range of problems, it suffers from some stability issues when applied to non-di ...

2015

Fiber connectivity and bifurcation diagrams of almost toric integrable systems

Tudor Ratiu

We describe the bifurcation diagrams of almost toric integrable Hamiltonian systems on a four dimensional symplectic manifold M, not necessarily compact. We prove that, under a weak assumption, the connectivity of the fibers of the induced singular Lagrang ...

Int Press Boston, Inc2015

Low-Rank Tensor Methods With Subspace Correction For Symmetric Eigenvalue Problems

Daniel Kressner, André Uschmajew, Michael Maximilian Steinlechner

We consider the solution of large-scale symmetric eigenvalue problems for which it is known that the eigenvectors admit a low-rank tensor approximation. Such problems arise, for example, from the discretization of high-dimensional elliptic PDE eigenvalue p ...

Siam Publications2014

Sequences with Minimal Time-Frequency Spreads

Martin Vetterli, Reza Parhizkar, Yann Barbotin

For a given time or frequency spread, one can always find continuous- time signals, which achieve the Heisenberg uncertainty principle bound. This is known, however, not to be the case for discrete-time sequences; only widely spread sequences asymptoticall ...

Ieee2013

Barycentric Bounds in Stochastic Programming: Theory and Application

Daniel Kuhn

The design and analysis of efficient approximation schemes are of fundamental importance in stochastic programming research. Bounding approximations are particularly popular for providing strict error bounds that can be made small by using partitioning tec ...

Springer New York2011

PT-Symmetric Periodic Optical Potentials

In quantum theory, any Hamiltonian describing a physical system is mathematically represented by a self-adjoint linear operator to ensure the reality of the associated observables. In an attempt to extend quantum mechanics into the complex domain, it was r ...

Springer US2011

Universal Bounds And Semiclassical Estimates For Eigenvalues Of Abstract Schrodinger Operators

Joachim Stubbe

We prove trace inequalities for a self-adjoint operator on an abstract Hilbert space, which extend those known previously for Laplacians and Schrodinger operators, freeing them from restrictive assumptions on the nature of the spectrum and allowing operato ...

2010

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