解单障碍问题的Lagrangian乘子非匹配网格区域分解法

针对二阶椭圆型单障碍问题提出了一类基于非匹配网格的Lagrang ian乘子非重叠型区域分解方法.并在适当条件下给出了该方法的收敛性分析和收敛速度估计.     

A reduced domain strategy for local mesh movement application in unstructured grids

Automatic control of mesh movement is mandatory in many fluid flow and fluid-solid interaction problems. This paper presents a new strategy, called reduced domain strategy (RDS), which enhances the efficiency of node connectivity-based mesh movement methods and moves the unstructured grid locally and effectively. The strategy dramatically reduces the grid computations by dividing the unstructured grid into two active and inactive zones. After any local boundary movement, the grid movement is performed only within the active zone. To enhance the efficiency of our strategy, we also develop an automatic mesh partitioning scheme. This scheme benefits from a new quasi-structured mesh data ordering, which determines the boundary of active zone in the original unstructured grid very easily. Indeed, the new partitioning scheme eliminates the need for sequential reordering of the original unstructured grid data in different mesh movement applications. We choose the spring analogy method and apply our new strategy to perform local mesh movements in two boundary movement problems including a multi-element airfoil with moving slat or deforming main body section. We show that the RDS is robust and cost effective. It can be readily employed in different node connectivity-based mesh movement methods. Indeed, the RDS provides a flexible local grid deformation tool for moving grid applications.     

一种基于网格模型的无限传感器网络K区域覆盖算法

目前无限传感器网络K覆盖问题的解决机制大都有颇为苛刻的假设条件,如要求节点具有很强的能量、节点的感知区域能被精确定义等.提出了一个基于布尔感知理论的分布式网格模型及相应的K区域覆盖算法,能够很好地处理感知区域形状不规则及大小发生变化的K覆盖问题,算法时间复杂度小,适用范围广泛.仿真实验证明了算法的有效性.     

基于网格化管理视角下灾后应急物流决策模型与算法研究

灾害发生后,应急资源的需求预测与应急配送中心的合理选址是实现高效救援的关键。本文通过在网格化管理视角下的信息更新将应急救援过程划分为多个阶段,在开展救援的过程中实现救援信息收集和救援预测的同步开展,建立一种多阶段带时间约束的应急救援物资配送响应-时效性的选址模型。借助遗传算法(NSGA-II),实现了基于编码结构独立、路径相互关联基础上的多目标规划求解。本研究的决策模型及算法有着较好的搜索与寻优能力,对实际救援开展具有指导意义。     

Multigrid preconditioned Krylov subspace methods for three-dimensional numerical solutions of the incompressible Navier–Stokes equations

We consider numerical methods for the incompressible Reynolds averaged Navier–Stokes equations discretized by finite difference techniques on non-staggered grids in body-fitted coordinates. A segregated approach is used to solve the pressure–velocity coupling problem. Several iterative pressure linear solvers including Krylov subspace and multigrid methods and their combination have been developed to compare the efficiency of each method and to design a robust solver. Three-dimensional numerical experiments carried out on scalar and vector machines and performed on different fluid flow problems show that a combination of multigrid and Krylov subspace methods is a robust and efficient pressure solver. This revised version was published online in June 2006 with corrections to the Cover Date.     

Transient gas flow simulation using an Adaptive Method of LinesSimulation d'écoulements dans un gazoduc par la méthode adaptative de lignes

Designing natural gas pipelines to safely and efficiently handle unsteady flows, requires knowledge of pressure drop, flowrate and temperature distribution throughout the system. The accurate prediction of these parameters is essential in order to achieve optimum cumulative deliverability, and safe and reliable operation. An Adaptive Method of Lines algorithm is formulated for the solution of Euler system of equations, which fully simulates slow and fast transients. Two test cases present the improvement of the numerical solution from grid adaptation. Good results are obtained both for slow and fast transients simulations proving that the suggested numerical procedure is appropriate for such predictions. To cite this article: E. Tentis et al., C. R. Mecanique 331 (2003).     

二维振荡叶栅非定常粘性流动数值模拟

采用显式四步Runge-Kutta格式，结合Baldwon-Lomax紊流模型求解Navier-Stokes方程，借助运动网格技术，完成了对二维振荡叶栅非定常粘性流动的数值模拟。为了加速求解过程，引入了变系数隐式残差光顺方法，取得了较好效果。数值结果与已公布的数据有很好的一致性。     

Schwarz domain decomposition for the incompressible Navier–Stokes equations in general co‐ordinates

This paper describes a domain decomposition method for the incompressible Navier–Stokes equations in general co‐ordinates. Domain decomposition techniques are needed for solving flow problems in complicated geometries while retaining structured grids on each of the subdomains. This is the so‐called block‐structured approach. It enables the use of fast vectorized iterative methods on the subdomains. The Navier–Stokes equations are discretized on a staggered grid using finite volumes. The pressure‐correction technique is used to solve the momentum equations together with incompressibility conditions. Schwarz domain decomposition is used to solve the momentum and pressure equations on the composite domain. Convergence of domain decomposition is accelerated by a GMRES Krylov subspace method. Computations are presented for a variety of flows. Copyright © 2000 John Wiley & Sons, Ltd.     

Considerations on the spring analogy

This paper presents an investigation on the spring analogy. The spring analogy serves for deformation in a moving boundary problem. First, two different kinds of springs are discussed: the vertex springs and the segment springs. The vertex spring analogy is originally used for smoothing a mesh after mesh generation or refinement. The segment spring analogy is used for deformation of the mesh in a moving boundary problem. The difference between the two methods lies in the equilibrium length of the springs. By means of an analogy to molecular theory, the two theories are generalized into a single theory that covers both. The usual choice of the stiffness of the spring is clarified by the mathematical analysis of a representative one‐dimensional configuration. The analysis shows that node collision is prevented when the stiffness is chosen as the inverse of the segment length. The observed similarity between elliptic grid generation and the spring analogy is also investigated. This investigation shows that both methods update the grid point position by a weighted average of the surrounding points in an iterative manner. The weighting functions enforce regularity of the mesh. Based on these considerations, several improvements on the spring analogy are developed. The principle of Saint Venant is circumvented by a boundary correction. The prevention of inversion of triangular elements is improved by semi‐torsional springs. The numerical results show the superiority of the segment spring analogy over the vertex one for a small rotation of an NACA0012 mesh. The boundary correction allows for large deformation of the mesh, where the standard spring analogy fails. The final test is performed on a Navier–Stokes mesh. This mesh contains high aspect ratio mesh cells near the boundary. Large deformation of this mesh shows that the semi‐torsional spring improvement is imperative to retain the validity of this mesh. Copyright © 2000 John Wiley & Sons, Ltd.     

Comparison Between the Mean-Variance Optimal and the Mean-Quadratic-Variation Optimal Trading Strategies

ABSTRACT

We compare optimal liquidation policies in continuous time in the presence of trading impact using numerical solutions of Hamilton–Jacobi–Bellman (HJB) partial differential equations (PDEs). In particular, we compare the time-consistent mean-quadratic-variation strategy with the time-inconsistent (pre-commitment) mean-variance strategy. We show that the two different risk measures lead to very different strategies and liquidation profiles. In terms of the optimal trading velocities, the mean-quadratic-variation strategy is much less sensitive to changes in asset price and varies more smoothly. In terms of the liquidation profiles, the mean-variance strategy is much more variable, although the mean liquidation profiles for the two strategies are surprisingly similar. On a numerical note, we show that using an interpolation scheme along a parametric curve in conjunction with the semi-Lagrangian method results in significantly better accuracy than standard axis-aligned linear interpolation. We also demonstrate how a scaled computational grid can improve solution accuracy.