Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

In this paper we study a class of nonconvex quadratically constrained quadratic programming problems generalized from relaxations of quadratic assignment problems. We show that each problem is polynomially solved. Strong duality holds if a redundant constraint is introduced. As an application, a new lower bound is proposed for the quadratic assignment problem.     

On Reed-Solomon Codes

The complexity of decoding the standard Reed-Solomon code is a well-known open problem in coding theory. The main problem is to compute the error distance of a received word. Using the Weil bound for character sum estimate, Li and Wan showed that the error distance can be determined when the degree of the received word as a polynomial is small. In the first part, the result of Li and Wan is improved. On the other hand, one of the important parameters of an error-correcting code is the dimension. In most cases, one can only get bounds for the dimension. In the second part, a formula for the dimension of the generalized trace Reed-Solomon codes in some cases is obtained.     

EXACT EVALUATIONS OF FINITE TRIGONOMETRIC SUMS BY SAMPLING THEOREMS

We use the sampling representations associated with Sturm-Liouville difference operators to derive generalized integral-valued trigonometric sums. This extends the known results where zeros of Chebyshev polynomials of the first kind are involved to the use of the eigenvalues of difference operators, which leads to new identities. In these identities Bernoulli’s numbers play a role similar to that of Euler’s in the old ones. Our technique differs from that of Byrne-Smith (1997) and Berndt-Yeap (2002).     

An improvement of the octonionic Taylor type theorem

We prove that the octonionic polynomials V ■k l 1 ··· l k are independent of the associative orders ■k . This improves the octonionic Taylor type theorem.     

On the boundedness of rough oscillatory singular integrals on Triebel-Lizorkin spaces

We obtain appropriate sharp bounds on Triebel-Lizorkin spaces for rough oscillatory integrals with polynomial phase. By using these bounds and using an extrapolation argument we obtain some new and previously known results for oscillatory integrals under very weak size conditions on the kernel functions.     

一种判断多项式函数极值点和拐点个数的简单方法

给出了判断一类多项式函数极值点和拐点个数的一种快捷方法,得到了几个相关结论,并通．过几个典型例题验证了该方法解题的有效性和快捷性．     

特征值问题的预变换方法(I): 杨辉三角阵变换与二阶PDE 特征多项式

本文提出一类求解特征值问题的下三角预变换方法, 目标是通过相似变换后矩阵下三角元素平方和明显减少、且变换后的特征值及其特征向量较易求解, 使变换后的对角线可作为全体特征值很好的一组初值, 其作用如同对于解方程组找到好的预条件子, 加速迭代收敛. 以二阶PDE 数值计算为例,对于以Laplace 方程为代表的特征波向量组及正交多项式组有广泛的应用前景.
杨辉三角是我国古代数学家的一项重要成就. 本文引入杨辉三角矩阵作为预变换子, 给出一般矩阵用杨辉三角矩阵作为左、右预变换子时变为上三角矩阵的充要条件, 给出了元素为行指标二次多项式的两个矩阵类(三对角线阵与五对角线阵) 中特征值何时保持二次多项式的充要条件, 并应用于构造新的二元PDE 正交多项式.     

一类四进制U-正交函数系

本文给出了一类四进制的分段多项式正交系(简称QU-系统)的构造方法,讨论了该构造算法的可行性,并给出了1至3次QU-系统的一组显式表达式.同时,研究了QU-系统的性质以及与二进制U-系统之间的关系,并推导出了QU-系统的基函数值与Fourier-QU系数的计算公式.由本文的方法可以构造一类L2[0,1]中的完备的正交系...     

推导粒子数态波函数的厄米多项式算符法

引入厄米多项式算符并用其正规乘积展开式推导出了粒子数态|n〉在坐标表象和动量表象下的波函数,并由此得出了坐标和动量本征态的福克(Fock)表示形式,这是一个简洁而全新的推导方法.     

多节摆的自由振动分析

利用拉格朗日方程,导出了多节摆系统的运动微分方程.根据三对角阵的性质,给出了振动系统的特征多项式和特征矢量的递推公式,并以三节摆为例,说明了结果的应用,用此方法验证了<力学与实践>2002年第24期<多自由度振动系统的简正坐标和简正振动模式>一文中的结果.