skip to main content


Title: Lp time asymptotic decay for general hyperbolic–parabolic balance laws with applications
We study the time asymptotic decay of solutions for a general system of hyperbolic–parabolic balance laws in one space dimension. The system has a physical viscosity matrix and a lower-order term for relaxation, damping or chemical reaction. The viscosity matrix and the Jacobian matrix of the lower-order term are rank deficient. For Cauchy problem around a constant equilibrium state, existence of solution global in time has been established recently under a set of reasonable assumptions. In this paper, we obtain optimal [Formula: see text] decay rates for [Formula: see text]. Our result is general and applies to models such as Keller–Segel equations with logarithmic chemotactic sensitivity and logistic growth, and gas flows with translational and vibrational non-equilibrium. Our result also recovers or improves the existing results in literature on the special cases of hyperbolic–parabolic conservation laws and hyperbolic balance laws, respectively.  more » « less
Award ID(s):
1908195
NSF-PAR ID:
10155910
Author(s) / Creator(s):
Date Published:
Journal Name:
Journal of Hyperbolic Differential Equations
Volume:
16
Issue:
04
ISSN:
0219-8916
Page Range / eLocation ID:
663 to 700
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We consider a [Formula: see text] system of hyperbolic balance laws that is the converted form under inverse Hopf–Cole transformation of a Keller–Segel type chemotaxis model. We study Cauchy problem when Cauchy data connect two different end-states as [Formula: see text]. The background wave is a diffusive contact wave of the reduced system. We establish global existence of solution and study the time asymptotic behavior. In the special case where the cellular population initially approaches its stable equilibrium value as [Formula: see text], we obtain nonlinear stability of the diffusive contact wave under smallness assumption. In the general case where the population initially does not approach to its stable equilibrium value at least at one of the far fields, we use a correction function in the time asymptotic ansatz, and show that the population approaches logistically to its stable equilibrium value. Our result shows two significant differences when comparing to Euler equations with damping. The first one is the existence of a secondary wave in the time asymptotic ansatz. This implies that our solutions converge to the diffusive contact wave slower than those of Euler equations with damping. The second one is that the correction function logistically grows rather than exponentially decays. 
    more » « less
  2. The fundamental problem in the study of parallel-server systems is that of finding and analyzing routing policies of arriving jobs to the servers that efficiently balance the load on the servers. The most well-studied policies are (in decreasing order of efficiency) join the shortest workload (JSW), which assigns arrivals to the server with the least workload; join the shortest queue (JSQ), which assigns arrivals to the smallest queue; the power-of-[Formula: see text] (PW([Formula: see text])), which assigns arrivals to the shortest among [Formula: see text] queues that are sampled from the total of [Formula: see text] queues uniformly at random; and uniform routing, under which arrivals are routed to one of the [Formula: see text] queues uniformly at random. In this paper we study the stability problem of parallel-server systems, assuming that routing errors may occur, so that arrivals may be routed to the wrong queue (not the smallest among the relevant queues) with a positive probability. We treat this routing mechanism as a probabilistic routing policy, named a [Formula: see text]-allocation policy, that generalizes the PW([Formula: see text]) policy, and thus also the JSQ and uniform routing, where [Formula: see text] is an [Formula: see text]-dimensional vector whose components are the routing probabilities. Our goal is to study the (in)stability problem of the system under this routing mechanism, and under its “nonidling” version, which assigns new arrivals to an idle server, if such a server is available, and otherwise routes according to the [Formula: see text]-allocation rule. We characterize a sufficient condition for stability, and prove that the stability region, as a function of the system’s primitives and [Formula: see text], is in general smaller than the set [Formula: see text]. Our analyses build on representing the queue process as a continuous-time Markov chain in an ordered space of [Formula: see text]-dimensional real-valued vectors, and using a generalized form of the Schur-convex order. 
    more » « less
  3. Monodisperse suspensions of Brownian colloidal spheres crystallize at high densities, and ordering under shear has been observed at densities below the crystallization threshold. We perform large-scale simulations of a model suspension containing over [Formula: see text] particles to quantitatively study the ordering under shear and to investigate its link to the rheological properties of the suspension. We find that at high rates, for [Formula: see text], the shear flow induces an ordering transition that significantly decreases the measured viscosity. This ordering is analyzed in terms of the development of layering and planar order, and we determine that particles are packed into hexagonal crystal layers (with numerous defects) that slide past each other. By computing local [Formula: see text] and [Formula: see text] order parameters, we determine that the defects correspond to chains of particles in a squarelike lattice. We compute the individual particle contributions to the stress tensor and discover that the largest contributors to the shear stress are primarily located in these lower density, defect regions. The defect structure enables the formation of compressed chains of particles to resist the shear, but these chains are transient and short-lived. The inclusion of a contact friction force allows the stress-bearing structures to grow into a system-spanning network, thereby disrupting the order and drastically increasing the suspension viscosity. 
    more » « less
  4. We develop provably efficient reinforcement learning algorithms for two-player zero-sum finite-horizon Markov games with simultaneous moves. To incorporate function approximation, we consider a family of Markov games where the reward function and transition kernel possess a linear structure. Both the offline and online settings of the problems are considered. In the offline setting, we control both players and aim to find the Nash equilibrium by minimizing the duality gap. In the online setting, we control a single player playing against an arbitrary opponent and aim to minimize the regret. For both settings, we propose an optimistic variant of the least-squares minimax value iteration algorithm. We show that our algorithm is computationally efficient and provably achieves an [Formula: see text] upper bound on the duality gap and regret, where d is the linear dimension, H the horizon and T the total number of timesteps. Our results do not require additional assumptions on the sampling model. Our setting requires overcoming several new challenges that are absent in Markov decision processes or turn-based Markov games. In particular, to achieve optimism with simultaneous moves, we construct both upper and lower confidence bounds of the value function, and then compute the optimistic policy by solving a general-sum matrix game with these bounds as the payoff matrices. As finding the Nash equilibrium of a general-sum game is computationally hard, our algorithm instead solves for a coarse correlated equilibrium (CCE), which can be obtained efficiently. To our best knowledge, such a CCE-based scheme for optimism has not appeared in the literature and might be of interest in its own right. 
    more » « less
  5. null (Ed.)
    We consider a hyperbolic–parabolic system arising from a chemotaxis model in tumor angiogenesis, which is described by a Keller–Segel equation with singular sensitivity. It is known to allow viscous shocks (so-called traveling waves). We introduce a relative entropy of the system, which can capture how close a solution at a given time is to a given shock wave in almost [Formula: see text]-sense. When the shock strength is small enough, we show the functional is non-increasing in time for any large initial perturbation. The contraction property holds independently of the strength of the diffusion. 
    more » « less