确定线性偏微分方程组可积系统的对合特征集方法

基于Ritt-Wu特征集方法和Riquier-Janet理论,给出一种将线性微分方程组化成简单标准形式的有效算法．该算法通过消去冗余和添加可积条件获得线性微分方程组的完全可积系统(有形式幂级数解)或不相容判定．该算法不仅适用于常系数的线性偏微分方程组,而且对于变系数(以函数为系数)仍然有效．作者还给出了完全可积系统判定定理及其严格证明．     

Pearson-χ~2距离的若干性质

本文对数理统计中常用的 Pearson- χ2距离的分析特性进行了讨论 ,得到了这一距离的一些解析性质 ,最后我们还给出了几个常用距离的关系 .     

几种模糊传递关系的收敛性

本文对几种模糊传递关系进行比较 ,从一个侧面说明了用于构造偏好关系的模糊关系应是互逆关系 .文中证明了对任意的 n阶互逆传递模糊关系 R,必有 Rn=Rn+1 .     

等差数列的一个性质及其应用

设数列 {an}是等差数列 ,公差为d ,则an + 2 ·an-a2 n + 1=-d2 .此结论的证明不难 .an + 2 ·an-a2 n + 1=(an + 1+d) (an + 1-d) -a2 n + 1=a2 n + 1-d2 -a2 n + 1=-d2 .若从等差数列的特征去思考 ,它有an + 2+an=2an + 1这一递推关系式 ,那么此结论是否有其一般的规律呢 ?思考 1　在数列 {an}中 ,若an + 2 +an=pan + 1(n∈N ,p为非零常数 ) ,则an + 2 ·an-a2 n + 1=?探索　设bn=an + 2 ·an-a2 n + 1,则bn + 1-bn =an + 3 ·an + 1-a2 n + 2 -an + 2 ·an+a2 n + 1=an + 1(an + 3 +an + 1) -an + 2(an + 2 +an) =pan + 1·an + 2 - pan…     

一类非线性椭圆问题的schwarz算法

其中考虑下述泛函最小问题:求u∈W01,α(Ω),使F(u)=     

D-N交替法与Schwartz交替法的收敛关系分析

This paper has demonstrated that the Schwartz alternating process must converge if D-N alternating process has converged. Its technique is that the overlapping regions in Schwartz alternating process are considered as independent domains, then Schwartz alternating process could be transformed into D-N alter-nating process. Finally the convergence estimation of Schwartz alternating process could be obtained. The results show that its convergence rate is same as that of D-N alternating process.     

S[a,b]类中边界Nevanlinna-Pick插值(Ⅱ)

继续作者最近的研究,用所谓的Hankel向量方法建立S[a,b]函数类中带边界插值数据的Nevanlinna-Pick插值问题与[a,b]上的某种带约束条件的Hausdorff矩量问题之间解集之间明确的一一对应关系.通过N[a,b]函数类与S[a,b]函数类之间的联系,从而由BNP(N[a,b])问题的可解性准则和解的参数化描述获得BNP(S[a,b)问题的可解性准则和解的参数化表示.     

B值随机变量阵列加权和的完全收敛性

设{X_ni:1≤i≤n,n≥1}为行间独立的B值r.v.阵列,g(z)是指数为1/p的正则变化函数,r>0,{ani 1≤t≤n,n≥1}为实数阵列,本文得到了使(?)成立的条件,推广并改进了Stout及Sung等的著名结论.     

Conservation Laws in sine—Gordon Equation

There are two conservation quantities needed to derive conservation laws of sine-Gordon equation in a frame of laboratory reference.one of them could be derived easily with a standard process,but the other could not .After the gauge transformation e^-iθσ2/2is introduced,we simply obtain the other one without any questionable assumption.     

Dynamical Convergence Trajectory in Networks

It is well known that topology and dynamics are two major aspects to determine the function of a network. We study one of the dynamic properties of a network： trajectory convergence, i.e. how a system converges to its steady state. Using numerical and analytical methods, we show that in a logical-like dynamical model, the occurrence of convergent trajectory in a network depends mainly on the type of the fixed point and the ratio between activation and inhibition links. We analytically proof that this property is induced by the competition between two types of state transition structures in phase space： tree-like transition structure and star-like transition structure. We show that the biological networks, such as the cell cycle network in budding yeast, prefers the tree-like transition structures and suggest that this type of convergence trajectories may be universal.