On the choice of approximations in direct problems of nozzle design

Two problems are considered: the design of a supersonic nozzle with a uniform exit characteristic and the design of a subsonic nozzle part with a plane (straight) sonic line in the minimum cross section. It is shown how the choice of a nozzle profile approximation affects the direct solutions to variational gas dynamics problems. The nozzle profile is described by polynomials or splines (quadratic, cubic, rational). The varied variables are the profile’s expansion coefficients in terms of basis functions or the parameters to be interpolated. It is shown that a priori information on the monotonicity of the desired profile improves the efficiency of the solution.     

核属于H函数类的多维Fredholm积分方程类近似解的计算复杂性

给出了在 Lp,2 p<∞ ,范意义下 ,核下自由项均属于 H函数类的多维 Fredholm积分方程类近似解的ε-计算复杂性估计 .     

Properties of an exact crystalline many-body ground state

A new quantum many-body Hamiltonian is introduced, for which the exact ground state is a Jastrow-type product. This Hamiltonian is interpreted as a one-component |x|-potential Coulomb system in free boundary conditions, and by explicit calculation it is shown that the ground state is crystalline. The generaln-body density matrix is calculated, and is related to then-body density matrix calculated in periodic boundary conditions.     

对称函数各完备集展开系数之间的转换

本文从三种构成完备集的对称函数的定义及有关性质出发，讨论了对称函数在各完备集中展开系数之间的转换，给出了相应的变换矩阵，从而建立了各完备集之间的相互联系.     

Geometry of optimal value functions with applications to redundancy in linear programming

In 1967, Wets and Witzgall (Ref. 1) made, in passing, a connection between frames of polyhedral cones and redundancy in linear programming. The present work elaborates and formalizes the theoretical details needed to establish this relation. We study the properties of optimal value functions in order to derive the correspondence between problems in redundancy and the frame of a polyhedral cone. The insights obtained lead to schemes to improve the efficiency of procedures to detect redundancy in the areas of linear programming, stochastic programming, and computational geometry.The author is indebted to G. Dewan for his review and discussions.     

The equivalence of ensembles for lattice systems: Some examples and a counterexample

We describe the problem of the equivalence of ensembles at the level of states for classical lattice systems. We discuss circumstances where the vanishing of the specific information gain of a sequence of microcanonical measures with respect to a sequence of grand canonical measures implies the equivalence of ensembles. We give a simple derivation of a criterion for the vanishing of the specific information gain in terms of thermodynamic functions. The proof uses ideas from the theory of large deviations but is self-contained. We show how the criterion works in a simple model of a paramagnet and in the Ising model of a ferromagnet in any dimension but fails in the case of the Curie-Weiss mean-field model.     

Design and optimal tuning of nonlinear PI compensators

In this paper, linear time-invariant single-input single-output (SISO) systems that are stabilizable by linear proportional and integral (PI) compensators are considered. For such systems, a five-parameter nonlinear PI compensator is proposed. The parameters of the proposed compensator are tuned by solving an optimization problem. The optimization problem always has a solution.Additionally, a general nonlinear PI compensator is proposed and is approximated by easy-to-compute compensators, for instance, a six-parameter nonlinear PI compensator. The parameters of the approximate compensators are tuned to satisfy an optimality condition. The superiority of the proposed nonlinear PI compensators over linear PI compensators is discussed and is demonstrated for two feedback systems.     

Multi-funnel optimization using Gaussian underestimation

In several applications, underestimation of functions has proven to be a helpful tool for global optimization. In protein–ligand docking problems as well as in protein structure prediction, single convex quadratic underestimators have been used to approximate the location of the global minimum point. While this approach has been successful for basin-shaped functions, it is not suitable for energy functions with more than one distinct local minimum with a large magnitude. Such functions may contain several basin-shaped components and, thus, cannot be underfitted by a single convex underestimator. In this paper, we propose using an underestimator composed of several negative Gaussian functions. Such an underestimator can be computed by solving a nonlinear programming problem, which minimizes the error between the data points and the underestimator in the L ¹ norm. Numerical results for simulated and actual docking energy functions are presented.     

A Cartesian‐grid collocation method based on radial‐basis‐function networks for solving PDEs in irregular domains

This paper reports a new Cartesian‐grid collocation method based on radial‐basis‐function networks (RBFNs) for numerically solving elliptic partial differential equations in irregular domains. The domain of interest is embedded in a Cartesian grid, and the governing equation is discretized by using a collocation approach. The new features here are (a) one‐dimensional integrated RBFNs are employed to represent the variable along each line of the grid, resulting in a significant improvement of computational efficiency, (b) the present method does not require complicated interpolation techniques for the treatment of Dirichlet boundary conditions in order to achieve a high level of accuracy, and (c) normal derivative boundary conditions are imposed by means of integration constants. The method is verified through the solution of second‐ and fourth‐order PDEs; accurate results and fast convergence rates are obtained. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Frame-Based Ray Search Algorithms in Unconstrained Optimization

This paper describes a class of frame-based direct search methods for unconstrained optimization without derivatives. A template for convergent direct search methods is developed, some requiring only the relative ordering of function values. At each iteration, the template considers a number of search steps which form a positive basis and conducts a ray search along a step giving adequate decrease. Various ray search strategies are possible, including discrete equivalents of the Goldstein–Armijo and one-sided Wolfe–Powell ray searches. Convergence is shown under mild conditions which allow successive frames to be rotated, translated, and scaled relative to one another.