Investigation of Galilean invariance of multi-phase lattice Boltzmann methods

We examine the Galilean invariance of standard lattice Boltzmann methods for two-phase fluids. We show that the known Galilean invariant term that is cubic in the velocities, and is usually neglected, is a major source of Galilean invariance violations. We show that incorporating a correction term can improve the Galilean invariance of the method by up to two orders of magnitude for large velocities. We found that this is true in particular for methods in which the interactions are incorporated through a forcing term. Methods in which interactions are incorporated through a non-ideal pressure tensor only benefit for large velocities.     

A study of predator–prey models with the Beddington–DeAnglis functional response and impulsive effect

In this paper, the predator–prey system with the Beddington–DeAngelis functional response is developed, by introducing a proportional periodic impulsive catching or poisoning for the prey populations and a constant periodic releasing for the predator. The Beddington–DeAngelis functional response is similar to the Holling type II functional response but contains an extra term describing mutual interference by predators. This model has the potential to protect predator from extinction, but under some conditions may also lead to extinction of the prey. That is, the system exists a locally stable prey-eradication periodic solution when the impulsive period satisfies an inequality. The condition for permanence is established via the method of comparison involving multiple Liapunov̀ functions. Further, by numerical simulation method the influences of the impulsive perturbations and mutual interference by predators on the inherent oscillation are investigated. With the increasing of releasing for the predator, the system appears a series of complex phenomenon, which include (1) period-doubling, (2) chaos attractor, (3) period-halfing. (4) non-unique dynamics (meaning that several attractors coexist).     

Synchronization of complex dynamical networks with time delays

In the present paper, two kinds of dynamical complex networks are considered. The first is that elements of every node have different time delays but all nodes in such networks have the same time-delay vector. The second is that different nodes have different time-delay vectors, and the elements of each node also have different time delays. Corresponding synchronization theorems are established. Numerical examples show the efficiency of the derived theorems.     

Fenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappings

Recently, S. Reich and S. Simons provided a novel proof of the Kirszbraun-Valentine extension theorem using Fenchel duality and Fitzpatrick functions. In the same spirit, we provide a new proof of an extension result for firmly nonexpansive mappings with an optimally localized range.

     

Jensen’s Inequality for Backward Stochastic Differential Equations

Abstract Under the Lipschitz assumption and square integrable assumption on g, the author proves that Jensen’s inequality holds for backward stochastic differential equations with generator g if and only if g is independent of y, g(t, 0) ≡ 0 and g is super homogeneous with respect to z. This result generalizes the known results on Jensen’s inequality for g- expectation in [4, 7–9]. *Project supported by the National Natural Science Foundation of China (No.10325101) and the Science Foundation of China University of Mining and Technology.     

Selected action density to speed up the computation of the nonlinear wave-wave interactions

This paper deals with the development of a numerical method to study the non-linear wave-wave interactions in oceans. Based on works from Webb-Tracy-Resio, the Hasselmann’s non-linear mathematical model is reviewed numerically. With this theory and the selection of action density domain, a program to reduce time of computation has been developed. Results from new computation are displayed graphically and compared with previous program. This work augments our understanding better about the non-linear process of wave-wave interactions and it improves the numerical computations to obtain efficiency in operational forecast.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

On the structure of finite coverings of compact connected groups

Finite-sheeted covering mappings onto compact connected groups are studied. We show that for a covering mapping from a connected Hausdorff topological space onto a compact (in general, non-abelian) group there exists a topological group structure on the covering space such that the mapping becomes a homomorphism of groups. To prove this fact we construct an inverse system of covering mappings onto Lie groups which approximates the given covering mapping. As an application, it is shown that a covering mapping onto a compact connected abelian group G must be a homeomorphism provided that the character group of G admits division by degree of the mapping. We also get a criterion for triviality of coverings in terms of means and prove that each finite covering of G is equivalent to a polynomial covering.