Approximating the zeros of analytic functions by the exclusion algorithm

We give a practical version of the exclusion algorithm for localizing the zeros of an analytic function and in particular of a polynomial in a compact of . We extend the real exclusion algorithm to a Jordan curve and give a method which excludes discs without any zero. The result of this algorithm is a set of discs arbitrarily small which contains the zeros of the analytic function.     

Fermionic solution of the Andrews-Baxter-Forrester model. II. Proof of Melzer's polynomial identities

We compute the one-dimensional configuration sums of the ABF model using the fermionic technique introduced in part I of this paper. Combined with the results of Andrews, Baxter, and Forrester, we prove polynomial identities for finitizations of the Virasoro characters as conjectured by Melzer. In the thermodynamic limit these identities reproduce Rogers-Ramanujan-type identities for the unitary minimal Virasoro characters conjectured by the Stony Brook group. We also present a list of additional Virasoro character identities which follow from our proof of Melzer's identities and application of Bailey's lemma.Dedicated to the memory of Piet Kasteleyn.     

Geometric indices and the Alexander polynomial of a knot

It is well-known that any Laurent polynomial satisfying and is the Alexander polynomial of a knot in . We show that can be realized by a knot which has the following properties simultaneously: (i) tunnel number 1; (ii) bridge index 3; and (iii) unknotting number 1.

     

A -functional and the rate of convergence of some linear polynomial operators

We show that the -functional

where , is equivalent to the rate of convergence of a certain linear polynomial operator. This operator stems from a Riesz-type summability process of expansion by Legendre polynomials. We use the operator above to obtain a linear polynomial approximation operator with a rate comparable to that of the best polynomial approximation.

     

Improving the rate of convergence of interior point methods for linear programming

This paper proposes a procedure for improving the rate of convergence of interior point methods for linear programming. If (x ^k ) is the sequence generated by an interior point method, the procedure derives an auxiliary sequence ( ). Under the suitable assumptions it is shown that the sequence ( ) converges superlinearly faster to the solution than (x ^k ). Application of the procedure to the projective and afflne scaling algorithms is discussed and some computational illustration is provided.     

一种基于新型小波包阈值的图像去噪方法

提出了一种基于小波包理论去除图像噪声的方法,用小波包把图像分解为高频分量和低频分量,根据高频分量估计噪声的标准差,并利用该标准差以及Birge-Massart惩罚函数计算阈值.鉴于传统软硬阈值的缺陷,采用一种新型阈值量化方法,用三次多项式在硬阈值的基础上插值,使新的阈值函数保持了连续性和可导性.通过这种方法既消除了图像的振铃现象,又保留了细节成分.实验表明：与传统方法相比,新方法使图像视觉效果和峰值信噪比均获得提高.     

多节摆的自由振动分析

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

On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.