The numerical approximation of center manifolds in Hamiltonian systems

In this paper we develop a numerical method for computing higher order local approximations of center manifolds near steady states in Hamiltonian systems. The underlying system is assumed to be large in the sense that a large sparse Jacobian at the equilibrium occurs, for which only a linear solver and a low-dimensional invariant subspace is available. Our method combines this restriction from linear algebra with the requirement that the center manifold is parametrized by a symplectic mapping and that the reduced equation preserves the Hamiltonian form. Our approach can be considered as a special adaptation of a general method from Numer. Math. 80 (1998) 1-38 to the Hamiltonian case such that approximations of the reduced Hamiltonian are obtained simultaneously. As an application we treat a finite difference system for an elliptic problem on an infinite strip.     

Convergent Algorithm Based on Progressive Regularization for Solving Pseudomonotone Variational Inequalities

In this paper, we extend the Moreau-Yosida regularization of monotone variational inequalities to the case of weakly monotone and pseudomonotone operators. With these properties, the regularized operator satisfies the pseudo-Dunn property with respect to any solution of the variational inequality problem. As a consequence, the regularized version of the auxiliary problem algorithm converges. In this case, when the operator involved in the variational inequality problem is Lipschitz continuous (a property stronger than weak monotonicity) and pseudomonotone, we prove the convergence of the progressive regularization introduced in Refs. 1, 2.     

Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques

We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples.     

Numerical method and models for anti-plane strain of a system with a thin elastic wedge

The paper presents a general method to find asymptotics for a (multi-)wedge system containing a thin wedge. It employs separation of the symmetric and anti-symmetric parts of the boundary displacements and tractions of the wedge. The method is applicable when the angle of the thin wedge turns to zero. A physical interpretation of the derived equations is obtained by using power expansions of non-polynomial functions, which appear after the Mellin transform. We establish that the first term in the expansion of the symmetric part corresponds to shear, while the first term of the anti-symmetric part describes deflection of the wedge axis. Numerical experiments, performed by using a code developed on the basis of the theory, show that using only the first terms of the expansions insignificantly influence accuracy: the approximate results coincide with the exact values of roots to the third significant digit even for the wedge angle of 30°.     

Large-scale computer simulation of fully developed turbulent channel flow with heat transfer

Recently, with the advent of supercomputers, there has been considerable interest in the use of direct numerical simulation to obtain information about turbulent shear flow at low Reynolds number. This paper presents a pseudospectral technique to solve the full three-dimensional time-dependent Navier-Stokes and advection-diffusion equations without the use of subgrid-scale modelling. The technique has not been previously used for fully developed turbulent channel flow simulation and is based on methods applied in other contexts. The emphasis of this paper is to provide a reasonably detailed account of how the simulation is done rather than to present new calculations of turbulence. The details of an algorithm for turbulent channel flow simulation and the grid and time step sizes needed to integrate through transient behaviour to steady state turbulence have not been published before and are presented here. Results from a Cray-2 simulation of fully developed turbulent flow in a channel with heat transfer are presented along with a critical comparison between experiment and computation. The first- and second-order moments agree well with experimental measurements; the agreement is poor for higher-order moments such as the skewness and flatness near the walls of the channel. Detailed information given about the effects of spatial grid resolution on a computed results is important for estimating the size of the computation required to study various aspects of a turbulent flow.     

第二讲合成孔径声纳成像及其研究进展

文章在介绍了图像声纳的特点、合成孔径声纳（synthetic aperture sonar,SAS）产生背景和发展过程的基础上,对合成孔径声纳的原理、技术难点、成像算法等问题进行了讨论.着重分析了合成孔径声纳成像过程中高分辨率的获取方法、水声信道对成像的影响、多子阵技术及其成像算法、稳定的声纳运动平台和运动监测问题、运动补偿与自聚焦方法等.文章还给出了国内外合成孔径声纳研究的最新进展情况,进而展望了合成孔径声纳的应用前景.     

Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment

We present an overview of the author’s Ph.D. thesis, supervised by P. Dejax and N. Bostel, which was defended in February 2006 at école des Mines de Nantes, France. The thesis is written in French, and is available at . It was conducted in the context of a research contract with a water distribution company. In a first section, we define multiperiod routing problems for service technicians. In a second section, we present some heuristics and a memetic algorithm used to solve these problems. The third section introduces optimal and near-optimal approaches based on column generation. Finally, we present some applications to the real-life case. The methods presented in Sects. 2, 3 and 4 were tested over several sets of problems, based on real-life statistics provided by the company.      

Standing waves, clustering, and phase waves in 1D simulations of kinetic relaxation oscillations in NO+NH3 on Pt(1 0 0) coupled by diffusion

The Lombardo–Imbihl–Fink (LFI) ODE model of the NO+NH₃ reaction on a Pt(1 0 0) surface shows stable relaxation oscillations with very sharp transitions for temperatures T between 404 and 433 K. Here we study numerically the effect of linear diffusive coupling of these oscillators in one spatial dimension. Depending on the parameters and initial conditions we find a rich variety of spatio-temporal patterns which we group into four main regimes: bulk oscillations (BOs), standing waves (SW), phase clusters (PC), and phase waves (PW). Two key ingredients for SW and PC are identified, namely the relaxation type of the ODE oscillations and a nonlocal (and nonglobal) coupling due to relatively fast diffusion of the kinetically slaved variables NH₃ and H. In particular, the latter replaces the global coupling through the gas phase used to obtain SW and PC in models of related surface reactions. The PW exist only under the assumption of (relatively) slow diffusion of NH₃ and H.     

A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem

In this paper we address a two-dimensional (2D) orthogonal packing problem, where a fixed set of small rectangles has to be placed on a larger stock rectangle in such a way that the amount of trim loss is minimized. The algorithm we propose hybridizes a placement procedure with a genetic algorithm based on random keys. The approach is tested on a set of instances taken from the literature and compared with other approaches. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm.