A class of deformational flow test cases for linear transport problems on the sphere

A class of new benchmark deformational flow test cases for the two-dimensional horizontal linear transport problems on the sphere is proposed. The scalar field follows complex trajectories and undergoes severe deformation during the simulation; however, the flow reverses its course at half-time and the scalar field returns to its initial position and shape. This process makes the exact solution available at the end of the simulation, and facilitates assessment of the accuracy of the underlying transport scheme. A procedure to eliminate possible cancellations of errors when the flow reverses is proposed.     

Positivity preserving semi-Lagrangian discontinuous Galerkin formulation: Theoretical analysis and application to the Vlasov–Poisson system

Semi-Lagrangian (SL) methods have been very popular in the Vlasov simulation community , , , , , ,  and . In this paper, we propose a new Strang split SL discontinuous Galerkin (DG) method for solving the Vlasov equation. Specifically, we apply the Strang splitting for the Vlasov equation [6], as a way to decouple the nonlinear Vlasov system into a sequence of 1-D advection equations, each of which has an advection velocity that only depends on coordinates that are transverse to the direction of propagation. To evolve the decoupled linear equations, we propose to couple the SL framework with the semi-discrete DG formulation. The proposed SL DG method is free of time step restriction compared with the Runge–Kutta DG method, which is known to suffer from numerical time step limitation with relatively small CFL numbers according to linear stability analysis. We apply the recently developed positivity preserving (PP) limiter [37], which is a low-cost black box procedure, to our scheme to ensure the positivity of the unknown probability density function without affecting the high order accuracy of the base SL DG scheme. We analyze the stability and accuracy properties of the SL DG scheme by establishing its connection with the direct and weak formulations of the characteristics/Lagrangian Galerkin method [23]. The quality of the proposed method is demonstrated via basic test problems, such as linear advection and rigid body rotation, and via classical plasma problems, such as Landau damping and the two stream instability.     

New interpolation technique for the CIP method on curvilinear coordinates

We propose a new interpolation technique for the CIP method applied to curvilinear coordinates. The CIP method can hardly maintain third-order accuracy on curvilinear coordinates. The reason for the degeneracy in accuracies has not been discussed in detail. This paper reveals the problems of the CIP method on curvilinear coordinates and presents an improved CIP method to solve the advection equation accurately. The features of the presented method are: (1) the metric computation on the upwind stencil is defined in the same manner as in the advection phase of the CIP method; and (2) gradient values in the physical domain in the computation on the curvilinear coordinates are used. Various test problems show that the improved CIP method has approximate third-order accuracy.     

AN EFFICIENT METHOD FOR MULTIOBJECTIVE OPTIMAL CONTROL AND OPTIMAL CONTROL SUBJECT TO INTEGRAL CONSTRAINTS

We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a ＂budget＂ remaining to satisfy each constraint; the augmented Hamilton-Jacobi-Bellman PDE is then solved numerically. The efficiency of our approach hinges on the causality in that PDE, i.e., the monotonicity of characteristic curves in one of the newly added dimensions. A semi-Lagrangian ＂marching＂ method is used to approximate the discontinuous viscosity solution efficiently. We compare this to a recently introduced ＂weighted sum＂ based algorithm for the same problem [25]. We illustrate our method using examples from flight path planning and robotic navigation in the presence of friendly and adversarial observers.     

A Semi-Lagrangian Runge-Kutta Method for Time-Dependent Partial Differential Equations

In this paper, a Semi-Lagrangian Runge-Kutta method is proposed to com-pute the numerical solution of time-dependent partial di®erential equations.The method is based on Lagrangian trajectory or the integration from the de-parture points to the arrival points (regular nodes). The departure points aretraced back from the arrival points along the trajectory of the path. The highorder interpolation is needed to compute the approximations of the solutionson the departure points, which most likely are not the regular nodes. On thetrajectory of the path, the similar techniques of Runge-Kutta are applied to theequations to generate the high order Semi-Lagrangian Runge-Kutta method.The numerical examples show that this method works very effient for thetime-dependent partial di®erential equations.     

High-performance high-resolution semi-Lagrangian tracer transport on a sphere

Current climate models have a limited ability to increase spatial resolution because numerical stability requires the time step to decrease. We describe a semi-Lagrangian method for tracer transport that is stable for arbitrary Courant numbers, and we test a parallel implementation discretized on the cubed sphere. The method includes a fixer that conserves mass and constrains tracers to a physical range of values. The method shows third-order convergence and maintains nonlinear tracer correlations to second order. It shows optimal accuracy at Courant numbers of 10–20, more than an order of magnitude higher than explicit methods. We present parallel performance in terms of strong scaling, weak scaling, and spatial scaling (where the time step stays constant while the resolution increases). For a 0.2° test with 100 tracers, the implementation scales efficiently to 10,000 MPI tasks.     

求解无容量设施选址问题的半拉格朗日松弛新方法

无容量设施选址问题Un-capacitated Facility Location, UFL是应用于诸多领域的经典组合优化难题, 半拉格朗日松弛方法是求解UFL问题的一种精确方法. 分析了半拉格朗日松弛方法在求解UFL问题时所具有的性质, 在此基础上, 对求解UFL问题的半拉格朗日松弛方法进行了一定的理论完善, 并探讨了提高半拉格朗日松弛方法求解性能的有效途径.数值计算结果表明：改进方法具有明显的可行性和有效性.     

Semi-Lagrangian advection–propagation (SLAP) scheme for three-dimensional interface tracking

A fully three-dimensional semi-Lagrangian scheme is developed for computing the evolution of advected self-propagating surfaces (e.g., premixed flames) governed by a level-set advection–propagation equation. The scheme provides third-order spatial accuracy and shape preservation. Example numerical simulations of three-dimensional front propagation are presented to illustrate the capability of the scheme of capturing cusp formation and associated surface-area annihilation as well as the formation and consumption of detached closed-surface pockets behind fronts propagating in highly vortical flow.     

Charge-conserving grid based methods for the Vlasov–Maxwell equations

In this article, we introduce numerical schemes for the Vlasov–Maxwell equations relying on different kinds of grid-based Vlasov solvers, as opposite to PIC schemes, which enforce a discrete continuity equation. The idea underlying these schemes relies on a time-splitting scheme between configuration space and velocity space for the Vlasov equation and on the computation of the discrete current in a form that is compatible with the discrete Maxwell solver.     

EQUIVALENCE OF SEMI-LAGRANGIAN AND LAGRANGE-GALERKIN SCHEMES UNDER CONSTANT ADVECTION SPEED

We compare in this paper two major implementations of large time-step schemes for advection equations, i.e., Semi-Lagrangian and Lagrange-Galerkin techniques. We show that SL schemes are equivalent to exact LG schemes via a suitable definition of the basis functions. In this paper, this equivalence will be proved assuming some simplifying hypoteses, mainly constant advection speed, uniform space grid, symmetry and translation invariance of the cardinal basis functions for interpolation. As a byproduct of this equivalence, we obtain a simpler proof of stability for SL schemes in the constant-coefficient case.