Ergodicity for Nonlinear Stochastic Equations in Variational Formulation

This paper is concerned with nonlinear partial differential equations of the calculus of variation (see [13]) perturbed by noise. Well-posedness of the problem was proved by Pardoux in the seventies (see [14]), using monotonicity methods. The aim of the present work is to investigate the asymptotic behaviour of the corresponding transition semigroup P_t. We show existence and, under suitable assumptions, uniqueness of an ergodic invariant measure ν. Moreover, we solve the Kolmogorov equation and prove the so-called "identite du carre du champs". This will be used to study the Sobolev space W^1,2(H,ν) and to obtain information on the domain of the infinitesimal generator of P_t.     

Distance preconditioning for lattice Dirac operators

We propose a preconditioning of the Dirac operator based on the factorisation of a predefined function related to the decay of the propagator with the distance. We show that it can improve the accuracy of correlators involving heavy quarks at large distances and accelerate the computation of light quark propagators.     

The average path length for a class of scale-free fractal hierarchical lattices: Rigorous results

With the help of the recurrence relations derived from the self-similar structure, we obtain the closed-form solution for the average path length of a class of scale-free fractal hierarchical lattices (HLs) with a general parameter q, which are simultaneously scale-free, self-similar and disassortative. Our rigorous solution shows that the average path length of the HLs grows logarithmically as in the infinite limit of network size of N_t and that they are not small worlds but grow with a power-law relationship to the number of nodes.     

Searching for a near neighbor particle in DSMC cells using pseudo-subcells

LeBeau et al. (2003) [4] introduced the ‘virtual-subcell’ (VSC) method of finding a collision partner for a given DSMC particle in a cell; all potential collision partners in the cell are examined to find the nearest neighbor, which becomes the collision partner. Here I propose a modification of the VSC method, the ‘pseudo-subcell’ (PSC) method, whereby the search for a collision partner stops whenever a ‘near-enough’ particle is found, i.e. whenever another particle is found within the ‘pseudo-subcell’ of radius δ centered on the first particle. The radius of the pseudo-subcell is given by δ = Fd_n, where d_n is the expected distance to the nearest neighbor and F is a constant which can be adjusted to give a desired trade-off between CPU time and accuracy as measured by a small mean collision separation (MCS). For 3D orthogonal cells, of various aspect ratios, d_n/L ≈ 0.746/N^0.383 where N is the number of particles in the cell and L is the cube root of the cell volume. There is a good chance that a particle will be found in the pseudo-subcell and there is a good chance that such a particle is in fact the nearest neighbor. If no particle is found within the pseudo-subcell the closest particle becomes the collision partner.     

Approximation by Gamma type operators

In this study, we introduce newly defined Gamma operators which preserve constants and e^2μ·, μ>0 functions. In accordance with this purpose, we focus on their approximation properties such as uniform convergence, rate of convergence, asymptotic formula, and saturation results. Superior properties of introduced operators have been tested both theoretically and numerically in certain senses to highlight the performance of the new constructions of Gamma operators.     

Invariant sets and Lyapunov pairs for differential inclusions with maximal monotone operators

We give different conditions for the invariance of closed sets with respect to differential inclusions governed by a maximal monotone operator defined on Hilbert spaces, which is subject to a Lipschitz continuous perturbation depending on the state. These sets are not necessarily weakly closed as in [3], [4], while the invariance criteria are still written by using only the data of the system. So, no need to the explicit knowledge of neither the solution of this differential inclusion, nor the semi-group generated by the maximal monotone operator. These invariant/viability results are next applied to derive explicit criteria for a-Lyapunov pairs of lower semi-continuous (not necessarily weakly-lsc) functions associated to these differential inclusions. The lack of differentiability of the candidate Lyapunov functions and the consideration of general invariant sets (possibly not convex or smooth) are carried out by using techniques from nonsmooth analysis.