Displaying similar documents to “Approximation par des morphismes de chaînes et points fixes des applications multivoques”

Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances

Marc Demange, Vangelis Paschos (2010)

RAIRO - Operations Research

Similarity:

This paper is the continuation of the paper “” where a new formalism for polynomial approximation and its basic tools allowing an “absolute” (individual) evaluation the approximability properties of -hard problems have been presented and discussed. In order to be used for exhibiting a structure for the class  (the optimization problems of ), these tools must be enriched with an “instrument” allowing comparisons between approximability properties of different problems (these comparisons...

Fonction de Correlation pour des Mesures Complexes

Wei Min Wang (1998-1999)

Séminaire Équations aux dérivées partielles

Similarity:

We study a class of holomorphic complex measures, which are close in an appropriate sense to a complex Gaussian. We show that these measures can be reduced to a product measure of real Gaussians with the aid of a maximum principle in the complex domain. The formulation of this problem has its origin in the study of a certain class of random Schrödinger operators, for which we show that the expectation value of the Green’s function decays exponentially.