A new H(div)-conforming p-interpolation operator  in two dimensions

Alexei Bespalov; Norbert Heuer

The search session has expired. Please query the service again.

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 (η) = \sum_{i \in 𝐙^{d}} (\frac{1}{2} a_{i} \frac{\partial^{2} f}{\partial η_{i}^{2}} + b_{i} \frac{\partial f}{\partial η_{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) = \int_{[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 \subseteq V$ if the majority of the elements of the neighborhood of (including itself) belong to . The set is a in if every vertex $i \in V$ is controlled by . Given a set $M \subseteq V$ and two graphs = ( $V, E_{1}$ ) and = ( $V, E_{2}$ ) where $E_{1} \subseteq E_{2}$ , the consists of deciding whether there exists a sandwich graph = () (, a graph where $E_{1} \subseteq E \subseteq 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: