We present a domain decomposition method on a semilinear hyperbolic system with multiple relaxation times. In the region where the relaxation time is small, an asymptotic equilibrium equation can be used for computational efficiency. An interface condition based on the sign of the characteristic speed at the interface is provided to couple the two systems in a domain decomposition setting. A rigorous analysis, based on the Laplace Transform, on the $ L^2$ error estimate is presented for the linear case, which shows how the error of the domain decomposition method depends on the smaller relaxation time, and the boundary and interface layer effects. The given convergence rate is optimal. We present a numerical implementation of this domain decomposition method, and give some numerical results in order to study the performance of this method.

In this article, we propose a novel approach to construct macroscopic balance equations and constitutive equations describing various irreversible phenomena. It is based on the general principles of non-equilibrium thermodynamics and consists of four basic steps: picking suitable state variables, choosing a strictly concave entropy function, properly separating entropy fuxes and production rates, and determining a dissipation matrix. Our approach takes advantage of both extended irreversible thermodynamics and GENERIC formalisms and shows a direct correspondence with Levermore’s moment-closure hierarchies for the Boltzmann equation. As a direct application, a new ten-moment model beyond the classical hierarchies is constructed and is shown to recover the Euler equations in the equilibrium state. These interesting results may put various macroscopic modeling approaches, starting from the general principles of non-equilibrium thermodynamics, on a solid microscopic foundation based on the Boltzmann equation.

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.

Given a strictly hyperbolic, genuinely nonlinear system of conservation laws, we prove the a priori bound u (t,) u (t,)= O (1)(1+ t) | ln | on the distance between an exact BV solution u and a viscous approximation u, letting the viscosity coefficient 0. In the proof, starting from u we construct an approximation of the viscous solution u by taking a mollification u* and inserting viscous shock profiles at the locations of finitely many large shocks for each fixed . Error estimates are then obtained by introducing new Lyapunov functionals that control interactions of shock waves in the same family and also interactions of waves in different families. 2004 Wiley Periodicals, Inc.

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.