Construction of recurrent bivariate fractal interpolation surfaces and computation of their box-counting dimension

Recurrent bivariate fractal interpolation surfaces (RBFISs) generalise the notion of affine fractal interpolation surfaces (FISs) in that the iterated system of transformations used to construct such a surface is non-affine. The resulting limit surface is therefore no longer self-affine nor self-similar. Exact values for the box-counting dimension of the RBFISs are obtained. Finally, a methodology to approximate any natural surface using RBFISs is outlined.     

Backbone fractal dimension and fractal hybrid orbital of protein structure

Fractal geometry analysis provides a useful and desirable tool to characterize the configuration and structure of proteins. In this paper we examined the fractal properties of 750 folded proteins from four different structural classes, namely (1) the α-class (dominated by α-helices), (2) the β-class (dominated by β-pleated sheets), (3) the (α/β)-class (α-helices and β-sheets alternately mixed) and (4) the (α + β)-class (α-helices and β-sheets largely segregated) by using two fractal dimension methods, i.e. “the local fractal dimension” and “the backbone fractal dimension” (a new and useful quantitative parameter). The results showed that the protein molecules exhibit a fractal behavior in the range of 1 ? N ? 15 (N is the number of the interval between two adjacent amino acid residues), and the value of backbone fractal dimension is distinctly greater than that of local fractal dimension for the same protein. The average value of two fractal dimensions decreased in order of α > α/β > α + β > β. Moreover, the mathematical formula for the hybrid orbital model of protein based on the concept of backbone fractal dimension is in good coincidence with that of the similarity dimension. So it is a very accurate and simple method to analyze the hybrid orbital model of protein by using the backbone fractal dimension.     

一个分形函数的分数阶微积分函数

Based on the combination of fractional calculus with fractal functions, a new type of is introduced； the definition, graph, property and dimension of this function are discussed.     

On a class of Besicovitch functions to have exact box dimension: A necessary and sufficient condition

Let 1 < s < 2, λ_k > 0 with λ_k → ∞ satisfy λ_k+1/λ_k ≥ λ > 1. For a class of Besicovich functions B(t) = sin λ_kt, the present paper investigates the intrinsic relationship between box dimension of their graphs and the asymptotic behavior of {λ_k}. We show that the upper box dimension does not exceed s in general, and equals to s while the increasing rate is sufficiently large. An estimate of the lower box dimension is also established. Then a necessary and sufficient condition is given for this type of Besicovitch functions to have exact box dimensions: for sufficiently large λ, dim _BΓ(B) = dim _BΓ(B) = s holds if and only if lim_n→∞ = 1. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Dimensions of ℝ-trees and self-similar fractal spaces of nonpositive curvature

We study various dimensions of spaces with nonpositive curvature in the A. D. Alexandrov sense, in particular, of ?-trees. We find some conditions necessary and sufficient for the metric space to be an ?-tree and clarify relations between the topological, Hausdorff, entropy, and rough dimensions. We build the examples of ?-trees and CAT(0)-spaces in which strict inequalities between the topological, Hausdorff, and entropy dimensions hold; we also show that the Hausdorff and entropy dimensions can be arbitrarily large while the topological dimension remains fixed.     

A note on the finite fractal dimension of the global attractors for dissipative nonlinear Schrödinger‐type equations

In this article, we present, throughout two basic models of damped nonlinear Schrödinger (NLS)–type equations, a new idea to bound from above the fractal dimension of the global attractors for NLS‐type equations. This could answer the following open issue: consider, for instance, the classical one‐dimensional cubic nonlinear Schrödinger equation $$u_t+i{u}_{xx}+i|u{|}^{2}u+\gamma u=f,f\in {\mathrm{??}}^2(?).$$ “How can we bound the fractal dimension of the associate global attractor without the need to assume that the external forcing term f has some decay at infinity (that is belonging to some weighted Lebesgue space)?”     

A sharp estimate and change on the dimension of the attractor for singular semilinear parabolic equations

We consider the semilinear reaction diffusion equation

An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing

An improved parallel hybrid bi-conjugate gradient method (IBiCGSTAB(2) method, in brief) for solving large sparse linear systems with nonsymmetric coefficient matrices is proposed for distributed parallel environments. The method reduces five global synchronization points to two by reconstructing the BiCGSTAB(2) method in [G.L.G. Sleijpen, H.A. van der Vorst, Hybrid bi-conjugate gradient methods for CFD problems, in: M. Hafez, K. Oshima (Eds.), Computational Fluid Dynamics Review 1995, John Wiley & Sons Ltd, Chichester, 1995, pp. 457–476] and the communication time required for the inner product can be efficiently overlapped with useful computation. The cost is only slightly increased computation time, which can be ignored, compared with the reduction of communication time. Performance and isoefficiency analysis shows that the IBiCGSTAB(2) method has better parallelism and scalability than the BiCGSTAB(2) method. Numerical experiments show that the scalability can be improved by a factor greater than 2.5 and the improvement in parallel communication performance approaches 60%.     

Rd中一类齐次Moran集的盒维数

给定Rd 中的Moran集类 ,本文证明了对介于该集类中元素的上盒维数的最大值和最小值之间的任何一个数值s,总存在该集类中的一个元素 ,其上盒维数等于s,对下盒维数、修正的下盒维数也有类似的性质成立 ,从而给文 [1 ]中的猜想 1一个肯定的回答 .此外 ,还讨论了齐次Cantor集和偏次Cantor集盒维数存在性之间的关系 .     

An efficient spectral method and rigorous error analysis based on dimension reduction scheme for fourth order problems

In this paper, we propose an effective spectral method based on dimension reduction scheme for fourth order problems in polar geometric domains. First, the original problem is decomposed into a series of one‐dimensional fourth order problems by polar coordinate transformation and the orthogonal properties of Fourier basis function. Then the weak form and the corresponding discrete scheme of each one‐dimensional fourth order problem are derived by introducing polar conditions and appropriate weighted Sobolev spaces. In addition, we define the projection operators in the weighted Sobolev space and give its approximation properties, and further prove the error estimation of each one‐dimensional fourth order problem. Finally, we provide some numerical examples, and the numerical results show the effectiveness of our algorithm and the correctness of the theoretical results.     

Resolving subcategories of triangulated categories and relative homological dimension

We introduce and study (pre)resolving subcategories of a triangulated category and the homological dimension relative to these subcategories. We apply the obtained properties to relative Gorenstein categories.     

The application of dimension split method in the three‐dimensional heat equation

A dimension splitting method (DSM) with Crank–Nicolson time discrete strategy for a three‐dimensional heat equation is proposed. The basic idea is to simulate the three‐Dimensional problem by numerically solving a series of two‐dimensional problems in parallel fashion. Convergence and error estimation for the DSM scheme are derived in the paper. Numerical experiments demonstrate the feasibility and efficiency of the DSM scheme. Copyright © 2016 John Wiley & Sons, Ltd.     

An approximation method to estimate the Hausdorff measure of the Sierpinski gasket

In this paper, we firstly define a decreasing sequence {P^n(S)} by the generation of the Sierpinski gasket where each P^n(S) can be obtained in finite steps. Then we prove that the Hausdorff measure H^8(S) of the Sierpinski gasket S can be approximated by {P^n(S)} with P^n(S)/(1 1/2^n-3)s ≤ H^8(S)≤ Pb(S).An algorithm is presented to get P^n(S) for n≤ 5. As an application, we obtain the best lower bound of H^8(S) till now: H^8(S) ≥ 0.5631.     

An extended TODIM method for multiple attribute group decision‐making based on 2‐dimension uncertain linguistic Variable

The significant characteristic of the TODIM (an acronym in Portuguese of Interactive and Multiple Attribute Decision Making) method is that it can consider the bounded rationality of the decision makers. However, in the classical TODIM method, the rating of the attributes only can be used in the form of crisp numbers. Because 2‐dimension uncertain linguistic variables can easily express the fuzzy information, in this article, we extend the TODIM method to 2‐dimension uncertain linguistic information. First of all, the definition, characteristics, expectation, comparative method and distance of 2‐dimension uncertain linguistic information are introduced, and the steps of the classical TODIM method for Multiple attribute decision making (MADM) problems are presented. Second, on the basis of the classical TODIM method, the extended TODIM method is proposed to deal with MADM problems in which the attribute values are in the form of 2‐dimension uncertain linguistic variables, and detailed decision steps are given. Its significant characteristic is that it can fully consider the bounded rationality of the decision makers, which is a real action in real decision making. Finally, a numerical example is provided to verify the developed approach and its practicality and effectiveness. © 2014 Wiley Periodicals, Inc. Complexity 21: 20–30, 2016     

The distributional dimension of fractals

In the book [1] H.Triebel introduces the distributional dimension of fractals in an analytical form and proves that： for Г as a non-empty set in R^n with Lebesgue measure ｜Г｜ = 0, one has dimH Г = dimD Г, where dimD Г and dimH Г are the Hausdorff dimension and distributional dimension, respectively. Thus we might say that the distributional dimension is an analytical definition for Hausdorff dimension. Therefore we can study Hausdorff dimension through the distributional dimension analytically. By discussing the distributional dimension, this paper intends to set up a criterion for estimating the upper and lower bounds of Hausdorff dimension analytically. Examples illustrating the criterion are included in the end.     

估计海冰厚度函数的一种辨识方法

提出一种采用海冰和海水温度观测数据来估计海冰厚度的辨识方法, 避免了因使用厚度数据所带来的种种局限性. 首先建立一个拟线性海冰-海水热力学系统, 得到了系统解的存在唯一性; 然后以该系统中描述海冰厚度函数的参数为辨识量, 以系统输出的温度和实际观测温度的偏差为目标泛函, 建立了以目标泛函为最小的参数辨识模型; 最后构造了以半隐式差分格式、遗传算法和Hooke-Jeeves算法相结合的数值算法, 得到了海冰厚度函数, 并对辨识量做了敏感性分析. 结果表明: 这种方法是有效可行的.     

猩红热和流脑流行过程的混沌分维研究

以辽宁省本溪市 1 955～ 1 996年的猩红热和流脑逐月发病的数据为根据 ,利用混沌动力学中“相空间技术”,对流行病过程进行能量谱分析及混沌分析 ,发现流脑的流行过程是混沌的 ,猩红热的流行过程是周期的 .本溪流脑数据的混沌迭代模型是 Xt+1=r X2texp{ -0 .0 0 3394 ( Xt-1 4 .4 1 0 96) 2 } ,在模型参数变化范围内 ,经历了周期状态、混沌状态、吸引不动的稳定状态之间的转移 ,这表明流脑流行过程是复杂的 ,给出流行的“阈值”,以控制其流行涨落 ;求出流脑的关联分维是 2 .82 1 .为时间序列的分析研究提供了一种新方法 .     

A improved F‐expansion method and its application to Kudryashov–Sinelshchikov equation

On the basis of the F‐expansion method with a new sub‐equation and Exp‐function method, an improved F‐expansion method is introduced. As illustrative examples, the exact solutions expressed by exponential function, hyperbolic function of Kudryashov–Sinelshchikov equation for arbitrary α,β are derived. Some previous results are extended. The method is straightforward, concise and is a promising and powerful method for other nonlinear evolution equations in mathematical physics. Copyright © 2013 John Wiley & Sons, Ltd.