No abstract uploaded!

No abstract uploaded!

A class of upwind flux splitting methods in the Euler equations of compressible flow is considered in this paper. Using the property that Euler flux F(U) is a homogeneous function of degree one in U, we reformulate the splitting fluxes with F^{+}=A^{+} U, F^{-}=A^{-} U, and the corresponding matrices are either symmetric or symmetrizable and keep only non-negative and non-positive eigenvalues. That leads to the conclusion that the first order schemes are positive in the sense of Lax-Liu [18], which implies that it is L^2-stable in some suitable sense. Moreover, the second order scheme is a stable perturbation of the first order scheme, so that the positivity of the second order schemes is also established, under a CFL-like condition. In addition, these splitting methods preserve the positivity of density and energy.

A computational method, based on l1-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 measurement noises may be present at the other sensors. Under the same recoverability condition, our method guarantees to give an estimated traffic flow fairly close to the ground-truth data and leads to a bound for the correction error. Both synthetic and real-world examples are provided to demonstrate the effectiveness of the proposed method.

It is well known that the second-order cone and the circular cone have many analogous properties. In particular, there exists an important distance inequality associated with the second-order cone and the circular cone. The inequality indicates that the distances of arbitrary points to the second-order cone and the circular cone are equivalent, which is crucial in analyzing the tangent cone and normal cone for the circular cone. In this paper, we provide an alternative approach to achieve the aforementioned inequality. Although the proof is a bit longer than the existing one, the new approach offers a way to clarify when the equality holds. Such a clarification is helpful for further study of the relationship between the second-order cone programming problems and the circular cone programming problems.