求解非线性方程的一个新方法

提出了一种求解非线性方程的数值方法，此方法不需要导数的计算，其收敛阶与抛物线法相同，但计算量要比抛物线法小得多。     

延迟和相关效应对Ne原子2p53s1,3P10-2p6 1S0跃迁的影响

利用多组态Dirac-Fock(MCDF)方法,系统地研究了延迟和相关效应对中性Ne原子2p53s1,3P01-2p61S0电偶极共振和复合跃迁的能量以及跃迁几率(寿命)的影响,给出了相应的跃迁能和辐射寿命,并与最新的实验观测和其他理论计算结果进行了比较.     

Monte Carlo方法研究低能电子束曝光沉积能分布规律

建立一个描述低能电子在多元多层介质中散射的物理模型,运用MonteCarlo方法模拟低能电子在靶体胶衬底中的复杂散射过程,在此基础上通过大量计算研究入射束能、胶层厚度、衬底材料等不同曝光条件对抗蚀剂沉积能密度分布的影响,获得沉积能分布规律:适量的低束能、薄胶层、低原子序数衬底可以使前散射电子对胶中沉积能密度分布的贡献增大、背散射电子的贡献减小,从而提高曝光分辨率. 关键词： 电子束曝光 MonteCarlo方法 低能电子散射 能量沉积     

A new trigonometric method of summation and its application to the degree of approximation

The object of the present investigation is to introduce a new trigonometric method of summation which is both regular and Fourier effective and determine its status with reference to other methods of summation (see §2-§4) and also give an application of this method to determine the degree of approximation in a new Banach space of functions conceived as a generalized Holder metric (see §5).     

An LQP Method for Pseudomonotone Variational Inequalities

In this paper, we proposed a modified Logarithmic-Quadratic Proximal (LQP) method [Auslender et al.: Comput. Optim. Appl. 12, 31–40 (1999)] for solving variational inequalities problems. We solved the problem approximately, with constructive accuracy criterion. We show that the method is globally convergence under that the operator is pseudomonotone which is weaker than the monotonicity and the solution set is nonempty. Some preliminary computational results are given.The author was supported by the NSFC grants Nos: 70571033 and 10571083.     

Asymptotic Behavior on a Competition Model Arising from an Unstirred Chemostat

This paper is concerned with the unstirred chemostat model with two-species and one non-reproducingresource.The global attractivity of the positive steady-state solutions of the original system is established.Moreover,the effects of the growth rate on the unique positive equilibrium of the single population model arestudied.     

条形装箱问题的优化模型和增广Lagrange算法

This paper formulates a two-dimensional strip packing problem as a non-linear programming(NLP)problem and establishes the first-order optimality con-ditions for the NLP problem.A numerical algorithm for solving this NLP problemis given to find exact solutions to strip-packing problems involving up to 10 items.Approximate solutions can be found for big-sized problems by decomposing the setof items into small-sized blocks of which each block adopts the proposed numericalalgorithm.Numerical results show that the approximate solutions to big-sized prob-lems obtained by this method are superior to those by NFDH,FFDH and BFDHapproaches.     

A TVD Type Wavelet-Galerkin Method for Hamilton-Jacobi Equations

In this paper,we use Daubechies scaling functions as test functions for the Galerkin method,and discuss Wavelet-Galerkin solutions for the Hamilton-Jacobi equations.It can be proved that the schemesare TVD schemes.Numerical tests indicate that the schemes are suitable for the Hamilton-Jacobi equations.Furthermore,they have high-order accuracy in smooth regions and good resolution of singularities.     

Comparison of the boundary theory with the contact rule of phase regions and Gupta’s method

The phase boundary theory and the contact rule of phase regions are compared, and some weaknesses of the latter are manifested. The comparison between the Gupta’s method and the boundary theory method for constructing multicomponent isobaric sections is also presented.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.