We study the large time asymptotic speeds (turbulent flame speeds sT) of the simplified HamiltonJacobi (HJ) models arising in turbulent combustion. One HJ model is G-equation describing the front motion law in the form of local normal velocity equal to a constant (laminar speed) plus the normal projection of fluid velocity. In level set formulation, G-equations are HJ equations with convex (L1 type) but non-coercive Hamiltonians. The other is the quadratically nonlinear (L2 type) inviscid HJ model of MajdaSouganidis derived from the KolmogorovPetrovskyPiskunov reactive fronts. Motivated by a question posed by Embid, Majda and Souganidis (1995)[10], we compare the turbulent flame speeds sTs from these inviscid HJ models in two-dimensional cellular flows or a periodic array of steady vortices via sharp asymptotic estimates in the regime of large amplitude. The estimates are obtained by analyzing the action minimizing trajectories in the Lagrangian representation of solutions (Lax formula and its extension) in combination with delicate gradient bound of viscosity solutions to the associated cell problem of homogenization. Though the inviscid turbulent flame speeds share the same leading order asymptotics, their difference due to nonlinearities is identified as a subtle double logarithm in the large flow amplitude from the sharp growth laws. The turbulent flame speeds differ much more significantly in the corresponding viscous HJ models. 2013 Elsevier Masson SAS. All rights reserved.

Edge states attract more and more research interests owing to the novel topologically protected properties. In this work, we studied edge modes and traveling edge states via the linear Dirac equation with so-called edge-admissible masses. The unidirectional edge state provides a heuristic approach to more general traveling edge states through the localized behavior along slowly varying edges. We show the dominated asymptotic solutions of two typical edge states that follow circular and curved edges with small curvature by the analytic and quantitative arguments.

We study the front dynamics of the bistable reaction-diffusion equations with periodic diffusion and/or convection coefficients in several space dimensions. When traveling wave solutions exist, the solutions of the initial value problem behave as wave fronts propagating with the effective speeds of traveling waves under various initial conditions. Yet due to the bistable nature of the nonlinearity, traveling waves may not always exist when the medium variations from the mean states are large enough. Their existence is closely related to the detailed forms of diffusion and convection coefficients, more so in multidimension than in one. We present a simple sufficient condition for the nonexistence of traveling waves (quenching) using perturbation method. Our two dimensional finite difference numerical computations show a variety of front behaviors, such as: the propagation, quenching and retreat of fronts. We found

ABSTRACT We investigate a kinetic model for the sedimentation of dilute suspensions of rod-like particles under gravity, deduced by Helzel, Otto, and Tzavaras (2011), which couples the impressible (Navier-)Stokes equation with the Fokker-Planck equation. With a no-flux boundary condition for the distribution function, we establish the existence and uniqueness of a global weak solution to the two dimensional model involving the Stokes equation.

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