For the free surface problem of the highly subsonic heat-conducting inviscid flow in 2-D and 3-D, a priori estimates for geometric quantities of free surfaces, such as the second fundamental form and the injectivity radius of the normal exponential map, and the Sobolev norms of fluid variables are proved by investigating the coupling of the boundary geometry and the interior solutions. An interesting feature for the free surface problem studied in this paper is the loss of one more derivative than the problem of incompressible Euler equations for which a geometric approach was introduced by Christodoulou and Lindblad in [11]. Due to the loss of one more derivative and loss of symmetry of equations, the geometric approach in [11] needs to be substantially developed by exploring the interaction of large variation of temperature, heat-conduction, non-zero divergence of the fluid velocity and the evolution of free surfaces.

Finding a fixed point to a nonexpansive operator, i.e., x = Tx, abstracts many problems in numerical linear algebra, optimization, and other areas of data sciences. To solve xed- point problems, we propose ARock, an algorithmic framework in which multiple agents (machines, processors, or cores) update x in an asynchronous parallel fashion. Asynchrony is crucial to parallel computing since it reduces synchronization wait, relaxes communication bottleneck, and thus speeds up computing significantly. At each step of ARock, an agent updates a randomly selected coordinate xi based on possibly out-of-date information on x. The agents share x through either global memory or communication. If writing xi is atomic, the agents can read and write x without memory locks. We prove that if the nonexpansive operator T has a fixed point, then with probability one, ARock generates a sequence that converges to a fixed point of T. Our conditions on T and step sizes are weaker than comparable work. Linear convergence is obtained under suitable assumptions. We propose special cases of ARock for linear systems, convex optimization, machine learning, as well as distributed and decentralized consensus problems. Numerical experiments of solving sparse logistic regression problems are presented.

We study L^p inequalities that sharpen the triangle inequality for sums of N functions in L^p.

We study the classes of modules which are generated by a silting module. In the case of either hereditary or perfect rings, it is proved that these are exactly the torsion T such that the regular module has a special T-preenvelope. In particular, every torsion-enveloping class in Mod-R are of the form Gen(T) for a minimal silting module T. For the dual case, we obtain for general rings that the covering torsion-free classes of modules are exactly the classes of the form Cogen(T), where T is a cosilting module.

The path complex and its homology were defined in the previous papers of authors. The theory of path complexes is a natural discrete generalization of the theory of simplicial complexes and the homology of path complexes provide homotopy invariant homology theory of digraphs and (nondirected) graphs. In the paper we study the homology theory of path complexes. In particular, we describe functorial properties of paths complexes, introduce notion of homotopy for path complexes and prove the homotopy invariance of path homology groups. We prove also several theorems that are similar to the results of classical homology theory of simplicial complexes. Then we apply obtained results for construction homology theories on various categories of hypergraphs. We describe basic properties of these homology theories and relations between them. As a particular case, these results give new homology theories on the category of simplicial complexes.