实对称矩阵束广义特征值逆问题及其最佳逼近

本文讨论实对称矩阵束广义特征值逆问题及其最佳逼近问题。给出了解的一般表达式以及数值算法和算例。推广了文献[1]的结果。讨论了实对称半正定矩阵束广义特征值逆问题的解存在的条件并给山了通解表达式。     

A Multi-Agent Approach for Solving Traveling Salesman Problem

The traveling salesman problem （TSP） is a classical optimization problem and it is one of a class of NP- Problem. This paper presents a new method named multiagent approach based genetic algorithm and ant colony system to solve the TSP. Three kinds of agents with different function were designed in the multi-agent architecture proposed by this paper. The first kind of agent is ant colony optimization agent and its function is generating the new solution continuously. The second kind of agent is selection agent, crossover agent and mutation agent, their function is optimizing the current solutions group. The third kind of agent is fast local searching agent and its function is optimizing the best solution from the beginning of the trial. At the end of this paper, the experimental results have shown that the proposed hybrid ap proach has good performance with respect to the quality of solution and the speed of computation.     

均值误差分布的随机加权逼近：误差为独立和的情况

对一种均模型研究了其均值误差分布的逼近问题，得到了比正态分布逼近精度更高的模拟分布。     

Assembly—Like排队系统的强逼近

本文利用概率论强逼近理论,较为详细地研究了Assembly-Like排队系统。在各种负荷条件下得到了虚等待时间、队长等排队指标的强逼近定理,并给出了嵌入排队中诸指标的强逼近定理。     

一个四阶变分不等式的有限元逼近

一、引言 考虑下述四阶变分不等式其中 (1.2)且α<0<β是常数。 文献[1]中研究了这个变分不等式问题,当Ω(?)R~l是有界光滑区域时,有下述结果: 定理1.1. 若f∈L~p(Ω),p≥2,则问题(1.1)之解u∈W~(3,p)(Ω),且△u∈W_0~(1,p)(Ω)。     

C半群与积分半群的概率型逼近问题

借助Pettis积分、算子值数学期望、连续修正模等概念,以较为简化的形式给出了C半群的概率型逼近式及收敛速度的估计式.此外,还得到了n次积分半群的一个逼近定理.     

球面函数的Cesαro平均的收敛性与强求和及其逼近阶的研究

本文研究了球面上的函数用其Fourier—Laplace级数的一种重要的线性求和法-Cesαro平均来求和与强求和及其相应的逼近与强逼近的阶的研究状况、发展态势和前景展望等．     

广义Liénard系统零解的全局渐近稳定性

研究广义Liénard系统{dx/dt=y,dy/dt=-f(x,y)y-g(x),(E)零解的全局渐近稳定性,获得了该方程的零解全局渐近稳定的充分条件.