一类二阶非线性阻尼微分方程的振动性

研究了一类二阶非线性阻尼微分方程解的振动性,建立了三个新的振动性定理,推广了Cecchi M和Marini M(Rocky Mount J Math,1992,22:1259-1276)的结果.  

脉冲时滞抛物型方程解的振动性

本文研究了两类边界条件下有振动系数的脉冲时滞抛物型方程解的振动性,得到了若干解振动的判别准则。其结果即使用于有固定符号系数的方程,也显著地改进了已有的结果。  

The approximation power of moving least-squares

A general method for near-best approximations to functionals on , using scattered-data information is discussed. The method is actually the moving least-squares method, presented by the Backus-Gilbert approach. It is shown that the method works very well for interpolation, smoothing and derivatives' approximations. For the interpolation problem this approach gives Mclain's method. The method is near-best in the sense that the local error is bounded in terms of the error of a local best polynomial approximation. The interpolation approximation in is shown to be a function, and an approximation order result is proven for quasi-uniform sets of data points.

  

The Cross-Entropy Method for Combinatorial and Continuous Optimization

We present a new and fast method, called the cross-entropy method, for finding the optimal solution of combinatorial and continuous nonconvex optimization problems with convex bounded domains. To find the optimal solution we solve a sequence of simple auxiliary smooth optimization problems based on Kullback-Leibler cross-entropy, importance sampling, Markov chain and Boltzmann distribution. We use importance sampling as an important ingredient for adaptive adjustment of the temperature in the Boltzmann distribution and use Kullback-Leibler cross-entropy to find the optimal solution. In fact, we use the mode of a unimodal importance sampling distribution, like the mode of beta distribution, as an estimate of the optimal solution for continuous optimization and Markov chains approach for combinatorial optimization. In the later case we show almost surely convergence of our algorithm to the optimal solution. Supporting numerical results for both continuous and combinatorial optimization problems are given as well. Our empirical studies suggest that the cross-entropy method has polynomial in the size of the problem running time complexity.  

带时滞的具有阶段结构的捕食抛物型方程组

本文对两种群的捕食与被捕食模型,运用了上下解方法及相应的单调迭代序列研究具有时滞的耦合半线性抛物方程组的动力学行为,给出了解的渐近性质及阶段结构对解的性质的影响。  

Maximal Inequalities and an Invariance Principle for a Class of Weakly Dependent Random Variables

The aim of this paper is to investigate the properties of the maximum of partial sums for a class of weakly dependent random variables which includes the instantaneous filters of a Gaussian sequence having a positive continuous spectral density. The results are used to obtain an invariance principle for strongly mixing sequences of random variables in the absence of stationarity or strong mixing rates. An additional condition is imposed to the coefficients of interlaced mixing. The results are applied to linear processes of strongly mixing sequences.  

三种群捕食-被捕食模型中具时滞的抛物系统

本文研究三种群食物链,其中第三种群是第二种群的捕食者,第二种群是第一种群的捕食者。我们用上下解方法研究具时滞的耦合半线性抛物方程组的动力学行为,给出了解的渐近性质。  

A Logarithmic-Quadratic Proximal Method for Variational Inequalities

We present a new method for solving variational inequalities on polyhedra. The method is proximal based, but uses a very special logarithmic-quadratic proximal term which replaces the usual quadratic, and leads to an interior proximal type algorithm. We allow for computing the iterates approximately and prove that the resulting method is globally convergent under the sole assumption that the optimal set of the variational inequality is nonempty.  

利用局部加权拟合方法检验线性回归关系

利用局部加权技术拟合变参数回归模型,提出了一个检验线性回归关系的方法.基于残差平方和,构造适当的检验统计量,给出了计算检验p-值的精确方法及三阶矩x2逼近方法.随机模拟与实例分析表明计算p-值的逼近方法具有较高的精度,所提出的检验统计量在检测回归函数非线性性方面有满意的功效和可靠性.  

一类四阶非线性微分方程解的有界性及稳定性

运用Liapunov函数方法,研究了一类四阶非线性微分方程解的有界性及稳定性,得到了解的有界性及零解的全局渐近稳定性的充分条件。