求解非光滑鞍点问题的黄金比率原始对偶算法

该文提出了一类新的黄金比率原始对偶算法求解非光滑鞍点问题,该算法是完全可分裂的.在一定的假设下,证明了由算法迭代产生的序列收敛到问题的解,同时证明了O(1/N)遍历收敛率.数值实验表明该文提出的算法比Zhu,Liu和Tran-Ding文中的算法有更少的迭代步数和计算机耗时.

立式捏合机混合釜内流场遍历性研究

流场遍历是流场混合的必要条件。根据立式捏合机混合釜内螺旋桨刃尖的运动特征,定义了穿越、遍历率和遍历时间等基本概念;提出了用遍历率和遍历时间来评价流场遍历性能;分析了螺旋桨的自转公转转速比对流场遍历率和遍历时间的影响。研究结果表明:螺旋桨的自转公转转速比对流场遍历性能具有极大影响,并可以通过比较不同转速比所对应的遍历率大小得到较优的螺旋桨的自转公转转速比;采用双螺旋桨能明显提高系统遍历率,降低遍历时间。

A Note on a Misuirewicz's Theorem

In this paper,we improve a Misuirewicz's theorem and give a new proof of small conjecture on topological entropy.

Markov branching processes with immigration-migration and resurrection

We consider a modified Markov branching process incorporating with both state-independent immigration-migration and resurrection. The effect of state-independent immigration-migration is firstly in- vestigated in detail. The explicit expressions for the extinction probabilities and mean extinction times are presented. The ergodicity and stability properties of the process incorporating with resurrection structure are then investigated. The conditions for recurrence, ergodicity and exponential ergodicity are obtained. An explicit expression for the equilibrium distribution is also presented. As a preparation, the criteria for regularity and uniqueness for such structure are firstly established.