秦九韶算法的教学价值

人教A版<数学3>介绍了秦九韶算法:n次多项式f(x)=anxn+an-1xn-1+…+a1x+a0. 当x=x0时,令v0=an,通过公式{v0=an,vk=vk-1x0=an-k(k=1,2,…,n)可求出f(x0)的值为vn. 它是我国古代数学中的著名算法,本文将从三个方面介绍该算法的教学价值.     

基于切比雪夫节点的一类带显式系数的广义高斯求积公式(英文)

The goal here is to give a simple approach to a quadrature formula based on the divided diffierences of the integrand at the zeros of the nth Chebyshev polynomial of the first kind,and those of the（n-1）st Chebyshev polynomial of the second kind.Explicit expressions for the corresponding coefficients of the quadrature rule are also found after expansions of the divided diffierences,which was proposed in[14].     

两两NQD列大数定律的一个注记

利用两两NQD列三级数定理的思想和Chebyshev不等式,研究了两两NQD列在一类广泛条件下的弱大数定律和一类加强条件下的强大数定律,得到了与独立情形一致的结果,还特别讨论了同分布情形,推广了相关文献的结果．     

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 正交多项式.