Bridge density functional approximation for non-uniform hard core repulsive Yukawa fluid

In this work, a bridge density functional approximation （BDFA） （J. Chem. Phys. 112, 8079 （2000）） for a nonuniform hard-sphere fluid is extended to a non-uniform hard-core repulsive Yukawa （HCRY） fluid. It is found that the choice of a bulk bridge functional approximation is crucial for both a uniform HCRY fluid and a non-uniform HCRY fluid. A new bridge functional approximation is proposed, which can accurately predict the radial distribution function of the bulk HCRY fluid. With the new bridge functional approximation and its associated bulk second order direct correlation function as input, the BDFA can be used to well calculate the density profile of the HCRY fluid subjected to the influence of varying external fields, and the theoretical predictions are in good agreement with the corresponding simulation data. The calculated results indicate that the present BDFA captures quantitatively the phenomena such as the coexistence of solid-like high density phase and low density gas phase, and the adsorption properties of the HCRY fluid, which qualitatively differ from those of the fluids combining both hard-core repulsion and an attractive tail.     

Baskakov算子加权逼近的收敛阶

本文讨论了Ｂａｓｋａｋｏｖ算子加Ｊａｃｏｂｉ权逼近的收敛性，首先指出了按通常的加权范数，Ｂａｓｋａｋｏｖ算子是无界的。然后引入一种新的范数，在此范数下Ｂａｓｋａｋｏｖ算子具有压缩性，最后借助于Ｋ－泛函，我们着重讨论了它的特征刻划问题。     

多背包问题的半定松驰算法

The multiple knapsack problem denoted by MKP (B,S,rn,n) can be defined as follows. A set B of n items and a set S of rn knapsacks are given such that each item j has a profit pi and weight wj,and each knapsack i has a capacity Ci. The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks. MKP (B,S,m,n) is strongly NP-Complete and no polynomial time approximation algorithm can have an approximation ratio better than 0.5. In the last ten years,semi-definite programming has been empolyed to solve some combinatorial problems successfully. This paper firstly presents a semi-definite relaxation algorithm (MKPS) for MKP (B,S,rn,n). It is proved that MKPS have a approximation ratio better than 0. 5 for a subclass of MKP (B,S,m,n) with n≤100, m≤5 and max^nj=1{wj}/min^mi=1={Ci}≤2/3.     

函数的逼近及其在下半连续函数可微性中的应用

通过函数的下卷积函数列的逼近方法,在变分原理中从扰动最小值点集的“大小”入手,研究了下半连续函数的可微性。     

ON THE CONVERGENCE OF THE PARABOLIC APPROXIMATION OF A CONSERVATION LAW IN SEVERAL SPACE DIMENSIONS

1.IntrodnctionWegiveaproofofthestrongconvergenceinofthesolutionoftheparabolicapproximationtowardstheentropicsolutiontothescalarconservationlawwhereuo(RN),udenotessomeapproximationofuosuchthatandthefluxfsatisfiesTheconvergenceoftheapproximatesolutions...     

Tchebycheff-Fourier级数的Vallce Poussin平均逼近函数类Lip α

本文考虑用ＴｃｈｅｂｙｃｈｅｆＦｏｕｒｉｅｒ级数的ＶａｌéｅＰｏｕｓｉｎ平均逼近函数类Ｌｉｐα,在ｆ（ｘ）∈Ｃ［－１,１］时获得了逼近阶及逼近误差的表达式,推广并较大地改进了文献［１,２］中的有关结果．     

Toeplitz预条件子的统一构造与性能分析

１．引言考虑线性方程组ＴＮｘ＝ｂ（１．１）其中ＴＮ＝（ｔｉ,ｊ）是ＮｘＮ对称正定（ＳＰＤ）Ｔｏｅｐｌｉｔｚ矩阵,即ｔｉ,ｊ＝ｔ｜ｉ－ｊ｜（ｉ,ｊ＝０,１,...,Ｎ－１）且ＴＮ的所有特征值均为正数,并表为ＴＮ：＝Ｔ（ｔ。,ｔｉ,...,ｔＮ－１）．如果我们用预条件子共轭梯度法（ＰＣＧ）求解方程组（１．１）,最关健的任务是构造出高效的预条件子．而预条件子最自然的选择似乎其逆矩阵易求且构成矩阵ＴＮ的某种最优逼近．由于循环矩阵ＣＮ的逆矩阵ＣＲ'仍为循环矩阵,因此ＣＮ和ＣＨ'与向量的乘积可通ｉｓ速Ｆｏｕｒｉｅｒ…     

四元数矩阵方程AX-YB=C的最佳逼近解

本利用四元数矩阵的广义Frobenius范数建立一个关于四元数矩阵的实函数，并讨论了它的极值问题．然后在四元数矩阵方程AX-YB=C的解集合中导出了与给定矩阵的最佳逼近解的表达式．     

非线性抛物型问题Galerkin逼近的整体超收敛性

假定Ω可以被剖分成满足逆性质的矩形网格T_h,剖分单元τ的最大直径为h,在T_h上构造连续的分片多项式空间     

独立随机变量部分和的强逼近与广义Erds-Rényi大数律

本文首先得到满足Bernstein条件的独立不同分布的随机变量序列部分和强逼近结果,此结果与i.i.d.情形完全一致,达到理想地步.利用强不变原理方法,我们研究了独立不同分布时的改进Erd6s—R《nyi大数定律,我们的结果推广了[2]和[3]的部分结果.