Methods for implementing the stream boundary condition in DSMC computations

In the direct simulation Monte‐Carlo (DSMC) method for simulating rarefied gas flows, the velocities of simulator particles that cross a simulation boundary and enter the simulation space are typically generated using the acceptance–rejection procedure that samples the velocities from a truncated theoretical velocity distribution that excludes low and high velocities. This paper analyses an alternative technique, where the velocities of entering particles are obtained by extending the simulation procedures to a region adjacent to the simulation space, and considering the movement of particles generated within that region during the simulation time step. The alternative method may be considered as a form of acceptance–rejection procedure, and permits the generation of all possible velocities, although the population of high velocities is depleted with respect to the theoretical distribution. Nevertheless, this is an improvement over the standard acceptance–rejection method. Previous implementations of the alternative method gave a number flux lower than the theoretical number required. Two methods for obtaining the correct number flux are presented. For upstream boundaries in high‐speed flows, the alternative method is more computationally efficient than the acceptance–rejection method. However, for downstream boundaries, the alternative method is extremely inefficient. The alternative method, with the correct theoretical number flux, should therefore be used in DSMC computations in favour of the acceptance–rejection method for upstream boundaries in high‐speed flows. Copyright © 2003 John Wiley & Sons, Ltd.     

二维椭圆型方程反问题中优化算法的比较

近年来，决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用．本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法．由误差平方和最小原则，这个反问题可化为一个变分问题，并进一步离散化为一个最优化问题，其目标函数依赖于要决定的方程系数．本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现，并与拟牛顿法作为对比．为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵．同时还考察了线搜索方法的不同对优化算法的影响．数值实验的结果表明，非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效．     

On the application of slip boundary condition on curved boundaries

Hydrodynamic simulations of sloshing phenomena often involve the application of slip boundary condition at the wetted surfaces. If these surfaces are curved, the ambiguous nature of the normal vector in the discretized problem can interfere with the application of such a boundary condition. Even the use of consistent normal vectors, preferred from the point of view of conservation, does not assure good approximation of the continuum slip condition in the discrete problem, and non‐physical recirculating flow fields may be observed. As a remedy, we consider the Navier slip condition, and more successfully, the so‐called BC‐free boundary condition. Copyright © 2004 John Wiley & Sons, Ltd.     

LINEAR ACTIVE STRUCTURES AND MODES (Ⅱ)--DISCRETE SYSTEMS AND BEAMS

The basic concepts about the active structures and some attributes of the modes were presented in paper "Liner Active Structures and Modes ( Ⅰ ) ". The characteristics of the active discrete systems and active beams were discussed, especially, the stability of the active structures and the orthogonality of the eigenvectors. The notes about modes were portrayed by a model of a seven-storeyed building with sensors and actuators. The concept of the adjoint active structure was extended from the discrete systems to the beams that were the representations of the continuous structures. Two types of beams with different placements of the measuring and actuating systems were discussed in detail. One is the beam with the discrete sensors and actuators, and the other is the beam with distributed sensor and actuator function. The orthogonality conditions were derived with the modal shapes of the active beam and its adjoint active beam. An example shows that the variation of eigenvalues with feedback amplitude for the homo-configuration and non-homo-configuration active structures.     

A Semiconductor Laser of the Visible Range as an Exciting Source of Raman Scattering

A possibility of application of semiconductor lasers of the visible range as exciting sources for Raman spectroscopy is studied. An experimental set-up for measuring Raman spectra of polycrystalline dielectrics and broad-gap semiconductors excited by a semiconductor laser with a wavelength of 640 nm was created. The conditions under which the spectral width of the lasing line of a semiconductor laser was within 10^-3 cm^-1 in the continuous mode with a power of 10 mW are realized. The characteristics of various types of exciting sources used in Raman spectroscopy are compared. The results of studies of the characteristic Raman spectra excited with a semiconductor laser in polycrystalline sulfur are presented.     

Augmented Lagrangian Algorithms Based on the Spectral Projected Gradient Method for Solving Nonlinear Programming Problems

The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP.     

On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria

For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions.     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

On a resolvent estimate of the Stokes equation with Neumann–Dirichlet‐type boundary condition on an infinite layer

This paper is concerned with the standard Lp estimate of solutions to the resolvent problem for the Stokes operator on an infinite layer with ‘Neumann–Dirichlet‐type’ boundary condition. Copyright © 2004 John Wiley & Sons, Ltd.