A computational method, based on l1-norm minimization, is proposed for the problem traffic flow correction. 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 corruptions accurately if there are only a few bad sensors which are located at certain links by the proposed method. We mathematically quantify these links that are robust to miscounts and relate them to the geometric structure of the traffic network. In a more realistic setting, besides the unhealthy link sensors, if small measure noise are present at the other sensors, our method guarantees to give an estimated traffic flow fairly close to the ground-truth. Both toy and real-world examples are provided to demonstrate the effectiveness of the proposed method.

In this paper, we introduce a new Glimm functional for general systems of hyperbolic conservation laws. This new functional is consistent with the classical Glimm functional for the case when each characteristic field is either genuinely nonlinear or linearly degenerate, so that it can be viewed as optimal in some sense. With this new functional, the consistency of the Glimm scheme is proved clearly for general systems. Moreover, the convergence rate of the Glimm scheme is shown to be the same as the one obtained in Bressan, Marson (Arch Ration Mech Anal 142(2):155176, 1998) for systems with each characteristic field being genuinely nonlinear or linearly degenerate.

In this paper, we study the strong convergence of a sequence of uniform<i>L^p</i>_loc(<b>R</b><b>R</b>⁺) bounded approximate solutions {<i>u</i>(<i>x</i>,<i>t</i>)} to the following scalar conservation laws[formula]with initial data[formula]Without the convexity assumption and growth condition at infinity for<i>f</i>(<i>x</i>,<i>t</i>,<i>u</i>), we prove strong convergence of a subsequence of {<i>u</i>(<i>x</i>,<i>t</i>)}. Under a more general growth condition than those in the previous work, we prove the existence of weak solution for the equation. The result obtained here generalizes those in earlier work. Some applications of the results are also given at the end of this paper.

In this work, we consider the numerical solution of the nonlinear Schrödinger equation with a highly oscillatory potential (NLSE-OP). The NLSE-OP is a model problem which frequently occurs in recent studies of some multiscale dynamical systems, where the potential introduces wide temporal oscillations to the solution and causes numerical difficulties. We aim to analyze rigorously the error bounds of the splitting schemes for solving the NLSE-OP to a fixed time. Our theoretical results show that the Lie–Trotter splitting scheme is uniformly and optimally accurate at the first order provided that the oscillatory potential is integrated exactly, while the Strang splitting scheme is not. Our results apply to general dispersive or wave equations with an oscillatory potential. The error estimates are confirmed by numerical results.

It is well-known that one-dimensional isentropic gas dynamics has two elementary waves, i.e., shock wave and rarefaction wave. Among the two waves, only the rarefaction wave can be connected to a vacuum. Given a rarefaction wave with one-side vacuum state to the compressible Euler equations, we can construct a sequence of solutions to one-dimensional compressible isentropic NavierStokes equations which converge to the above rarefaction wave with vacuum as the viscosity tends to zero. Moreover, the uniform convergence rate is obtained. The proof consists of a scaling argument and elementary energy analysis based on the underlying rarefaction wave structures.