关于对数平均的上界

关于对数平均的上界代立新，陈彰栋（荆州师范高等专科学校，荆沙４３４１０４）Ｒｘ＃。ｉＭ＋＄＃ｊＥ＆，＃ｉｉｉｒＴｈｉＬｈＮ＆Ｙ４，ｔｅｈＬ（ｘ，。），１９５７＃ＯｓｔｌｅｆｏＴｅｗｉｌｌｉｙｅｒ发现了，Ｌ（ｘ，ｙ）＜Ｍ，１９８３年文【Ｚｊ又指出１９８...     

关于指数平均和对数平均的Agarwal型不等式

给出了对数平均和一类指数平均的几个Agarwal型不等式.     

关于算术,对数,指数,几何平均不等式的概率证法

本用概率方法证明了关于两个相异的正数的几何平均、对数平均、指数平均和算术平均的不等式关系。     

关于算术、对数、指数、几何平均不等式的概率证法

本文用概率方法证明了关于两个相异的正数的几何平均、对数平均、指数平均和算术平均的不等式关系 .     

收缩临界5-连通图的平均度

M．Kriesell证明了收缩临界5-连通图的平均度不超过24并猜想收缩临界5-连通图的平均度小于10．本文构造了一个反例证明M．Kriesell的猜想不成立并给出了收缩临界5-连通图平均度新的上界．     

非零面积平均p叶函数的对数面积估计

本研究非零的面积平均P叶函数f(z)的对数面积估计，得到其对数面积不等式．     

具有平行平均曲率向量子流形的曲率估计与稳定性

本文估计空间形式中具有平行平均曲率向量子流形上共形度量的数量曲率上界,并利用其研究了具有常平均曲率超曲面的稳定性．     

关于对数平均的一个不等式

给出了与两正数a,b的几何平均、算术平均、对数平均有关的一个不等式     

关于对数平均的若干极限定理

关于算术平均和几何平均极限定理在许多文献中有所研究,本文主要给出对数平均大数定律成立的若干充分条件.     

具有相依结构离散时间模型破产概率的上界

研究两类具有相依结构的离散时间风险模型的破产概率问题.其中,索赔和利率过程假设为2个不同的自回归移动平均模型.利用更新递归技巧,首先得到了该模型下破产概率所满足的递归方程.然后,根据该递归方程得到了破产概率的上界估计.最后对两类风险模型的破产概率的上界进行了比较.     

最小距离固定且优于Gilbert—Varshamov界的码

本文构造了一类GF(q)上的码,其中GF(q)为q个元素的有限域.这些码的冗余取到渐进界r(q,n,7) 4 m,此界优于Gilbert-Varshamov存在界r(q,n,7) 5m.     

树的几何反比度上界

设G(V,E)是一个任意图，定义为G的几何反比度，本文证明了，其中T为顶点数为n的树，这个上界值是精确的     

M-矩阵Hadamard积的最小特征值下界的新估计式

设B和A是非奇异M-矩阵,给出B和A-1的Hadamard积的最小特征值下界τ（B°A-1）的一个新估计式,理论证明和算例表明,本文所得新估计式改进了现有的一些结果．     

非负张量Z谱的Brauer型上界

In this paper, we have proposed an upper bound for the largest Z-eigenvalue of an irreducible weakly symmetric and nonnegative tensor, which is called the Brauer upper bound:■where■ As applications, a bound on the Z-spectral radius of uniform hypergraphs is presented.     

An Improved Lower Bound for the Multimedian Location Problem

We consider the problem of locating, on a network, n new facilities that interact with m existing facilities. In addition, pairs of new facilities interact. This problem, the multimedian location problem on a network, is known to be NP-hard. We give a new integer programming formulation of this problem, and show that its linear programming relaxation provides a lower bound that is superior to the bound provided by a previously published formulation. We also report results of computational testing with both formulations.     

A Note on an Error Bound for the AOR Method

Suppose Ax = b is a system of linear equations where the matrix A is symmetric positive definite and consistently ordered. A bound for the norm of the errors _k = x– x ^k of the AOR method in terms of the norms of _k = x ^k–x ^k–1 and _k+1 = x ^k+1–x ^k and their inner product is derived.     

Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming

In this paper several equivalent formulations for the quadratic binary programming problem are presented. Based on these formulations we describe four different kinds of strategies for estimating lower bounds of the objective function, which can be integrated into a branch and bound algorithm for solving the quadratic binary programming problem. We also give a theoretical explanation for forcing rules used to branch the variables efficiently, and explore several properties related to obtained subproblems. From the viewpoint of the number of subproblems solved, new strategies for estimating lower bounds are better than those used before. A variant of a depth-first branch and bound algorithm is described and its numerical performance is presented.     

A Derivative-Free Algorithm for Bound Constrained Optimization

In this work, we propose a new globally convergent derivative-free algorithm for the minimization of a continuously differentiable function in the case that some of (or all) the variables are bounded. This algorithm investigates the local behaviour of the objective function on the feasible set by sampling it along the coordinate directions. Whenever a suitable descent feasible coordinate direction is detected a new point is produced by performing a linesearch along this direction. The information progressively obtained during the iterates of the algorithm can be used to build an approximation model of the objective function. The minimum of such a model is accepted if it produces an improvement of the objective function value. We also derive a bound for the limit accuracy of the algorithm in the minimization of noisy functions. Finally, we report the results of a preliminary numerical experience.     

非负矩阵谱半径的一个新界值

在Wielandt定理的基础上进行了推广,得到了一种估计非负矩阵谱半径的新方法,数值例子显示了新方法所得到的结果更为精确.     

循环图能量的一个上界

本文讨论循环图的能量,得到循环图能量上界的一个估计值.进一步得到整循环图能量的两个计算公式.