用“参数多项式方法”确定风力透平叶片的失速振荡流

用“参数多项式方法”确定风力透平叶片的失速振荡流陈佐一,孙永忠,杨玲（清华大学热能工程系北京１０００８４）关键词：参数多项式方法,风力透平,颤振在现代各类流动诱导振动问题的研究中,流体激振的安全性分析与诊断,要求在较短的时间内,对大量的复杂流动工况进...     

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.

     

Rapidly converging lattice sums for nonelectrostatic interactions

The relative energies of one-, two-, and three-dimensional Bravais lattice Lennard-Jones particles can be calculated by lattice sums. The expression of lattice sums over a Lennard-Jones potential can be manipulated into a form that converges rapidly. A formalism capable of calculating the lattice potential at arbitrary points of a completely general lattice has been developed. This method provides an alternative way to calculate the relative energies from the surface and the interior bulk sites of many chemical systems. The method is illustrated with application to hcp and fcc Lennard-Jonesium, both for the relative binding energy and for calculating the potential along the geometric diffusion pathway between tetrahedral and octahedral interstitial sites. Diffusion from the tetrahedral site to the octahedral site experiences a barrier of 752.600 in units of 4 epsilon. The reverse pathway experiences a barrier of 1035.614 in units of 4 epsilon.     

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.     

The a posteriori error estimates of Chebyshev–Petrov–Galerkin methods for second-order equations

In this paper, the a posteriori error estimates of Chebyshev–Petrov–Galerkin approximations are investigated. For simplicity, we choose the Poisson equation with Dirichlet boundary conditions to discuss the a posteriori error estimators, and deduce their efficient and reliable properties. Some numerical experiments are performed to verify the theoretical analysis for the a posteriori error estimators.     

The polynomial reconstruction problem: The first 50 years

The problem of reconstructing the characteristic polynomial of a graph of order at least 3 from the collection of characteristic polynomials of its vertex-deleted subgraphs was posed by Cvetkovi? in 1973 as a spectral counter part to the well-known Ulam's reconstruction conjecture. Over the last 50 years, this problem has received notable attention, many positive results have been obtained, but in the general case the problem is still unresolved. In particular, no counter example is found in literature. In this expository paper we survey classical and some more recent results concerning the polynomial reconstruction problem, discuss some related problems, variations and generalizations.     

Dimension polynomials of difference local algebras

We extend the concept of the difference dimension polynomial of a difference field extension to difference local algebras. The main theorem of the paper establishes the existence and form of the dimension polynomial associated with the localization of a finitely generated well-mixed difference algebra at a prime reflexive difference ideal.