This paper is concerned with the 3-D Cauchy problem for the compressible viscous fluid flow taking into account the radiation effect. For more general gases including ideal polytropic gas, we prove that there exists a unique smooth solutions in [0, ∞), provided that the initial perturbations are small. Moreover, the time decay rates of the global solutions are obtained for higher-order spatial derivatives of density, velocity, temperature, and the radiative heat flux.
We present a novel approach to solving a specific type of quasilinear boundary value problem with p-Laplacian that can be considered an alternative to the classic approach based on the mountain pass theorem. We introduce a new way of proving the existence of nontrivial weak solutions. We show that the nontrivial solutions of the problem are related to critical points of a certain functional different from the energy functional, and some solutions correspond to its minimum. This idea is new even for p = 2. We present an algorithm based on the introduced theory and apply it to the given problem. The algorithm is illustrated by numerical experiments and compared with the classic approach.
The aim of this short paper is threefold. First, we develop an implicit generalization of a constitutive relation introduced by Korteweg (1901) that can describe the phenomenon of capillarity. Second, using a sub-class of the constitutive relations (implicit Euler equations), we show that even in that simple situation more than one of the members of the sub-class may be able to describe one or a set of experiments one is interested in describing, and we must determine which amongst these constitutive relations is the best by culling the class by systematically comparing against an increasing set of observations. (The implicit generalization developed in this paper is not a sub-class of the implicit generalization of the Navier-Stokes fluid developed by Rajagopal (2003), (2006) or the generalization due to Průša and Rajagopal (2012), as spatial gradients of the density appear in the constitutive relation developed by Korteweg (1901).) Third, we introduce a challenging set of partial differential equations that would lead to new techniques in both analysis and numerical analysis to study such equations.
A macroscopic traffic flow model considering the effects of curves, ramps, and adverse weather is proposed, and nonlinear bifurcation theory is used to describe and predict nonlinear traffic phenomena on highways from the perspective of global stability of the traffic system. Firstly, the stability conditions of the model shock wave were investigated using the linear stability analysis method. Then, the long-wave mode at the coarse-grained scale is considered, and the model is analyzed using the reduced perturbation method to obtain the Korteweg-de Vries (KdV) equation of the model in the sub-stable region. In addition, the type of equilibrium points and their stability are discussed by using bifurcation analysis, and a theoretical derivation proves the existence of Hopf bifurcation and saddle-knot bifurcation in the model. Finally, the simulation density spatio-temporal and phase plane diagrams verify that the model can describe traffic phenomena such as traffic congestion and stop-and-go traffic in real traffic, providing a theoretical basis for the prevention of traffic congestion.
We study a binary mixture of compressible viscous fluids modelled by the Navier-Stokes-Allen-Cahn system with isentropic or ideal gas law. We propose a finite volume method for the approximation of the system based on upwinding and artificial diffusion approaches. We prove the entropy stability of the numerical method and present several numerical experiments to support the theory.
We provide a theoretical study of the iterative hard thresholding with partially known support set (IHT-PKS) algorithm when used to solve the compressed sensing recovery problem. Recent work has shown that IHT-PKS performs better than the traditional IHT in reconstructing sparse or compressible signals. However, less work has been done on analyzing the performance guarantees of IHT-PKS. In this paper, we improve the current RIP-based bound of IHT-PKS algorithm from ({delta _{3s - 2k}} < {1 over {sqrt {32}}} approx 0.1768) to ({delta _{3s - 2k}} < {{sqrt 5 - 1} over 4}), where δ3s−2k is the restricted isometric constant of the measurement matrix. We also present the conditions for stable reconstruction using the IHTμ-PKS algorithm which is a general form of IHT-PKS. We further apply the algorithm on Least Squares Support Vector Machines (LS-SVM), which is one of the most popular tools for regression and classification learning but confronts the loss of sparsity problem. After the sparse representation of LS-SVM is presented by compressed sensing, we exploit the support of bias term in the LS-SVM model with the IHTμ-PKS algorithm. Experimental results on classification problems show that IHTμ-PKS outperforms other approaches to computing the sparse LS-SVM classifier.
In the past years, we observed an increased interest in rate-dependent hysteresis models to characterize complex time-dependent nonlinearities in smart actuators. A natural way to include rate-dependence to the Prandtl-Ishlinskii model is to consider it as a linear combination of play operators whose thresholds are functions of time. In this work, we propose the extension of the class of rate-dependent Prandtl-Ishlinskii operators to the case of a whole continuum of play operators with time-dependent thresholds. We prove the existence of an analytical inversion formula, and illustrate its applicability in the study of error bounds for inverse compensation.
For the symmetric Pareto Eigenvalue Complementarity Problem (EiCP), by reformulating it as a constrained optimization problem on a differentiable Rayleigh quotient function, we present a class of descent methods and prove their convergence. The main features include: using nonlinear complementarity functions (NCP functions) and Rayleigh quotient gradient as the descent direction, and determining the step size with exact linear search. In addition, these algorithms are further extended to solve the Generalized Eigenvalue Complementarity Problem (GEiCP) derived from unilateral friction elastic systems. Numerical experiments show the efficiency of the proposed methods compared to the projected steepest descent method with less CPU time.