Fibonacci数列倒数的无穷和

利用初等方法以及取整函数的性质研究了Fibonacci数列三次倒数的求和问题,获得了该和式倒数取整后的确切值,也就是给出了一个包含Fibonacci数列有趣的恒等式.     

求解用户平衡与系统最优模型的新算法

近些年,国内外许多学者针对交通规划提出了诸如用户平衡(UE)、系统最优(SO)等模型,但由于交通网络的复杂性,这些模型的求解相对困难,考虑到在一般的UE、S0模型中,其约束条件为线性约束与非负约束,给出一种求解交通规划模型的新算法,算法不需使用任何线搜索,只要通过求解一个简单的二次规划问题得到下降方向即可,最后,将该算法应用到简单的交通网络中,并通过与相继平均法(MSA)进行比较,验证了该算法的收敛速度较快。     

BL代数的fantastic滤子和normal滤子

滤子是研究逻辑代数的有效工具.本文研究了BL代数的fantastic和normal滤子的等价条件,得到了在MV-代数中两种滤子之间的等价性,给出了两个公开问题:"在什么样的合适条件下,一个normal滤子成为一个fantastic滤子?"和"在什么合适的条件下,normal滤子的拓展性成立?"结论成立的一种条件.     

A criterion for subnormality of subgroups in finite groups

Based on Wielandt’s criterion for subnormality of subgroups in finite groups, we study 2-maximal subgroups of finite groups and present another subnormality criterion in finite solvable groups.     

A minimum entropy principle of high order schemes for gas dynamics equations

The entropy solutions of the compressible Euler equations satisfy a minimum principle for the specific entropy (Tadmor in Appl Numer Math 2:211–219, 1986). First order schemes such as Godunov-type and Lax-Friedrichs schemes and the second order kinetic schemes (Khobalatte and Perthame in Math Comput 62:119–131, 1994) also satisfy a discrete minimum entropy principle. In this paper, we show an extension of the positivity-preserving high order schemes for the compressible Euler equations in Zhang and Shu (J Comput Phys 229:8918–8934, 2010) and Zhang et?al. (J Scientific Comput, in press), to enforce the minimum entropy principle for high order finite volume and discontinuous Galerkin (DG) schemes.     

离散神经网络指数稳定改进条件

研究了一类时滞离散神经网络指数稳定及鲁棒稳定问题.结合线性矩阵不等式技术,构造了一个新的广义李亚普诺夫函数,得到了新的指数稳定条件.数值算例表明与以往文献中的结果相比,新准则具有较弱的保守性.     

The structure on invariant measures of <Emphasis Type="Italic">C</Emphasis><Superscript>1</Superscript> generic diffeomorphisms

Let Λ be an isolated non-trivial transitive set of a C 1 generic diffeomorphism f ∈ Diff (M ). We show that the space of invariant measures supported on Λ coincides with the space of accumulation measures of time averages on one orbit. Moreover, the set of points having this property is residual in Λ (which implies that the set of irregular+ points is also residual in Λ). As an application, we show that the non-uniform hyperbolicity of irregular+ points in Λ with totally 0 measure (resp., the non-uniform hyperbolicity of a generic subset in Λ) determines the uniform hyperbolicity of Λ.     

A Note on L（2, 1）-labelling of Trees

An L(2,1)-labelling of a graph G is a function from the vertex set V (G) to the set of all nonnegative integers such that |f(u) f(v)| ≥ 2 if d G (u,v)=1 and |f(u) f(v)| ≥ 1 if d G (u,v)=2.The L(2,1)-labelling problem is to find the smallest number,denoted by λ(G),such that there exists an L(2,1)-labelling function with no label greater than it.In this paper,we study this problem for trees.Our results improve the result of Wang [The L(2,1)-labelling of trees,Discrete Appl.Math.154 (2006) 598-603].     

Convergence Rates in the Law of Large Numbers under Sublinear Expectations

In this note, we study convergence rates in the law of large numbers for independent and identically distributed random variables under sublinear expectations. We obtain a strong L^p-convergence version and a strongly quasi sure convergence version of the law of large numbers.     

Flexible incomplete Cholesky factorization with multi‐parameters to control the number of nonzero elements in preconditioners

An incomplete Cholesky (IC) factorization with multi‐parameters is presented. The marked virtue of the proposed IC factorization algorithm is to dynamically control the number of nonzero elements in each column of the IC factorization preconditioner L with the help of these involved parameters. Parameter setting strategies are also given. Numerical results show that the total computing time for both computation of the preconditioner L and iterative solution is evidently reduced for almost all test matrices. In general, these parameters can obviously enhance the effectiveness and performance of the IC factorization. Copyright © 2011 John Wiley & Sons, Ltd.