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

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

An RQP algorithm using a differentiable exact penalty function for inequality constrained problems

In this paper we propose a recursive quadratic programming algorithm for nonlinear programming problems with inequality constraints that uses as merit function a differentiable exact penalty function. The algorithm incorporates an automatic adjustment rule for the selection of the penalty parameter and makes use of an Armijo-type line search procedure that avoids the need to evaluate second order derivatives of the problem functions. We prove that the algorithm possesses global and superlinear convergence properties. Numerical results are reported.     

A review of statistical models for global optimization

A review of statistical models for global optimization is presented. Rationality of the search for a global minimum is formulated axiomatically and the features of the corresponding algorithm are derived from the axioms. Furthermore the results of some applications of the proposed algorithm are presented and the perspectives of the approach are discussed.     

Some computational methods for systems of nonlinear equations and systems of polynomial equations

This paper gives a brief survey and assessment of computational methods for finding solutions to systems of nonlinear equations and systems of polynomial equations. Starting from methods which converge locally and which find one solution, we progress to methods which are globally convergent and find an a priori determinable number of solutions. We will concentrate on simplicial algorithms and homotopy methods. Enhancements of published methods are included and further developments are discussed.     

局部对称共形平坦黎曼流形中具有平行平均曲率向量的子流形

本文把[1]的结论推广到了环绕空间是局部对称共形平坦的情形,即获得了:设M~是局部对称共形平坦黎曼流形N~+p(p>1)中具有平行平均曲率向量的紧致子流形,如果则M~位于N~+p的全测地子流形N~+1中。其中S,H分别是M~的第二基本形式长度的平方和M~的平均曲率,T_C、t_c分别是N~+p的Ricci曲率的上、下确界,K是N~+p的数量曲率。     

Finite dimensional approximation in infinite dimensional mathematical programming

We consider the problem of approximating an optimal solution to a separable, doubly infinite mathematical program (P) with lower staircase structure by solutions to the programs (P(N)) obtained by truncating after the firstN variables andN constraints of (P). Viewing the surplus vector variable associated with theNth constraint as a state, and assuming that all feasible states are eventually reachable from any feasible state, we show that the efficient set of all solutions optimal to all possible feasible surplus states for (P(N)) converges to the set of optimal solutions to (P). A tie-breaking algorithm which selects a nearest-point efficient solution for (P(N)) is shown (for convex programs) to converge to an optimal solution to (P). A stopping rule is provided for discovering a value ofN sufficiently large to guarantee any prespecified level of accuracy. The theory is illustrated by an application to production planning.The work of Robert L. Smith was partially supported by the National Science Foundation under Grant ECS-8700836.     

Chip-Firing Games on Directed Graphs

We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results.     

Fluorine nuclear magnetic resonance: calibration and system optimization

Fluorine-19 magnetic resonance imaging (MRI) offers advantages for imaging organs and tissues. 19F is readily synthesized into a variety of compounds and offers the potential for in-vivo imaging as a complement to hydrogen MRI. The purpose of this work was to determine the minimum detection sensitivity for a fluorinated compound (CF3-CO2H) as a function of pulse sequence, interpulse times (TE, TI, and TR), gradient values and the number of data averages. CF3-CO2H was chosen because it has a single spectral line and exhibits a minimal frequency shift under the experimental conditions used for this experiment. A resistance MR scanner operating at a resonance frequency of 6.255 MHz was used for imaging both fluorine (.156 T) and hydrogen (.147 T). Critical factors determining the minimum detection sensitivity included system signal-to-noise ratio (S/N), acquisition time, relaxation times (T1, T2), and sample volume. Samples were measured over the range of 0.05 M to 20.0 M and showed a linear relationship between signal strength and concentration. The minimum detection sensitivity was 0.1 M. Use of higher static fields and optimized coils as well as improved system signal-to-noise ratios will improve detection sensitivity. We conclude that imaging of fluorine on low-field system is feasible, although it is necessary to optimize many parameters to maximize detection sensitivity.     

水稻糙米粗蛋白近红外光谱定量分析模型的优化研究

筛选有代表性的191份糙米样品为试材,其中42份来自国家稻种资源库、149份来自水旱稻杂交产生的DH系,蛋白质含量变幅5.90％～14.50％,采用偏最小二乘法(PLS)建立模型,并构造模型的评价参数——目标函数[R/(1+RMSECV)], 同时借助校正集和验证集两个载荷向量得分二维空间投影图,对近红外定量模型进行评价和优化。结果表明: 在5 000～9 000 cm-1范围内,预处理方法为一阶导数,校正模型和外部检验的目标函数值分别为0.701和0.687;两载荷向量得分直观分布图显示样品的聚类结果与目标函数筛选结果一致,也进一步验证了目标函数是模型评价和优化的有效指标。     

二维矢量边界推进非结构网格生成方法

提出二维矢量边界推进生成非结构三角形网格方法并证明其可行性.根据流场边界尺度布置边界节点并运用矢量边界推进方法生成背景网格,运用符号面积函数和概率筛选方法布置初始点阵,提出Spring-Laplace方法优化节点位置,同时利用边交换技术优化网格结构.该方法可包含任意点源、线源和内嵌边界,可自由进行局部自适应加密或稀疏,实现任意平面域内与尺度要求一致的高效光滑三角网格剖分.