关于多元Gauss—Weierstrass算子的一致逼近

本文利用一类 K—泛函和光滑模的等价性给出了二元 Gauss—weierstrass 算子在一致逼近意义的正定理、逆空理和特征性。     

我院申请国家自然科学基金项目情况分析

本文分析了“八五”以来国家自然科学基金项目的现状、前景及我院申报国家自然科学基金项目的获得资助率，并从六个方面探讨提高我院申报国家自然科学基金项目获得资助率的措施与方法．     

The Existence of Periodic Orbits for Higher Dimensional Autonomous Systemswith Small Perturbations

ＴｈｅＥｘｉｓｔｅｎｃｅｏｆＰｅｒｉｏｄｉｃＯｒｂｉｔｓｆｏｒＨｉｇｈｅｒＤｉｍｅｎｓｉｏｎａｌＡｕｔｏｎｏｍｏｕｓＳｙｓｔｅｍｓｗｉｔｈＳｍａｌｌＰｅｒｔｕｒｂａｔｉｏｎｓＪｉａｎｇＬｉｑｉｎｇ（蒋里强）；ＺｈｏｕＹｉ（周毅）；ＦａｎＹｅ（范晔）（...     

Nonlinear and chaotic oscillations of a constrained cantilevered pipe conveying fluid: A full nonlinear analysis

In this paper, the planar dynamics of a nonlinearly constrained pipe conveying fluid is examined numerically, by considering the full nonlinear equation of motions and a refined trilinear-spring model for the impact constraints—completing the circle of several studies on the subject. The effect of varying system parameters is investigated for the two-degree-of-freedom (N=2) model of the system, followed by less extensive similar investigations forN=3 and 4. Phase portraits, bifurcation diagrams, power spectra and Lyapunov exponents are presented for a selected set of system parameters, showing some rather interesting, and sometimes unexpected, results. The numerical results are compared with experimental ones obtained previously. It is found that in the parameter space that includesN, there exists a subspace wherein excellent qualitative, and reasonably good (N=2) to excellent (N=4) quantitative agreement with experiment. In the latter case, excellent agreement is not only obtained in the threshold flow velocities (u) for the key bifurcations, but the inclusion of the nonlinear terms improves agreement with experiment in terms of amplitudes of motion and by capturing features of behaviour not hitherto predicted by theory.     

几种约束广义逆矩阵的有限算法

1引言与引理众所周知，关于非奇异方阵的正则逆的有限算法是由Faddeev大给在1949年之前提出的，这就是著名的Faddeev算法[1，P…334-336]。自从五十年代中期广义逆矩阵的研究复兴与发展以来，有不少学者提出了关于广义逆矩阵的有限算法。第一个给出关于广义逆矩     

有限群为ρ-幂零群的一些充要条件

在文献[1]研究Ⅱ-超中心的基础上,取Ⅱ={p},即利用p-超中心得到了ρ-幂零群的另外一些充要条件,并推广了文献[2]介绍的ITo定理.     

KNA算法计算单零点多项式全部零点的复杂性

证明用KNA算法计算n次单零点多项式全部零点所需的多项式计值次数不超过O(n~3 log_2(n/ε)),其中ε是计算精度。     

To the problem of energy recuperation in gyrotrons

A relatively high level of the minimal electron energy at the gyrotron output even at very large spread in pitch factor is explained. An estimation of the recuperation efficiency, which can be obtained due to this effect, is given.