On accurate boundary conditions for a shape sensitivity equation method

This paper studies the application of the continuous sensitivity equation method (CSEM) for the Navier–Stokes equations in the particular case of shape parameters. Boundary conditions for shape parameters involve flow derivatives at the boundary. Thus, accurate flow gradients are critical to the success of the CSEM. A new approach is presented to extract accurate flow derivatives at the boundary. High order Taylor series expansions are used on layered patches in conjunction with a constrained least‐squares procedure to evaluate accurate first and second derivatives of the flow variables at the boundary, required for Dirichlet and Neumann sensitivity boundary conditions. The flow and sensitivity fields are solved using an adaptive finite‐element method. The proposed methodology is first verified on a problem with a closed form solution obtained by the Method of Manufactured Solutions. The ability of the proposed method to provide accurate sensitivity fields for realistic problems is then demonstrated. The flow and sensitivity fields for a NACA 0012 airfoil are used for fast evaluation of the nearby flow over an airfoil of different thickness (NACA 0015). Copyright © 2005 John Wiley & Sons, Ltd.     

A new algorithm for fixed design regression and denoising

In this paper, we present a new algorithm to estimate a regression function in a fixed design regression model, by piecewise (standard and trigonometric) polynomials computed with an automatic choice of the knots of the subdivision and of the degrees of the polynomials on each sub-interval. First we give the theoretical background underlying the method: the theoretical performances of our penalized least-squares estimator are based on non-asymptotic evaluations of a mean-square type risk. Then we explain how the algorithm is built and possibly accelerated (to face the case when the number of observations is great), how the penalty term is chosen and why it contains some constants requiring an empirical calibration. Lastly, a comparison with some well-known or recent wavelet methods is made: this brings out that our algorithm behaves in a very competitive way in term of denoising and of compression.     

Modification of Spatial Coherence by Means of Low-Order Zernike-Mode Adaptive Optics

Spatial coherence of the field modified by low-order adaptive optics is analyzed to establish a theoretical basis for the recent idea of using adaptive optics as a spatial coherence modifier. In this context low-order adaptive optics has the ability to correct some of the low-order aberrations specified by Zernike polynomials. The initial field to be modified is assumed to be a spatially partially coherent one resulting from phase disturbance. It is demonstrated, as in the previous study, that low-order adaptive optics serves to enhance the spatial coherence of the resultant field and that the effect of the enhancement becomes stronger as the spatial coherence of the initially partially coherent field increases. Potential applications of low-order adaptive optics as a spatial coherence modifier are briefly discussed.     

On the Solution of Discontinuous IVPs by Adaptive Runge–Kutta Codes

In this paper an automatic technique for handling discontinuous IVPs when they are solved by means of adaptive Runge–Kutta codes is proposed. This technique detects, accurately locates and passes the discontinuities in the solution of IVPs by using the information generated by the code along the numerical integration together with a continuous interpolant of the discrete solution. A remarkable feature is that it does not require additional information on the location of the discontinuities. Some numerical experiments are presented to illustrate the reliability and efficiency of the proposed algorithms.     

耦合发电机系统的自适应控制与同步

讨论了耦合发电机系统的自适应控制和参数未知时的自适应同步问题.设计了自适应控制器，将耦合发电机系统的混沌轨道镇定到平衡点，并使得两个参数未知的耦合发电机系统达到了混沌同步.数值模拟验证了所设计的控制器的有效性. 关键词： 耦合发电机系统 自适应控制 平衡点 同步     

Least‐squares finite element method on adaptive grid for PDEs with shocks

We apply the least‐squares finite element method with adaptive grid to nonlinear time‐dependent PDEs with shocks. The least‐squares finite element method is also used in applying the deformation method to generate the adaptive moving grids. The effectiveness of this method is demonstrated by solving a Burgers' equation with shocks. Computational results on uniform grids and adaptive grids are compared for the purpose of evaluation. The results show that the adaptive grids can capture the shock more sharply with significantly less computational time. For moving shock, the adaptive grid moves correctly with the shock. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.     

一种新型频域均衡器在水声通信中的应用

在传统频域均衡器的基础上,结合多载波频移键控调制方式的频谱结构,利用接收信号和参考信号的相关性及均衡器的滤波系数,提出了一种兼具均衡与解调功能的新型频域均衡器结构.该均衡器简单、有效地克服了水声信道中多径传播产生的码间干扰和频率选择性衰落等问题,简化了水声通信系统接收机的复杂度. 新型频域均衡器的解调原理以非相关解调算法为基础,但由于利用了均衡器的计算结果,其差错性能优于传统的非相关解调算法,计算机仿真试验表明,改进后的方法使差错性能提高了2 dB;实际水声通信实验表明,该均衡器能够有效地提高水声通信系统的可靠性,具有很好的应用前景.     

Equality and inequality constrained optimization algorithms with convergent stepsizes

In this paper, we consider two algorithms for nonlinear equality and inequality constrained optimization. Both algorithms utilize stepsize strategies based on differentiable penalty functions and quadratic programming subproblems. The essential difference between the algorithms is in the stepsize strategies used. The objective function in the quadratic subproblem includes a linear term that is dependent on the penalty functions. The quadratic objective function utilizes an approximate Hessian of the Lagrangian augmented by the penalty functions. In this approximation, it is possible to ignore the second-derivative terms arising from the constraints in the penalty functions.The penalty parameter is determined using a strategy, slightly different for each algorithm, that ensures boundedness as well as a descent property. In particular, the boundedness follows as the strategy is always satisfied for finite values of the parameter.These properties are utilized to establish global convergence and the condition under which unit stepsizes are achieved. There is also a compatibility between the quadratic objective function and the stepsize strategy to ensure the consistency of the properties for unit steps and subsequent convergence rates.This research was funded by SERC and ESRC research contracts. The author is grateful to Professors Laurence Dixon and David Mayne for their comments. The numerical results in the paper were obtained using a program written by Mr. Robin Becker.     

Adaptive approach for nonlinear sensitivity analysis of reaction kinetics

We present a unified approach for linear and nonlinear sensitivity analysis for models of reaction kinetics that are stated in terms of systems of ordinary differential equations (ODEs). The approach is based on the reformulation of the ODE problem as a density transport problem described by a Fokker-Planck equation. The resulting multidimensional partial differential equation is herein solved by extending the TRAIL algorithm originally introduced by Horenko and Weiser in the context of molecular dynamics (J. Comp. Chem. 2003, 24, 1921) and discussed it in comparison with Monte Carlo techniques. The extended TRAIL approach is fully adaptive and easily allows to study the influence of nonlinear dynamical effects. We illustrate the scheme in application to an enzyme-substrate model problem for sensitivity analysis w.r.t. to initial concentrations and parameter values.