The Boundedness of Composition Operators on Triebel–Lizorkin and Besov Spaces with Different Homogeneities

In this paper, we introduce new Triebel–Lizorkin and Besov Spaces associated with the different homogeneities of two singular integral operators. We then establish the boundedness of composition of two Calder′on–Zygmund singular integral operators with different homogeneities on these Triebel–Lizorkin and Besov spaces.     

Sub-exponential graph coloring algorithm for stencil-based Jacobian computations

Partial differential equations can be discretized using a regular Cartesian grid and a stencil-based method to approximate the partial derivatives. The computational effort for determining the associated Jacobian matrix can be reduced. This reduction can be modeled as a (grid) coloring problem. Currently, this problem is solved by using a heuristic approach for general graphs or by developing a formula for every single stencil. We introduce a sub-exponential algorithm using the Lipton–Tarjan separator in a divide-and-conquer approach to compute an optimal coloring. The practical relevance of the algorithm is evaluated when compared with an exponential algorithm and a greedy heuristic.     

Inclusion–exclusion principle for belief functions

The inclusion–exclusion principle is a well-known property in probability theory, and is instrumental in some computational problems such as the evaluation of system reliability or the calculation of the probability of a Boolean formula in diagnosis. However, in the setting of uncertainty theories more general than probability theory, this principle no longer holds in general. It is therefore useful to know for which families of events it continues to hold. This paper investigates this question in the setting of belief functions. After exhibiting original sufficient and necessary conditions for the principle to hold, we illustrate its use on the uncertainty analysis of Boolean and non-Boolean systems in reliability.     

[3, 3] Padé approximation method for solving space fractional Fokker–Planck equations

The fractional Fokker–Planck equation has been used in various areas of engineering and physics. In this paper, we proposed a novel numerical scheme for solving the space fractional Fokker–Planck equation with the help of the [3, 3] Padé approximation. It is proved that the numerical method is unconditionally stable in view of the matrix analysis method. Finally, a numerical example is proposed to prove the effectiveness of the numerical scheme.     

DC3 and Li–Yorke chaos

There are three versions of distributional chaos, namely DC1, DC2 and DC3. By using an example of constant-length substitution system, we show that DC3 need not imply Li–Yorke chaos. (In this paper, chaos means the existence of an uncountable scrambled set of the corresponding type, while the existing example only deals with a single pair of points.)