In this paper, we adapt a simple weighted essentially non-oscillatory (WENO) limiter, originally designed for discontinuous Galerkin (DG) schemes, to the correction procedure via reconstruction (CPR) framework for solving conservation laws. The objective of this simple WENO limiter is to simultaneously maintain uniform high order accuracy of the CPR framework in smooth regions and control spurious numerical oscillations near discontinuities. The WENO limiter we adopt in this paper is particularly simple to implement and will not harm the conservativeness of the CPR framework. Also, it uses information only from the target cell and its immediate neighbors, thus can maintain the compactness of the CPR framework. Since the CPR framework with the WENO limiter does not in general preserve positivity of the solution, we also extend the positivity preserving limiters to the CPR framework. Numerical results in one and two dimensions are provided to illustrate the good behavior of this procedure.

No abstract uploaded!

No abstract uploaded!

We find some necessary conditions for a real Banach space to be an almost CL-space. We also discuss the stability of CL-spaces and almost CL-spaces by$c$_{0}- and$l$_{1}-sums. Finally, we address the question if a space of vector-valued continuous functions can be a CL-space or an almost CL-space.

A computational method, based on ₁-minimization, is proposed for the problem of link flow correction, when the available traffic flow data on many links in a road network are inconsistent with respect to the flow conservation law. Without extra information, the problem is generally ill-posed when a large portion of the link sensors are unhealthy. It is possible, however, to correct the corrupted link flows accurately with the proposed method under a recoverability condition if there are only a few bad sensors which are located at certain links. We analytically identify the links that are robust to miscounts and relate them to the geometric structure of the traffic network by introducing the recoverability concept and an algorithm for computing it. The recoverability condition for corrupted links is simply the associated recoverability being greater than 1. In a more realistic setting, besides the unhealthy link sensors, small