Displaying similar documents to “A new H(div)-conforming p-interpolation operator in two dimensions”

Uniqueness of invariant product measures for elliptic infinite dimensional diffusions and particle spin systems

Alejandro F. Ramírez (2010)

ESAIM: Probability and Statistics

Similarity:

Consider an infinite dimensional diffusion process process on , where is the circle, defined by the action of its generator on ) local functions as L f ( η ) = ∑ i ∈ 𝐙 d 1 2 a i ∂ 2 f ∂ η i 2 + b i ∂ f ∂ η i . Assume that the coefficients, and are smooth, bounded, finite range with uniformly bounded second order partial derivatives, that is only a function of η i and that inf i , η a i ( η ) > 0 . Suppose is an invariant product measure. Then, if is the Lebesgue measure or if ,...

Asymmetric heteroclinic double layers

Michelle Schatzman (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

Let be a non-negative function of class C from 2 to , which vanishes exactly at two points and . Let (, ) be the set of functions of a real variable which tend to at -∞ and to at +∞ and whose one dimensional energy E 1 ( v ) = ∫ W ( v ) + | v ' | 2 / 2 x is finite. Assume that there exist two isolated minimizers and of the energy over (, ). Under a mild coercivity condition on the potential and a generic spectral condition on the linearization...

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

A vertex of a graph = () is said to be by M ⊆ V if the majority of the elements of the neighborhood of  (including itself) belong to . The set is a in if every vertex i ∈ V is controlled by . Given a set M ⊆ V and two graphs = ( V , E 1 ) and = ( V , E 2 ) where E 1 ⊆ E 2 , the consists of deciding whether there exists a sandwich graph = () (, a graph where E 1 ⊆ E ⊆ E 2 ) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich...

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

A vertex of a graph = () is said to be by M ⊆ V if the majority of the elements of the neighborhood of  (including itself) belong to . The set is a in if every vertex i ∈ V is controlled by . Given a set M ⊆ V and two graphs = ( V , E 1 ) and = ( V , E 2 ) where E 1 ⊆ E 2 , the consists of deciding whether there exists a sandwich graph = () (, a graph where E 1 ⊆ E ⊆ E 2 ) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich...