Optimal density lower bound on nonisentropic gas dynamics
نویسندگان
چکیده
منابع مشابه
Lower Bound of Density for Lipschitz Continuous Solutions in the Isentropic Gas Dynamics
For the Euler equations of isentropic gas dynamics in one space dimension, also knowns as p-system in Lagrangian coordinate, it is known that the density can be arbitrarily close to zero as time goes to infinity, even when initial density is uniformly away from zero. In this paper, for uniform positive initial density, we prove the density in any Lipschitz continuous solutions for Cauchy proble...
متن کاملOptimal Time-dependent Lower Bound on Density for Classical Solutions of 1-d Compressible Euler Equations
For compressible Euler equations, even when initial data are uniformly away from vacuum, solution can approach vacuum in infinite time. Achieving sharp lower bounds of density is crucial in the study of Euler equations. In this paper, for initial value problems of isentropic and full Euler equations in one space dimension, assuming initial density has positive lower bound, we prove that density...
متن کاملA Lower Bound on the Cosmic Baryon Density
We derive lower bounds on the cosmic baryon density from the requirement that the high-redshift intergalactic medium (IGM) contain enough neutral hydrogen to produce the observed Lyα absorption in quasar spectra. The key theoretical assumption that leads to these analytic bounds is that absorbing structures are no more extended in redshift space than they are in real space. This assumption migh...
متن کاملNew Lower Bound on the Critical Density in Continuum Percolation
Percolation theory has become a useful tool for the analysis of large scale wireless networks. We investigate the fundamental problem of characterizing the critical density λc for Poisson random geometric graphs in continuum percolation theory. In two-dimensional space with the Euclidean norm, simulation studies show λc ≈ 1.44, while the best theoretical bounds obtained thus far are 0.696 < λc ...
متن کاملOn Searching Sorted Lists: A Near-Optimal Lower Bound
We obtain improved lower bounds for a class of static and dynamic data structure problems that includes several problems of searching sorted lists as special cases. These lower bounds nearly match the upper bounds given by recent striking improvements in searching algorithms given by Fredman andWillard's fusion trees [9] and Andersson's search data structure [5]. Thus they show sharp limitation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Equations
سال: 2020
ISSN: 0022-0396
DOI: 10.1016/j.jde.2019.10.017